Introduction to Data Structures

47
Score: 0
Attempted: 0/47

1. : Which of the following is a linear data structure?
(A) Stack
(B) Tree
(C) Graph
(D) Hash Table

2. : Which data structure uses LIFO (Last In First Out) order?
(A) Queue
(B) Array
(C) Stack
(D) Linked List

3. : What is the primary purpose of a queue?
(A) To store data randomly
(B) To manage tasks in a specific order
(C) To allow random access to elements
(D) To implement recursion

4. : In which data structure can insertion and deletion be done from both ends?
(A) Stack
(B) Queue
(C) Deque
(D) Array

5. : Which of the following is NOT a characteristic of a linked list?
(A) Dynamic size
(B) Sequential access
(C) Non-contiguous memory allocation
(D) Fixed size

6. : What is the time complexity of accessing an element in an array?
(A) O(n)
(B) O(log n)
(C) O(1)
(D) O(n²)

7. : Which data structure is best suited for implementing recursion?
(A) Stack
(B) Queue
(C) Linked List
(D) Array

8. : What does a binary tree node typically contain?
(A) Data and two child pointers
(B) Data and a single child pointer
(C) Data only
(D) Data and multiple child pointers

9. : Which traversal method visits nodes in the order: left, root, right?
(A) Preorder
(B) Inorder
(C) Postorder
(D) Level order

10. : What is the maximum number of children a binary tree node can have?
(A) One
(B) Two
(C) Three
(D) Any number

11. : Which of the following is a self-balancing binary search tree?
(A) AVL Tree
(B) Binary Tree
(C) Red-Black Tree
(D) Both A and C

12. : What is the primary advantage of using a hash table?
(A) Sequential access
(B) Fast access time
(C) Low memory usage
(D) Easy implementation

13. : Which of the following is true about a circular linked list?
(A) It has a head and tail
(B) It can be single or doubly linked
(C) The last node points to the first node
(D) All of the above

14. : Which sorting algorithm has the best average case time complexity?
(A) Bubble Sort
(B) Quick Sort
(C) Selection Sort
(D) Insertion Sort

15. : What is the time complexity of inserting an element in a balanced binary search tree?
(A) O(n)
(B) O(log n)
(C) O(n²)
(D) O(1)

16. : In which data structure are elements added at the back and removed from the front?
(A) Stack
(B) Queue
(C) Linked List
(D) Array

17. : Which of the following operations is NOT typically performed on a stack?
(A) Push
(B) Pop
(C) Enqueue
(D) Peek

18. : What is a disadvantage of linked lists compared to arrays?
(A) Dynamic size
(B) Ease of insertion
(C) Random access
(D) Memory efficiency

19. : What type of data structure is used to implement a priority queue?
(A) Array
(B) Stack
(C) Heap
(D) Linked List

20. : Which data structure is best for implementing a function call stack?
(A) Array
(B) Queue
(C) Stack
(D) Tree

21. : In a binary search tree, the left child is always…
(A) Greater than the parent
(B) Less than the parent
(C) Equal to the parent
(D) None of the above

22. : What is the main characteristic of a graph?
(A) All elements are connected
(B) It consists of nodes and edges
(C) It can only have one path between nodes
(D) It has a fixed number of nodes

23. : Which of the following is a characteristic of a depth-first search?
(A) It uses a queue
(B) It explores all neighbors before moving deeper
(C) It can be implemented using a stack
(D) It always finds the shortest path

24. : Which of the following data structures can have duplicate elements?
(A) Set
(B) Stack
(C) Queue
(D) Both B and C

25. : What is the primary disadvantage of a hash table?
(A) Complexity of implementation
(B) No support for duplicate keys
(C) Poor cache performance
(D) All of the above

26. : Which of the following is a non-linear data structure?
(A) Array
(B) Linked List
(C) Tree
(D) Queue

27. : What is the space complexity of an array of size n?
(A) O(1)
(B) O(n)
(C) O(n²)
(D) O(log n)

28. : Which traversal method visits nodes in the order: root, left, right?
(A) Inorder
(B) Preorder
(C) Postorder
(D) Level order

29. : In a doubly linked list, each node contains…
(A) One pointer to the next node
(B) Two pointers, one for the next and one for the previous node
(C) Three pointers for child nodes
(D) No pointers

30. : Which of the following sorting algorithms has the worst case time complexity of O(n²)?
(A) Merge Sort
(B) Quick Sort
(C) Bubble Sort
(D) Heap Sort

31. : What is the average time complexity for searching an element in a binary search tree?
(A) O(n)
(B) O(log n)
(C) O(n²)
(D) O(1)

32. : In which data structure are elements ordered by priority?
(A) Stack
(B) Queue
(C) Priority Queue
(D) Linked List

33. : Which data structure is used to implement breadth-first search?
(A) Stack
(B) Queue
(C) Array
(D) Linked List

34. : What is the primary benefit of using a binary search tree?
(A) Fast insertion
(B) Fast searching
(C) No duplicate values
(D) All of the above

35. : Which of the following represents a non-linear data structure?
(A) Array
(B) Stack
(C) Graph
(D) Queue

36. : What is the time complexity of deleting the minimum element from a min-heap?
(A) O(n)
(B) O(log n)
(C) O(1)
(D) O(n log n)

37. : Which data structure allows for efficient insertion and deletion at both ends?
(A) Array
(B) Linked List
(C) Deque
(D) Stack

38. : What is a key characteristic of a hash function?
(A) It must be reversible
(B) It should produce a unique output for every input
(C) It should distribute keys uniformly across the hash table
(D) It must be computationally expensive

39. : What is the worst-case time complexity of searching in a balanced binary search tree?
(A) O(n)
(B) O(log n)
(C) O(n²)
(D) O(1)

40. : Which of the following is not a type of linked list?
(A) Singly Linked List
(B) Doubly Linked List
(C) Circular Linked List
(D) Hybrid Linked List

41. : Which traversal of a tree is used to obtain a sorted order of elements?
(A) Preorder
(B) Postorder
(C) Inorder
(D) Level Order

42. : What data structure is ideal for implementing a function call?
(A) Array
(B) Stack
(C) Queue
(D) Tree

43. : What is the average-case time complexity for insertion in a hash table?
(A) O(n)
(B) O(log n)
(C) O(1)
(D) O(n log n)

44. : In a binary tree, the maximum number of nodes at level k is given by…
(A) k
(B) 2^k
(C) 2^(k-1)
(D) k²

45. : What is a key advantage of using an array over a linked list?
(A) Dynamic size
(B) Ease of implementation
(C) Random access
(D) Memory efficiency

46. : Which data structure is used for implementing backtracking algorithms?
(A) Stack
(B) Queue
(C) Tree
(D) Graph

47. : What is the characteristic of a binary heap?
(A) Complete binary tree
(B) Height-balanced tree
(C) Unordered tree
(D) None of the above

Data Structures MCQs

Basic Concepts

Linear Data Structures MCQs

Non-Linear Data Structures MCQs

Hashing MCQs MCQs

Hash Tables

Sorting and Searching Algorithms MCQs

Miscellaneous

Introduction to Data Structures
By: Prof. Dr. Fazal Rehman | Last updated: May 14, 2025

Related Posts: