Memory Layout Comparison Array vs Linked List in DSA C - Build Both Approaches

Memory Layout Comparison: Array vs Linked List

📖 Scenario: Imagine you are organizing a bookshelf. You want to understand how books are stored differently when placed side-by-side on a shelf (like an array) versus when each book is kept in a separate box connected by strings (like a linked list).

🎯 Goal: You will create a simple array and a linked list with the same numbers. Then, you will print their memory addresses to see how they are stored in memory differently.

📋 What You'll Learn

Create an integer array called arr with values 10, 20, 30, 40, 50

Create a linked list with nodes containing the same values in the same order

Print the memory addresses of each element in the array

Print the memory addresses of each node in the linked list

💡 Why This Matters

🌍 Real World

Understanding memory layout helps optimize programs for speed and memory usage, important in systems programming and embedded devices.

💼 Career

Software developers and system engineers often need to choose the right data structure based on memory and performance characteristics.

1

Create an integer array with fixed values

Create an integer array called arr with exactly these values: 10, 20, 30, 40, 50.

DSA C

# Create the integer array 'arr' with the given values
// Your code here

Hint

Use the syntax int arr[5] = {10, 20, 30, 40, 50}; to create the array.

2

Define the linked list node and create the list

Define a struct called Node with an integer data and a pointer next. Then create 5 nodes with values 10, 20, 30, 40, 50 linked in order, and assign the head pointer head to the first node.

DSA C

#include 
#include 

// Define struct Node here
// Create linked list nodes and link them
// Assign head pointer

int main() {
    int arr[5] = {10, 20, 30, 40, 50};
    // Your code here
    return 0;
}

Hint

Define the struct with int data and struct Node* next. Use malloc to create nodes and link them with next.

3

Print memory addresses of array elements and linked list nodes

Use a for loop with variable i to print the memory addresses of each element in arr. Then use a while loop with a pointer current starting at head to print the memory addresses of each linked list node.

DSA C

#include 
#include 

struct Node {
    int data;
    struct Node* next;
};

int main() {
    int arr[5] = {10, 20, 30, 40, 50};

    struct Node* head = malloc(sizeof(struct Node));
    struct Node* second = malloc(sizeof(struct Node));
    struct Node* third = malloc(sizeof(struct Node));
    struct Node* fourth = malloc(sizeof(struct Node));
    struct Node* fifth = malloc(sizeof(struct Node));

    head->data = 10;
    head->next = second;

    second->data = 20;
    second->next = third;

    third->data = 30;
    third->next = fourth;

    fourth->data = 40;
    fourth->next = fifth;

    fifth->data = 50;
    fifth->next = NULL;

    // Print array element addresses
    // Print linked list node addresses
    // Your code here

    return 0;
}

Hint

Use a for loop to print array addresses with &arr[i]. Use a while loop to traverse linked list nodes and print their addresses.

4

Print the final output showing memory layout comparison

Run the program to print the memory addresses of array elements and linked list nodes. The output should show contiguous addresses for the array and scattered addresses for the linked list.

DSA C

#include 
#include 

struct Node {
    int data;
    struct Node* next;
};

int main() {
    int arr[5] = {10, 20, 30, 40, 50};

    struct Node* head = malloc(sizeof(struct Node));
    struct Node* second = malloc(sizeof(struct Node));
    struct Node* third = malloc(sizeof(struct Node));
    struct Node* fourth = malloc(sizeof(struct Node));
    struct Node* fifth = malloc(sizeof(struct Node));

    head->data = 10;
    head->next = second;

    second->data = 20;
    second->next = third;

    third->data = 30;
    third->next = fourth;

    fourth->data = 40;
    fourth->next = fifth;

    fifth->data = 50;
    fifth->next = NULL;

    printf("Array element addresses:\n");
    for (int i = 0; i next;
        index++;
    }

    return 0;
}

// Run the program to see the output

Hint

Run the program to see the memory addresses printed. Notice the array addresses are close together, while linked list nodes are scattered.

Practice

1. Which of the following best describes the memory layout of an array compared to a linked list?

easy

A. Array elements are scattered in memory, while linked list nodes are stored contiguously.

B. Array elements are stored in contiguous memory locations, while linked list nodes are scattered in memory.

C. Both array and linked list nodes are stored contiguously in memory.

D. Both array and linked list nodes are scattered randomly in memory.

Solution

1. Step 1: Understand array memory layout

   Arrays store elements in contiguous memory blocks, meaning all elements are next to each other.

2. Step 2: Understand linked list memory layout

   Linked list nodes are allocated separately and linked by pointers, so they can be scattered anywhere in memory.

