Quiz: Fundamentals of Array and List Data Structures — 10 domande

1. What is an array in data structures?

A. A collection of elements stored in contiguous memory locations, identified by index or key.

B. A collection of elements stored in non-contiguous memory locations, accessed via pointers.

C. A collection of nodes where each node contains data and a reference to the next node.

D. A linear data structure where elements are added and removed from the top only.

Answer: (A)

Spiegazione

An array is a collection of elements stored in contiguous memory locations, which allows for efficient access via indices. This distinguishes it from linked lists, which store elements in non-contiguous memory with references between nodes, and stacks or linked lists, which have different structural properties.

2. What is the primary characteristic of an array's memory organization?

A. Elements are stored in non-contiguous memory locations, allowing flexible insertion.

B. Elements are stored contiguously in memory, facilitating efficient index-based access.

C. Array elements are stored in a linked list, enabling dynamic resizing.

D. Each element is stored separately in the heap, which allows variable sizes.

Answer: (B)

Spiegazione

Arrays store elements in contiguous memory locations, which allows for constant-time access through indexing. The other options describe different data structures or are inaccurate for arrays.

3. What is the name of the array type that can resize during runtime, allowing for flexible storage?

A. Multidimensional Array

B. Dynamic Array

C. Sparse Array

D. Fixed-size Array

Answer: (B)

Spiegazione

The correct answer is 'Dynamic Array', which is explicitly defined in the content as an array that can resize during runtime, providing flexibility in storage. Fixed-size arrays cannot resize after creation, sparse arrays are optimized for storing mostly default values, and multidimensional arrays are arrays of arrays with more than one dimension.

4. Which of the following is NOT a typical characteristic of static arrays?

A. Their size can be changed after creation.

B. They have a fixed size determined at the time of creation.

C. All elements are of the same data type.

D. They provide direct access to elements using indices.

Answer: (B)

Spiegazione

Static arrays have a fixed size that cannot be changed after creation, which makes option two true and option one false, as the question asks for what is NOT a characteristic.

5. What is the primary function of array operations?

A. To modify or access data within the array

B. To allocate memory dynamically for the array

C. To define the data type of array elements

D. To optimize the array for faster processing

Answer: (A)

Spiegazione

Array operations are primarily used to modify or access data stored within the array. These include tasks like inserting, deleting, traversing, and searching elements. The other options relate to memory management, data type definition, or performance optimization, which are not the main functions of array operations.

6. What advantage do dynamic arrays such as ArrayList or vector offer over static arrays?

A. They allow for resizing during runtime, providing greater flexibility.

B. They store elements in non-contiguous memory locations.

C. They require less memory since their size is fixed.

D. They do not support fast read access.

Answer: (A)

Spiegazione

Dynamic arrays support resizing at runtime, offering flexibility that static arrays lack. This is a key advantage, although resizing can involve overhead.

7. What is a common application of multi-dimensional arrays?

A. Storing a list of user names.

B. Representing images or matrices for mathematical operations.

C. Creating a dynamic list of items.

D. Implementing a queue for efficient processing.

Answer: (B)

Spiegazione

Multi-dimensional arrays are often used to represent data like images or matrices, which have more than one dimension, making them ideal for such applications.

8. Why are arrays considered efficient for data access?

A. Because they use linked storage, allowing for quick insertion and deletion.

B. Because they provide constant-time access (O(1)) to elements via indices.

C. Because their size can dynamically grow and shrink during execution.

D. Because they store elements in a non-contiguous manner for better cache locality.

Answer: (B)

Spiegazione

Arrays provide constant-time access (O(1)) because elements are stored in contiguous memory locations, allowing direct access via indices.

9. What does the term 'homogeneous elements' mean in the context of arrays?

A. All elements in the array are of the same data type.

B. Elements can be of any data type within the array.

C. Elements are stored in multiple data types for versatility.

D. Each element is stored in a separate, non-contiguous memory block.

Answer: (A)

Spiegazione

Homogeneous elements mean all elements in an array must be of the same data type, which is a fundamental property of arrays.

10. Which statement accurately describes the relationship between array operations and their complexity?

A. Insertion and deletion operations are always performed in constant time (O(1)).

B. Insertion and deletion operations tend to be costly (O(n)) because they may require shifting elements.

C. Accessing elements requires traversal, making it an O(n) operation.

D. Arrays do not support insertion or deletion at all.

Answer: (B)

Spiegazione

Insertion and deletion in arrays often require shifting elements, making these operations O(n), especially when inserting or deleting in the middle.