Data Structures Quiz

Which of the following is a primitive data type in C++?

• Array

• Integer

• Stack

• Queue

An Abstract Data Type (ADT) is:

• Implementation of data only

• A mathematical model with data and operations

• A non-primitive data type only

• Same as primitive data type

What does the base address of an array represent?

• The last element's location

• The middle element's location

• The first element's memory location

• The size of the array

The time complexity of accessing any element in an array using its index is:

• O(1)

• O(n)

• O(log n)

• O(n²)

A sparse array is an array in which:

• All elements are equal

• Most elements are zero or empty

• Only one element is present

• None of the above

Which of the following is NOT an advantage of linked lists over arrays?

• Dynamic size

• Easy insertion and deletion

• Random access of elements

• Efficient memory utilization

Traversal in a linked list means:

• Inserting an element

• Deleting an element

• Visiting each node exactly once

• Searching only the last node

An example of stack application is:

• CPU scheduling

• Undo/Redo in text editor

• Printer queue

• File system navigation

In a circular queue, the condition for overflow is:

• Front = Rear

• (Rear + 1) % Size == Front

• Rear = Size - 1

• Front = 0

Which of the following is true for arrays?

• Elements are stored in random locations

• Size of array is dynamic

• Elements are stored in continuous memory

• Arrays always use linked representation