3. Final Answer:

   Array elements are stored in contiguous memory locations, while linked list nodes are scattered in memory. -> Option B

4. Quick Check:

   Array = contiguous, Linked List = scattered [OK]

Hint: Arrays use continuous memory; linked lists use scattered nodes [OK]

Common Mistakes:

• Thinking linked list nodes are stored contiguously
• Confusing array and linked list memory layouts
• Assuming both use the same memory pattern

2. Which C declaration correctly defines a linked list node struct with an integer data and a pointer to the next node?

easy

A. typedef struct Node { int data; struct Node* next; } Node;

B. typedef struct Node { int data; int* next; } Node;

C. typedef struct Node { int data; Node* next; } Node;

D. typedef struct Node { int data; struct Node next; } Node;

Solution

1. Step 1: Check pointer to next node type

   The next pointer must be of type 'struct Node*' to point to the next node's address.

2. Step 2: Validate struct syntax

   Using 'struct Node* next;' inside the struct is correct. Using 'Node* next;' without typedef before is invalid here.

3. Final Answer:

   typedef struct Node { int data; struct Node* next; } Node; -> Option A

4. Quick Check:

   Pointer to struct Node = struct Node* [OK]

Hint: Use 'struct Node*' inside struct before typedef completes [OK]

Common Mistakes:

• Using 'int* next' instead of pointer to struct
• Using 'Node* next' before typedef is complete
• Declaring 'struct Node next' causing infinite size

3. Consider the following C code snippet:

int arr[3] = {10, 20, 30};
struct Node {
  int data;
  struct Node* next;
};
struct Node n1 = {10, NULL};
struct Node n2 = {20, NULL};
n1.next = &n2;
printf("%d %d\n", arr[1], n1.next->data);

What is the output?

medium

A. 20 20

B. 10 20

C. 20 10

D. 10 10

Solution

1. Step 1: Identify arr[1] value

   arr[1] is the second element of array, which is 20.

2. Step 2: Identify n1.next->data value

   n1.next points to n2, whose data is 20.

3. Final Answer:

   20 20 -> Option A

4. Quick Check:

   arr[1] = 20, n1.next->data = 20 [OK]

Hint: Array index 1 and linked list next node data both 20 [OK]

Common Mistakes:

• Confusing array index starting at 0
• Misreading pointer access syntax
• Assuming n1.next->data is 10 instead of 20

4. The following code attempts to create a linked list node but causes a runtime error. What is the main issue?

struct Node {
  int data;
  struct Node* next;
};

struct Node* createNode(int val) {
  struct Node node;
  node.data = val;
  node.next = NULL;
  return &node;
}

medium

A. Not initializing the data field before returning.

B. Missing memory allocation with malloc for the node.

C. Returning address of a local variable which becomes invalid after function ends.

D. Incorrect struct pointer type in return statement.

Solution

1. Step 1: Analyze variable lifetime

   The variable 'node' is local to createNode function and is destroyed when function returns.

2. Step 2: Understand pointer return issue

   Returning address of local variable leads to invalid pointer and undefined behavior.

3. Final Answer:

   Returning address of a local variable which becomes invalid after function ends. -> Option C

4. Quick Check:

   Local variable address returned = invalid pointer [OK]

Hint: Never return address of local variables from functions [OK]

Common Mistakes:

• Assuming pointer remains valid after function ends
• Ignoring need for dynamic memory allocation
• Confusing pointer types in return

5. You want to store 1000 integers and frequently insert and delete elements in the middle. Considering memory layout and performance, which data structure is better and why?

1. Array
2. Linked List

hard

A. Linked List, because it stores elements contiguously for faster access.

B. Array, because contiguous memory improves cache performance despite costly insertions.

C. Array, because it uses less memory than linked list nodes with pointers.

D. Linked List, because scattered nodes allow fast insertions and deletions anywhere.

Solution

1. Step 1: Consider insertion and deletion costs

   Arrays require shifting elements for insert/delete in middle, which is slow.

2. Step 2: Consider linked list advantages

   Linked lists allow quick insert/delete by changing pointers without shifting elements.

3. Step 3: Consider memory layout tradeoff

   Linked list nodes are scattered, which may reduce cache speed but improve insertion/deletion speed.

4. Final Answer:

   Linked List, because scattered nodes allow fast insertions and deletions anywhere. -> Option D

5. Quick Check:

   Fast insert/delete middle = Linked List [OK]

Hint: Linked list excels at fast insert/delete in middle despite scattered memory [OK]

Common Mistakes:

• Choosing array for fast insert/delete in middle
• Ignoring pointer overhead in linked list
• Assuming linked list stores elements contiguously