Memory Layout Comparison Array vs Linked List in DSA Rust - Key Differences

Recall & Review

beginner

What is the main difference in memory layout between an array and a linked list?

An array stores elements in a contiguous block of memory, while a linked list stores elements scattered in memory with each element pointing to the next.

intermediate

Why does an array have better cache performance than a linked list?

Because array elements are stored contiguously, the CPU cache can load multiple elements at once, making access faster. Linked list nodes are scattered, causing more cache misses.

intermediate

In Rust, how is a linked list node typically represented in memory?

A linked list node in Rust usually contains the data and a pointer (Box or Rc) to the next node, which may be stored anywhere in the heap.

beginner

What is a downside of arrays due to their memory layout?

Arrays have a fixed size and require resizing (copying to a new block) if they grow beyond their capacity, which can be costly.

intermediate

How does the memory layout affect insertion time in arrays vs linked lists?

In arrays, insertion (except at the end) requires shifting elements, which is slow. In linked lists, insertion is faster because it only changes pointers without moving elements.

Which data structure stores elements in contiguous memory locations?

A Both

B Linked List

C Array

D Neither

Arrays store elements contiguously, while linked lists store elements scattered with pointers.

Why might a linked list have slower access times than an array?

A Because linked lists use more memory

B Because linked list nodes are scattered in memory causing cache misses

C Because arrays use pointers

D Because linked lists store elements contiguously

Linked list nodes are scattered, so CPU cache cannot efficiently load them, slowing access.

In Rust, what type is commonly used to point to the next node in a linked list?

A Box

B Vec

C Array

D HashMap

Box is used to allocate nodes on the heap and hold pointers to next nodes in Rust linked lists.

Which operation is generally faster in a linked list compared to an array?

A Insertion at the beginning

B Accessing the last element

C Random access

D Sorting

Insertion at the beginning is faster in linked lists because it only changes pointers without shifting elements.

What is a disadvantage of arrays due to their memory layout?

A They use pointers for each element

B They cannot store primitive types

C They have slower access times

D They require resizing and copying when full

Arrays have fixed size and resizing requires copying elements to a new block, which is costly.

Explain how the memory layout of arrays and linked lists affects their performance in accessing elements.

Think about how CPU cache works with continuous vs scattered memory.

Describe the impact of memory layout on insertion operations in arrays and linked lists.

Consider what needs to move or change in memory for insertion.

Practice

1. Which statement best describes the memory layout difference between an array and a linked list?

easy

A. A linked list stores elements contiguously, but an array uses pointers between elements.

B. Both array and linked list store elements contiguously in memory.

C. Arrays use pointers to link elements, linked lists store elements contiguously.

D. An array stores elements contiguously in memory, while a linked list stores elements scattered with pointers.

Solution

1. Step 1: Understand array memory layout

   An array stores all its elements in a continuous block of memory, so elements are next to each other.

2. Step 2: Understand linked list memory layout

   A linked list stores each element separately in memory, and each element has a pointer to the next, so elements are scattered.

3. Final Answer:

   An array stores elements contiguously in memory, while a linked list stores elements scattered with pointers. -> Option D

4. Quick Check:

   Array = contiguous, Linked list = scattered with pointers [OK]

Hint: Arrays are continuous blocks; linked lists use pointers [OK]

Common Mistakes:

• Thinking linked lists store elements contiguously
• Confusing pointers usage between arrays and linked lists
• Assuming arrays use pointers between elements

2. Which Rust code snippet correctly declares a fixed-size array of 5 integers with explicit type annotation?

easy

A. let arr = [1, 2, 3, 4, 5];

B. let arr = vec![1, 2, 3, 4, 5];

C. let arr: [i32; 5] = [1, 2, 3, 4, 5];

D. let arr = (1, 2, 3, 4, 5);

Solution

1. Step 1: Identify fixed-size array syntax in Rust

   Rust fixed-size arrays require type and size: [type; size].

