Solved MCQ on Data Structure Set-1

This set of multiple-choice questions includes solved MCQ on Data Structure about different levels of implementation of data structure, tree, and binary search tree. It also includes objective questions on the definition of stack and queue,  characteristics of abstract data types, components of data structure, linear and non-linear data structure.

1. Which if the following is/are the levels of implementation of data structure
A) Abstract level
B) Application level
C) Implementation level
D) All of the above

2. A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called ……
A) AVL tree
B) Red-black tree
C) Lemma tree
D) None of the above

3. ……………….. level is where the model becomes compatible executable code
A) Abstract level
B) Application level
C) Implementation level
D) All of the above

4. Stack is also called as
A) Last in first out
B) First in last out
C) Last in last out
D) First in first out

5. Which of the following is true about the characteristics of abstract data types?
i) It exports a type.
ii) It exports a set of operations
A) True, False
B) False, True
C) True, True
D) False, False

6. …………… is not the component of the data structure.
A) Operations
B) Storage Structures
C) Algorithms
D) None of the above

7. Which of the following is not the part of ADT description?
A) Data
B) Operations
C) Both of the above
D) None of the above

8. Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.
A) push, pop
B) pop, push
C) insert, delete
D) delete, insert

9. ……………. Is a pile in which items are added at one end and removed from the other.
A) Stack
B) Queue
C) List
D) None of the above

10. ………… is very useful in situation when data have to stored and then retrieved in reverse order.
A) Stack
B) Queue
C) List
D) Link list

11. Which data structure allows deleting data elements from and inserting at rear?
A) Stacks
B) Queues
C) Dequeues
D) Binary search tree

12. Which of the following data structure can’t store the non-homogeneous data elements?
A) Arrays
B) Records
C) Pointers
D) Stacks

13. A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
A) Queue linked list
B) Stacks linked list
C) Both of them
D) Neither of them

14. Which of the following is non-liner data structure?
A) Stacks
B) List
C) Strings
D) Trees

15. Herder node is used as sentinel in …..
A) Graphs
B) Stacks
C) Binary tree
D) Queues

16. Which data structure is used in breadth first search of a graph to hold nodes?
A) Stack
B) queue
C) Tree
D) Array

17. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
A) Input restricted dequeue
B) Output restricted qequeue
C) Priority queues
D) Stack

18. Which of the following data structure is non linear type?
A) Strings
B) Lists
C) Stacks
D) Graph

19. Which of the following data structure is linear type?
A) Graph
B) Trees
C) Binary tree
D) Stack

20. To represent hierarchical relationship between elements, Which data structure is suitable?
A) Dequeue
B) Priority
C) Tree
D) Graph

Answers:

1. D) All of the above
2. A) AVL tree
3. C) Implementation level
4. A) Last in first out
5. C) True, True
6. D) None of the above
7. D) None of the above
8. A) push, pop
9. B) Queue
10. A) Stack
11. B) Queues
12. A) Arrays
13. A) Queue linked list
14. D) Trees
15. C) Binary tree
16. B) queue
17. A) Input restricted dequeue
18. D) Graph
19. D) Stack
20. C) Tree

Read Next: Solved MCQ of Data Structure Set – 2
Read More: Data Structure MCQ Questions
Download: Pdf E-Book Of Data Structure MCQ Questions