Arrays and Lists Quiz: Test Your Understanding of Data Structures

📚 Quick Study Guide

• 🧮 Arrays are fixed-size, contiguous blocks of memory.
• 🔗 Lists (like ArrayLists or LinkedLists) are dynamic in size.
• ⏱️ Accessing an element in an array is O(1) (constant time).
• ➕ Adding or removing elements in a list can be O(n) (linear time) in the worst case, especially for ArrayLists.
• ↔️ LinkedLists have O(1) insertion/deletion at the ends, but O(n) access time.
• 💾 Arrays store elements directly, while Lists store references to objects.
• 📐 The index of the first element in an array or list is usually 0.

Practice Quiz

1. Which of the following is a key difference between arrays and lists?
   1. Arrays are dynamic in size, while lists are fixed.
   2. Arrays store elements directly, while lists store references.
   3. Lists can only store integers, while arrays can store any data type.
   4. Arrays are only used in functional programming.
2. What is the time complexity to access an element in an array by its index?
   1. O(n)
   2. O(log n)
   3. O(1)
   4. O(n^2)
3. In the worst-case scenario, what is the time complexity to insert an element at the beginning of an ArrayList?
   1. O(1)
   2. O(log n)
   3. O(n)
   4. O(n log n)
4. Which data structure allows for efficient insertion and deletion at both ends?
   1. Array
   2. ArrayList
   3. LinkedList
   4. Stack
5. What is the index of the first element in most array-based data structures?
   1. 1
   2. -1
   3. 0
   4. It varies depending on the implementation.
6. Which operation is generally faster in an array compared to a linked list?
   1. Inserting at the beginning
   2. Deleting at the end
   3. Accessing an element by index
   4. Resizing the structure
7. Which of the following data structures uses contiguous memory allocation?
   1. Linked List
   2. Array
   3. Hash Table
   4. Tree