Data Structures MCQs | Algorithms MCQs - Quiz Objective Questions Answers

  3. multiple choice questions and answers
Questions
1 Stack is also called as
A First in first out
B First in last out
C Last in last out
D Last in first out

Answer: Option [D]
2 Any node is the path from the root to the node is called
A Ancestor node
B Successor node
C Internal node
D None of the above

Answer: Option [A]
3 Which of the following is not the type of queue?
A Priority queue
B Circular queue
C Single ended queue
D Ordinary queue

Answer: Option [C]
4 A graph is a collection of nodes, called ...... And line segments called arcs or ...... that connect pair of nodes.
A vertices, paths
B vertices, edges
C graph node, edges
D edges, vertices

Answer: Option [B]
5 In ........, search start at the beginning of the list and check every element in the list.
A Binary search
B Hash Search
C Linear search
D Binary Tree search

Answer: Option [C]
6 In the ....... traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
A Depth Limited
B With First
C Breadth First
D Depth First

Answer: Option [D]
7 To represent hierarchical relationship between elements, Which data structure is suitable?
A Graph
B Tree
C Dequeue
D Priority

Answer: Option [B]
8 Which of the following data structure is linear type?
A Stack
B Graph
C Trees
D Binary tree

Answer: Option [A]
9 Herder node is used as sentinel in ........
A Queues
B Stacks
C Graphs
D Binary tree

Answer: Option [D]
10 Which of the following data structure can’t store the nonhomogeneous data elements?
A Arrays
B Stacks
C Records
D None of the above

Answer: Option [A]

APSC CCE Prelims EBooks

Useful Computer Science EBooks