Multiple Choice Questions of 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
Answers: 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
Answers: A) AVL tree
3. ……………….. level is where the model becomes compatible executable code
A) Abstract level
B) Application level
C) Implementation level
D) All of the above
Answers: C) Implementation level
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
Answers: A) Last 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
Answers: C) True, True
6. …………… is not the component of data structure.
A) Operations
B) Storage Structures
C) Algorithms
D) None of above
Answers: D) None of 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
Answers: D) None of 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
Answers: A) push, pop
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
Answers: B) Queue
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
Answers: A) Stack
11. Which of the following is not the type of queue?
A) Ordinary queue
B) Single ended queue
C) Circular queue
D) Priority queue
Answers: B) Single ended queue
12. The property of binary tree is
A) The first subset is called left subtree
B) The second subtree is called right subtree
C) The root cannot contain NULL
D) The right subtree can be empty
Answers: D) The right subtree can be empty
13. State true or false.
i) The degree of root node is always zero.
ii) Nodes that are not root and not leaf are called as internal nodes.
A) True, True
B) True, False
C) False, True
D) False, False
Answers: C) False, True
14. Any node is the path from the root to the node is called
A) Successor node
B) Ancestor node
C) Internal node
D) None of the above
Answers: B) Ancestor node
15. State true of false.
i) A node is a parent if it has successor nodes.
ii) A node is child node if out degree is one.
A) True, True
B) True, False
C) False, True
D) False, False
Answers: B) True, False
16. ………………. is not an operation performed on linear list
a) Insertion b) Deletion c) Retrieval d) Traversal
A) only a,b and c
B) only a and b
C) All of the above
D) None of the above
Answers: D) None of the above
17. Which is/are the application(s) of stack
A) Function calls
B) Large number Arithmetic
C) Evaluation of arithmetic expressions
D) All of the above
Answers: D) All of the above
18. A …………… is an acyclic digraph, which has only one node with indegree 0,
and other nodes have
indegree 1.
A) Directed tree
B) Undirected tree
C) Dis-joint tree
D) Direction oriented tree
Answers: A) Directed tree
19. …………………. Is a directed tree in which outdegree of each node is less than
or equal to two.
A) Unary tree
B) Binary tree
C) Dinary tree
D) Both B and C
Answers: B) Binary tree
20. State true or false.
i) An empty tree is also a binary tree.
ii) In strictly binary tree, the outdegree of every node is either o or 2.
A) True, False
B) False, True
C) True, True
D) False, False
Answers: C) True, True
21. A directed graph is ………………. if there is a path from each vertex to every
other vertex in the
digraph.
A) Weakly connected
B) Strongly Connected
C) Tightly Connected
D) Linearly Connected
Answers: B) Strongly Connected
22. In the …………….. traversal we process all of a vertex’s descendents before
we move to an adjacent
vertex.
A) Depth First
B) Breadth First
C) With First
D) Depth Limited
Answers: A) Depth First
23. State True of False.
i) Network is a graph that has weights or costs associated with it.
ii) An undirected graph which contains no cycles is called a forest.
iii) A graph is said to be complete if there is no edge between every pair
of vertices.
A) True, False, True
B) True, True, False
C) True, True, True
D) False, True, True
Answers: B) True, True, False
24. Match the following.
a) Completeness i) How long does it take to find a solution
b) Time Complexity ii) How much memory need to perform the search.
c) Space Complexity iii) Is the strategy guaranteed to find the solution
when there in one.
A) a-iii, b-ii, c-i
B) a-i, b-ii, c-iii
C) a-iii, b-i, c-ii
D) a-i, b-iii, c-ii
Answers: C) a-iii, b-i, c-ii
25. The number of comparisons done by sequential search is ………………
A) (N/2)+1
B) (N+1)/2
C) (N-1)/2
D) (N+2)/2
Answers: B) (N+1)/2
View more...................................
