Scribd
Upload
5 views

04_TreeAndGraphWithAnswers

The document contains a series of questions and answers related to trees and graphs, covering topics such as graph connectivity, subgraphs, adjacency list representation, traversal methods, and binary trees. Key concepts include the characteristics of complete graphs, types of trees, and traversal methods in binary search trees. The answers provided indicate the correct options for each question, reflecting fundamental principles in graph theory and data structures.

Uploaded by

Rishabh Jain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views

04_TreeAndGraphWithAnswers

The document contains a series of questions and answers related to trees and graphs, covering topics such as graph connectivity, subgraphs, adjacency list representation, traversal methods, and binary trees. Key concepts include the characteristics of complete graphs, types of trees, and traversal methods in binary search trees. The answers provided indicate the correct options for each question, reflecting fundamental principles in graph theory and data structures.

Uploaded by

Rishabh Jain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Tree And Graph

1.
Complete graph contains _____ no. of edges, if it
contains "V" no. of vertices.

A. (V*(V+1))/2
B. (V*(V-1))/2
C. V
D. (V-1)

Answer: B

2.
Graph is said to be connected graph, if any vertex in
it is ________ to remaining all the vertices.

A. Adjacent
B. Connected as well as Adjacent
C. Connected
D. All of the above
E. Only C

Answer: D

3.
For a given graph G contains which V no. of vertices
and E no. of edges, G1 can be reffered as a subgraph of
G only if:

A. G1 contains V no. of vertices and E no. of edges


exactly
B. G1 contains V no. of vertices and less than E no. of
edges
C. G1 contains V-1 no. of vertices and more than E no.
of edges
D. G1 contains V-1 no. of vertices and E no. of edges

Answer: B

Augest 2019 – December 2019 1


Tree And Graph

4.
Adjacency list representation of a graph can be
implemented by using

A. Linked lists of arrays


B. Array of linked lists
C. Linked list of linked lists
D. Array of array

Answer: B

5.
Which of the following traversal method can be applied
on a graph data structure?

A. Depth First Search Traversal


B. Breadth First Search Traversal
C. Preorder Traversal
D. Both A & B
E. None of the above

Answer: D

6.
If the an edges in a graph are ordered pairs of
vertices then such a graph is reffered as:

A. Ordered Graph
B. Simple Graph
C. Cyclic Graph
D. Di-graph

Answer: D

Augest 2019 – December 2019 2


Tree And Graph

7.
Which of the following statement is false about graph

A. Graph may contains zero no. of vertices and zero no.


of edges
B. Graph may contains zero no. of vertices and non-zero
no. of edges
C. Graph must contains non-zero no. of vertices and
non-zero no. of edges
D. All of the above
E. None of the above

Answer: D

8.
All the nodes which can be accessible from any node are
reffered as its _________.

A. Ancestors
B. Descendents
C. Followers
D. Siblings

Answer: B

9.
_______ is also called as Binary Heap

A. Complete Binary Tree


B. Strictly Binary Tree
C. Full Binary Tree
D. All of the above
E. None of the above

Answer: A

Augest 2019 – December 2019 3


Tree And Graph

10.
Minimum height of the Binary Search Tree for "n" input
size is:

A. n
B. log n
C. n/2
D. None of the above

Answer: B

11.
In which of the following type of tree each node must
contains exactly two no. of childs?

A. Binary Tree
B. Compulsory Binary Tree
C. Strictly Binary Tree
D. Full Binary Tree

Answer: C

12.
The best example of heirachical data structure is

A. Graph
B. Tree
C. Hash Table
D. Direct Access Table

Answer: B

Augest 2019 – December 2019 4


Tree And Graph

13.
______ traversal method always visits/prints an
elements in a binary search tree in a sorted order.

A. Inorder
B. Preorder
C. Postorder
D. Both A & B

Answer: A

14.
A threaded binary tree is a binary tree in which every
node that does not have right child has a link to its

A. Pre-order successor
B. In-order successor
C. In-order predecessor
D. Post-order successor

Answer: B

15.
In a ______ tree key value of parent node is always
greater than its childs.

A. Complete Binary Tree


B. Balanced Binary Search Tree
C. Max-Heap
D. Min-Heap
E. All of the above

Answer: C

Augest 2019 – December 2019 5

You might also like