Download PDF
Free download pdf of Data Structures multiple choice questions(MCQs) & answers and DS Algorithms quiz objective questions with answers for papers of graduate and post-graduate examinations in Computer Science & Engineering Branch.
(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
Comment
(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
Comment
(3)
Which of the following is not the type of queue?
[A]
Priority queue
[B]
Circular queue
[C]
Single ended queue
[D]
Ordinary queue
Comment
(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
Comment
(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
Comment
(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
Comment
(7)
To represent hierarchical relationship between elements, Which data structure is suitable?
[A]
Graph
[B]
Tree
[C]
Dequeue
[D]
Priority
Comment
(8)
Which of the following data structure is linear type?
[A]
Stack
[B]
Graph
[C]
Trees
[D]
Binary tree
Comment
(9)
Herder node is used as sentinel in ........
[A]
Queues
[B]
Stacks
[C]
Graphs
[D]
Binary tree
Comment
(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
Comment
Please share this page