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

Memory Layout Comparison: Array vs Linked List

📖 Scenario: Imagine you are organizing books on a shelf. You can place them side by side in a row (like an array) or keep each book connected by a string (like a linked list). This project helps you see how these two ways store data differently in memory.

🎯 Goal: You will create an array and a linked list with the same numbers, then print their memory addresses to compare how they are stored in memory.

📋 What You'll Learn

Create an array of integers with exact values 10, 20, 30

Create a linked list with nodes holding values 10, 20, 30

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 in optimizing programs for speed and memory usage, important in systems programming and embedded devices.

💼 Career

Many software engineering roles require knowledge of data structures and their memory behavior to write efficient code.

1

Create an array with exact values

Create an array called arr with integers 10, 20, and 30.

DSA Go

# Your code here

Hint

Use Go's array syntax with fixed size and initialize with the three numbers.

2

Create a linked list with nodes holding values

Define a struct called Node with an integer value and a pointer next to Node. Then create three nodes with values 10, 20, and 30 linked together as head.

DSA Go

package main

type Node struct {
    value int
    next  *Node
}

func main() {
    arr := [3]int{10, 20, 30}
    // Your code here
}

Hint

Define the Node struct outside main. Create nodes from last to first linking with next.

3

Print memory addresses of array elements and linked list nodes

Use a for loop with variable i from 0 to 2 to print the memory address of arr[i]. Then use a for loop with variable current to traverse the linked list starting from head and print the memory address of each node.

DSA Go

package main

type Node struct {
    value int
    next  *Node
}

func main() {
    arr := [3]int{10, 20, 30}

    node3 := &Node{value: 30, next: nil}
    node2 := &Node{value: 20, next: node3}
    head := &Node{value: 10, next: node2}

    // Your code here
}

Hint

Use fmt.Printf with %p to print addresses. Loop over array indices and linked list nodes.

4

Print final output showing memory layout comparison

Run the program to print the memory addresses of array elements and linked list nodes as shown in the code.

DSA Go

package main

type Node struct {
    value int
    next  *Node
}

import "fmt"

func main() {
    arr := [3]int{10, 20, 30}

    node3 := &Node{value: 30, next: nil}
    node2 := &Node{value: 20, next: node3}
    head := &Node{value: 10, next: node2}

    for i := 0; i < 3; i++ {
        fmt.Printf("Address of arr[%d]: %p\n", i, &arr[i])
    }

    current := head
    for current != nil {
        fmt.Printf("Address of node with value %d: %p\n", current.value, current)
        current = current.next
    }

    // Your code here
}

Hint

Run the program and observe the printed memory addresses. Array addresses are usually contiguous, linked list addresses are not.

Practice

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

easy

A. Both array and linked list elements are scattered randomly in memory.

B. Both array and linked list elements are stored contiguously in memory.

C. Linked list elements are stored contiguously, but array elements are scattered in memory.

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

Solution

1. Step 1: Understand array memory layout

   Arrays store elements in a continuous block of memory, one after another.

2. Step 2: Understand linked list memory layout

   Linked list nodes are allocated separately and linked via pointers, so they are scattered.

3. Final Answer:

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

4. Quick Check:

   Array = contiguous, Linked list = scattered [OK]

Hint: Arrays are continuous; linked lists use pointers to scattered nodes [OK]

Common Mistakes:

• Thinking linked list nodes are stored contiguously
• Confusing array and linked list memory layouts
• Assuming both have same memory layout

2. Which Go syntax correctly declares an array of 5 integers?

easy

A. var arr []int = [5]

B. arr := []int{5}

C. var arr [5]int

D. arr := [5]int

Solution

1. Step 1: Recall Go array declaration syntax

   Arrays are declared with fixed size inside square brackets before the type, e.g., [5]int.

2. Step 2: Check each option

   A: var arr [5]int uses correct syntax. B: arr := []int{5} creates a slice with one element. C: var arr []int = [5] is invalid syntax. D: arr := [5]int is invalid syntax - missing composite literal {}.

3. Final Answer:

   var arr [5]int -> Option C

4. Quick Check:

   Array declaration = var arr [5]int [OK]

Hint: Array size goes inside brackets before type in Go [OK]

Common Mistakes:

• Using slice syntax instead of array syntax
• Placing size after type
• Incorrect initialization syntax

3. Consider this Go code snippet:

package main

import "fmt"

type Node struct {
    value int
    next  *Node
}

func main() {
    var head *Node
    head = &Node{value: 1}
    head.next = &Node{value: 2}
    head.next.next = &Node{value: 3}
    
    arr := [3]int{1, 2, 3}
    
    fmt.Println(arr)
    fmt.Println(head.value, head.next.value, head.next.next.value)
}

What will be the output?

medium

A. [1 2 3]
3 2 1

B. [1 2 3]
1 2 3

C. [1 2 3]
1 3 2

D. Compilation error

Solution

1. Step 1: Understand array print output

   Array arr contains [1, 2, 3], so fmt.Println(arr) prints [1 2 3].

2. Step 2: Understand linked list traversal print

   head.value = 1, head.next.value = 2, head.next.next.value = 3, so printing them in order prints '1 2 3'.

3. Final Answer:

   [1 2 3] 1 2 3 -> Option B

4. Quick Check:

   Array and linked list values match printed order [OK]

Hint: Print array and linked list values in order to verify [OK]

Common Mistakes:

• Confusing linked list node order
• Expecting commas in array print
• Assuming compilation error due to pointers

4. The following Go code attempts to create a linked list but has an error:

type Node struct {
    value int
    next  *Node
}

func main() {
    var head *Node
    head.value = 10
    head.next = nil
}

What is the error and how to fix it?

medium

A. head is nil pointer; initialize head before assigning fields

B. next field should be value, not pointer

C. value field must be a pointer type

D. No error; code runs fine

Solution

1. Step 1: Identify pointer initialization issue

   head is declared as *Node but not initialized, so it is nil (no memory allocated).

2. Step 2: Fix by allocating memory for head

   Use head = &Node{} before assigning head.value and head.next to avoid nil pointer dereference.

3. Final Answer:

   head is nil pointer; initialize head before assigning fields -> Option A

4. Quick Check:

   Nil pointer must be initialized before use [OK]

Hint: Always allocate memory for pointer before field access [OK]

Common Mistakes:

• Assigning fields on nil pointer
• Changing field types unnecessarily
• Ignoring runtime panic from nil dereference

5. You want to store 1 million 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 scattered nodes make insertions and deletions faster despite poor cache usage

B. Linked List, because arrays cannot store large data

C. Array, because insertions and deletions are always faster in arrays

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

Solution

1. Step 1: Analyze insertion/deletion cost in arrays

   Arrays store data contiguously, so inserting or deleting in the middle requires shifting many elements, which is slow.

2. Step 2: Analyze linked list insertion/deletion

   Linked lists store nodes scattered but allow fast insert/delete by changing pointers without shifting elements.

3. Step 3: Consider memory and cache trade-offs

   Arrays have better cache performance due to contiguous memory, but linked lists are better for frequent middle insertions/deletions.

4. Final Answer:

   Linked List, because scattered nodes make insertions and deletions faster despite poor cache usage -> Option A

5. Quick Check:

   Frequent middle insert/delete favors linked list [OK]

Hint: Frequent middle insert/delete? Choose linked list despite cache cost [OK]

Common Mistakes:

• Assuming arrays always faster for insert/delete
• Ignoring shifting cost in arrays
• Thinking arrays can't store large data