Data Structure MCQ Page-02

11.

Which of the following is not the type of queue?

A. Ordinary queue

B. Single ended queue

C. Circular queue

D. Priority queue

Answer

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

Answer

13.

State true or false.
The degree of root node is always zero.

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

Answer

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

Answer

15.
………………. 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

Answer

16.

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

Answer

17.

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

Answer

18.

…………………. 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

Answer

19.

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

Answer

20.

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

Answer

Data Structure MCQ Page-02

11.

Which of the following is not the type of queue?

Option : B

12.
The property of binary tree is

Option : D

13.

State true or false.
The degree of root node is always zero.

Nodes that are not root and not leaf are called as internal nodes

Option : B

14.

Any node is the path from the root to the node is called

Option : B

15.
………………. is not an operation performed on linear list
a) Insertion b) Deletion c) Retrieval d) Traversal

Option : D

16.

Which is/are the application(s) of stack

Option : D

17.

A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have indegree 1.

Option : A

18.

…………………. Is a directed tree in which outdegree of each node is less than or equal to two

Option : B

19.

A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.

Option : B

20.

In the …………….. traversal we process all of a vertex’s descendents before we move to an adjacent vertex.

Option : A

11. Which of the following is not the type of queue?

Option : B

12. The property of binary tree is

Option : D

13. State true or false. The degree of root node is always zero. Nodes that are not root and not leaf are called as internal nodes

Option : B

14. Any node is the path from the root to the node is called

Option : B

15. ………………. is not an operation performed on linear list a) Insertion b) Deletion c) Retrieval d) Traversal

Option : D

16. Which is/are the application(s) of stack

Option : D

17. A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have indegree 1.

Option : A

18. …………………. Is a directed tree in which outdegree of each node is less than or equal to two

Option : B

19. A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.

Option : B

20. In the …………….. traversal we process all of a vertex’s descendents before we move to an adjacent vertex.

Option : A

11.

Which of the following is not the type of queue?

12.
The property of binary tree is

13.

State true or false.
The degree of root node is always zero.

Nodes that are not root and not leaf are called as internal nodes

14.

Any node is the path from the root to the node is called

15.
………………. is not an operation performed on linear list
a) Insertion b) Deletion c) Retrieval d) Traversal

16.

Which is/are the application(s) of stack

17.

A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have indegree 1.

18.

…………………. Is a directed tree in which outdegree of each node is less than or equal to two

19.

A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.

20.

In the …………….. traversal we process all of a vertex’s descendents before we move to an adjacent vertex.