Saturday, 21 October 2017

Multiple Choice Question on Data Structure

Q. 1. 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

Q. 2. In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
A) Depth First
B) Breadth First
C) With First
D) Depth Limited

Q. 3. 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


Q. 4. State True or False.
i) An undirected graph which contains no cycles is called forest.
ii) A graph is said to be complete if there is an edge between every pair of vertices.
A) True, True
B) False, True
C) False, False
D) True, False

Q 5. A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
A) Partite
B) Bipartite
C) Rooted
D) Bisects

Q. 6. A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
A) vertices, edges
B) edges, vertices
C) vertices, paths
D) graph node, edges

Q. 7. A ……….. is a graph that has weights of costs associated with its edges.
A) Network
B) Weighted graph
C) Both A and B
D) None A and B

Q. 8. A …………… is an acyclic digraph, which has only one node with in-degree 0, and other nodes have in-degree 1.
A) Directed tree
B) Undirected tree
C) Dis-joint tree
D) Direction oriented tree

Q. 9 The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.
A) Lists
B) Linked Lists
C) Trees
D) Graph

Q. 10. The use of pointers to refer elements of a data structure in which elements are logically adjacent is ….
A. pointers
B. linked allocation
C. stack
D. queue

Q. 11. Each node in a linked list has two pairs of ………….. and ……………….
A) Link field and information field
B) Link field and avail field
C) Avail field and information field
D) Address field and link field

Q. 12. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
A) Singly Linked List
B) Circular Linked List
C) Doubly Linked List
D) Linear Linked List

Thanks
Mukesh Rajput

No comments:

Post a Comment

Thanks
Mukesh Rajput