Data Structures MCQs (Set-1)

How are array elements commonly stored?

A As unrelated files
B Only in processor registers
C In a network queue
D In contiguous memory

What is typical indexed array access time?

A O(log n)
B O(n)
C O(n squared)
D O(1)

What does a linked list node usually contain?

A Data and link
B Only an index
C A sort key only
D A file descriptor

What link does a singly linked node have?

A Next node link
B Previous and next links
C Parent and child links
D No links at all

What does a list head identify?

A Last array index
B Middle element
C First node
D Empty queue slot

What is head insertion time in a linked list?

A O(log n)
B O(1)
C O(n)
D O(n squared)

How long can indexed access take in a singly linked list?

A O(1)
B O(n)
C O(log n)
D O(n squared)

What links does a doubly linked node keep?

A Only a parent link
B Two data values
C A hash and key
D Previous and next links

What does a circular list's last node link to?

A A null byte
B The middle node
C The head node
D The list length

Which order does a stack follow?

A First in, first out
B Smallest value first
C Last in, first out
D Highest priority first

What does push do to a stack?

A Removes bottom item
B Adds item on top
C Sorts all items
D Reads queue front

What does pop do to a stack?

A Adds item at bottom
B Reads every item
C Reverses the links
D Removes top item

What does peek do on a stack?

A Adds a new top item
B Reads top without removal
C Removes the whole stack
D Sorts the stored values

Which order does a queue follow?

A First in, first out
B Last in, first out
C Largest value first
D Newest value first

Where does enqueue add an item?

A At the front
B At the middle
C At the root
D At the rear

Where does dequeue remove an item?

A At the front
B At the rear
C At the middle
D At the root

Why use a circular queue?

A Keep values sorted
B Avoid all indexes
C Reuse freed array slots
D Store tree parents

What can a deque support?

A Only sorted insertion
B Only random lookup
C Insertion at both ends
D Tree rotations only

How does a priority queue choose removal?

A By insertion address
B By item priority
C By array capacity
D By alphabetical index

What is stack underflow?

A Adding beyond fixed capacity
B Sorting a queue
C Linking the first node
D Removing from an empty stack

What is overflow in a fixed stack?

A Removing the final item
B Reading its top value
C Adding beyond its capacity
D Reversing its stored items

Which structure checks nested delimiters naturally?

A Queue
B Stack
C Heap
D Hash table

Which structure commonly supports breadth first search?

A Queue
B Stack
C Binary heap
D Hash set

What is an array's main insertion limitation?

A Middle insertion shifts elements
B It cannot store numbers
C It has no indexes
D It cannot be traversed

Which list supports backward traversal directly?

A Doubly linked list
B Singly linked list
C Circular queue
D Binary heap