Linked list vs array comparison in Data Structures Theory - Quick Revision & Key Differences

Recall & Review

beginner

What is a key difference in memory allocation between arrays and linked lists?

Arrays use contiguous memory blocks, meaning all elements are stored next to each other. Linked lists use scattered memory locations where each element points to the next.

beginner

Which data structure allows faster access to elements by index: array or linked list?

Arrays allow faster access by index because elements are stored contiguously, so the position can be calculated directly. Linked lists require traversal from the start to reach an element.

beginner

Why might a linked list be preferred over an array when frequent insertions and deletions are needed?

Linked lists allow easy insertion and deletion without shifting elements, as you only change pointers. Arrays require shifting elements, which can be slower.

intermediate

What is a disadvantage of linked lists compared to arrays in terms of memory usage?

Linked lists use extra memory for storing pointers with each element, which arrays do not need. This overhead can make linked lists less memory efficient.

beginner

How does the size flexibility of linked lists compare to arrays?

Linked lists can grow or shrink dynamically without needing to allocate a fixed size upfront. Arrays usually have a fixed size or require resizing, which can be costly.

Which data structure stores elements in contiguous memory locations?

A Array

B Linked list

C Both

D Neither

Arrays store elements contiguously, while linked lists store elements scattered in memory.

Which data structure allows O(1) time access to elements by index?

A Both

B Linked list

C Array

D None

Arrays allow direct access by index in constant time; linked lists require traversal.

Which data structure requires shifting elements when inserting in the middle?

A Linked list

B Array

C Both

D Neither

Arrays require shifting elements to make space; linked lists just update pointers.

Which data structure uses extra memory for pointers?

A Neither

B Array

C Both

D Linked list

Linked lists store pointers with each element, increasing memory usage.

Which data structure can easily grow or shrink without resizing?

A Linked list

B None

C Both

D Array

Linked lists can dynamically grow or shrink by adding or removing nodes.

Explain the main differences between arrays and linked lists in terms of memory allocation, access speed, and flexibility.

Think about how elements are stored and accessed in each structure.

Describe scenarios where using a linked list is better than an array and why.

Consider operations that involve changing the list size often.

Practice

1. Which data structure stores elements in continuous memory locations?

easy

A. Linked list

B. Graph

C. Tree

D. Array

Solution

1. Step 1: Understand array memory layout

   Arrays store elements in continuous memory blocks, allowing direct access by index.

2. Step 2: Compare with linked list memory layout

   Linked lists store elements in nodes scattered in memory, connected by pointers.

3. Final Answer:

   Array -> Option D

4. Quick Check:

   Continuous memory = Array [OK]

Hint: Continuous memory means array, not linked list [OK]

Common Mistakes:

• Confusing linked list nodes as continuous
• Thinking trees or graphs store data continuously
• Assuming arrays use pointers between elements

2. Which of the following is the correct way to access the 3rd element in an array named arr?

easy

A. arr[3]

B. arr(3)

C. arr[2]

D. arr->3

Solution

1. Step 1: Recall zero-based indexing in arrays

   Arrays start counting from 0, so the first element is arr[0], second arr[1], third arr[2].

2. Step 2: Identify correct syntax

   Using square brackets with index 2 accesses the third element correctly.

3. Final Answer:

   arr[2] -> Option C

4. Quick Check:

   Third element index = 2 [OK]

Hint: Array indexing starts at zero, so third element is index 2 [OK]

Common Mistakes:

• Using parentheses instead of brackets
• Using index 3 for third element
• Using pointer syntax incorrectly

3. Consider this code snippet using a linked list:

node1 = Node(10)
node2 = Node(20)
node1.next = node2
print(node1.next.data)

What will be the output?

medium

A. 20

B. node2

C. 10

D. Error

Solution

1. Step 1: Understand node linking

   node1.next points to node2, which holds data 20.

2. Step 2: Access data through next pointer

   node1.next.data accesses node2's data, which is 20.

3. Final Answer:

   20 -> Option A

4. Quick Check:

   node1.next.data = 20 [OK]

Hint: Follow the next pointer to get linked node's data [OK]

Common Mistakes:

• Printing node1.data instead of node1.next.data
• Confusing node reference with data value
• Expecting error due to missing initialization

4. What is wrong with this code snippet for inserting a new node at the start of a linked list?

new_node = Node(5)
new_node.next = head
head = new_node.next

medium

A. head should be assigned to new_node, not new_node.next

B. new_node.next should be null before assignment

C. Node creation syntax is incorrect

D. No error, code is correct

Solution

1. Step 1: Analyze pointer assignments

   new_node.next is set to head, which is correct to link new node to list.

2. Step 2: Check head update

   head should point to new_node to update list start, but code assigns head = new_node.next, losing new_node.

3. Final Answer:

   head should be assigned to new_node, not new_node.next -> Option A

4. Quick Check:

   Head must point to new node [OK]

Hint: Head must point to new node after insertion [OK]

Common Mistakes:

• Assigning head to new_node.next instead of new_node
• Not linking new_node.next to old head
• Confusing node creation with pointer assignment

5. You need to frequently add and remove elements from the middle of a collection. Which data structure is better and why?

hard

A. Array, because it allows fast random access

B. Linked list, because it allows easy insertion and deletion without shifting elements

C. Array, because it uses less memory

D. Linked list, because it stores elements in continuous memory

Solution

1. Step 1: Consider insertion and deletion costs

   Arrays require shifting elements when inserting or deleting in the middle, which is slow.

2. Step 2: Understand linked list flexibility

   Linked lists use pointers to connect nodes, so insertion and deletion in the middle is fast without shifting.

3. Final Answer:

   Linked list, because it allows easy insertion and deletion without shifting elements -> Option B

4. Quick Check:

   Frequent middle changes = Linked list [OK]

Hint: Use linked list for easy middle insert/delete [OK]

Common Mistakes:

• Choosing array for middle insert/delete ignoring shift cost
• Thinking linked list stores data continuously
• Assuming arrays always use less memory