2. Step 2: Check each option

   let arr: [i32; 5] = [1, 2, 3, 4, 5]; uses let arr: [i32; 5] = [1, 2, 3, 4, 5]; which is correct fixed-size array syntax.

3. Final Answer:

   let arr: [i32; 5] = [1, 2, 3, 4, 5]; -> Option C

4. Quick Check:

   Fixed-size array syntax = [type; size] [OK]

Hint: Fixed arrays need type and size: [type; size] [OK]

Common Mistakes:

• Using vec! macro for fixed-size array
• Missing type and size in array declaration
• Using tuple syntax instead of array

3. Consider this Rust code creating a linked list node struct and two nodes linked together:

struct Node {
    value: i32,
    next: Option,
}

fn main() {
    let node2 = Node { value: 20, next: None };
    let node1 = Node { value: 10, next: Some(Box::new(node2)) };
    println!("{} -> {} -> None", node1.value, node1.next.as_ref().unwrap().value);
}

What is the printed output?

medium

A. 10 -> 20 -> None

B. 20 -> 10 -> None

C. 10 -> None -> None

D. Compilation error due to ownership

Solution

1. Step 1: Understand node creation and linking

   node2 has value 20 and no next node. node1 has value 10 and points to node2 via Box.

2. Step 2: Trace the print statement

   Prints node1.value (10), then node1.next's value (20), then "None" for end.

3. Final Answer:

   10 -> 20 -> None -> Option A

4. Quick Check:

   Linked nodes print values in order: 10 then 20 [OK]

Hint: Follow pointers to print linked list values [OK]

Common Mistakes:

• Confusing order of nodes
• Expecting None printed as value
• Thinking ownership causes compile error here

4. This Rust code tries to create a linked list but fails to compile:

struct Node {
    value: i32,
    next: Option,
}

fn main() {
    let node1 = Node { value: 10, next: None };
    let node2 = Node { value: 20, next: Some(Box::new(node1)) };
    println!("{} -> {} -> None", node1.value, node2.value);
}

What is the main reason for the compilation error?

medium

A. Use of moved value: node1 is moved into node2 and cannot be used again

B. Missing lifetime annotations on struct Node

C. Box cannot be used inside Option

D. Printing node2.value is invalid syntax

Solution

1. Step 1: Analyze ownership of node1

   node1 is moved into Box inside node2's next field, so node1 cannot be used after move.

2. Step 2: Identify error cause

   Because node1 is moved, any further use or move causes compile error "use of moved value".

3. Final Answer:

   Use of moved value: node1 is moved into node2 and cannot be used again -> Option A

4. Quick Check:

   Ownership moved node1 causes compile error [OK]

Hint: Moving ownership invalidates original variable [OK]

Common Mistakes:

• Thinking Box inside Option is invalid
• Assuming missing lifetimes cause error here
• Believing print syntax is wrong

5. You want to store 1 million integers and frequently access elements by index. Considering memory layout and performance, which data structure is better in Rust and why?

hard

A. Array, because linked lists cannot store integers efficiently.

B. Array, because elements are stored contiguously allowing fast index access and better cache usage.

C. Linked list, because it uses less memory than arrays for large data.

D. Linked list, because it uses pointers and is faster for random access.

Solution

1. Step 1: Consider access pattern and memory layout

   Arrays store elements contiguously, so accessing by index is O(1) and cache-friendly.

2. Step 2: Compare linked list access and memory use

   Linked lists store elements scattered with pointers, making index access O(n) and less cache efficient.

3. Final Answer:

   Array, because elements are stored contiguously allowing fast index access and better cache usage. -> Option B

4. Quick Check:

   Contiguous arrays = fast index access [OK]

Hint: For fast index access, choose arrays over linked lists [OK]

Common Mistakes:

• Assuming linked lists are faster for index access
• Thinking linked lists use less memory for large data
• Believing arrays cannot store large data efficiently