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.
Click to reveal answer
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.
Click to reveal answer
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.
Click to reveal answer
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.
Click to reveal answer
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.
Click to reveal answer
Which data structure stores elements in contiguous memory locations?
✗ Incorrect
Arrays store elements contiguously, while linked lists store elements scattered in memory.
Which data structure allows O(1) time access to elements by index?
✗ Incorrect
Arrays allow direct access by index in constant time; linked lists require traversal.
Which data structure requires shifting elements when inserting in the middle?
✗ Incorrect
Arrays require shifting elements to make space; linked lists just update pointers.
Which data structure uses extra memory for pointers?
✗ Incorrect
Linked lists store pointers with each element, increasing memory usage.
Which data structure can easily grow or shrink without resizing?
✗ Incorrect
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.
You got /3 concepts.
Describe scenarios where using a linked list is better than an array and why.
Consider operations that involve changing the list size often.
You got /3 concepts.