Introduction to Data Structures MCQ question and answer with solution

A. Stack

B. Linked List

C. Heap

D. Queue

A. Enqueue

B. Dequeue

C. Push

D. Traverse

A. It has a fixed size

B. It uses a linked list

C. The last position is connected to the first position

D. It can grow dynamically

A. Each node has two pointers

B. It is a type of tree

C. It can be traversed in one direction only

D. It has a circular structure

A. O(n)

B. O(log n)

C. O(n log n)

D. O(1)

A. Stack

B. Queue

C. Array

D. Tree

A. O(n)

B. O(log n)

C. O(n log n)

D. O(1)

A. Page replacement in operating systems

B. Undo mechanism in text editors

C. Resource scheduling

D. Pathfinding algorithms

A. Traversal

B. Insertion

C. Deletion

D. Searching

A. Array

B. Queue

C. Stack

D. Linked List