Answer sheet for Quiz - Assignment 1 Time taken 47 Min

1. A connected acyclic graph is called regular graph.

2 Marks Incorrect

false

true

2. A vertex of degree one is called a _________.

2 Marks Incorrect

tree

branch

edge

leaf

3. Trees are simple graphs and they contain at least one ___________.

2 Marks Correct

Loop

Parallel edges

Vertex

 Pendent vertex

4. The maximum level of binary tree is known as ________________ of binary tree.

2 Marks Incorrect

length

vertex

hight

branch

5. If terminal vertices are same in a walk then it is called as ____________ walk.

2 Marks Correct

closed

uniform

open

identical

6. Tree on n vertices has _______ edges.

2 Marks Correct

n-1

n-2

n+1

7. Other than pendent vertices, each vertex is _______.

2 Marks Correct

Point

branch

edge

cut vertex

8. Let T be a graph on p vertices and q edges. If T is tree then T has no circuit and q = p-1.

2 Marks Correct

true

false

9. Spanning tree with minimum weight is called longest spanning tree.

2 Marks Correct
 false

true

10. Different spanning trees in connected graph G will have same weights.

2 Marks Incorrect

true

false

11. A tree in which exactly one vertex is distinguishable form all their vertices is called ______ tree.

2 Marks Correct

spanning

rooted

shortest spanning

longest spanning

12. Which tree is special case of rooted tre?

2 Marks Correct

spanning tree

rooted tree


shortest spanning tree

binary tree

13. A tree in which exactly one vertex is of degree 2, and remaining vertices are of degree 3 or 1 is called
as_______.
2 Marks Correct

spanning tree

rooted tree

shortest spanning tree

binary rooted tree

14. There are _____ types of tree search.

2 Marks Correct

15. Every binary tree has even number of vertices.

2 Marks Correct
 false

true

16. Minimum height of binary tree with n vertices = log2 (n+1) -1

2 Marks Correct

true

false

17. _________ is an uninformed search method that aims to expand and examine all nodes of a graph or
combination of sequences by systematically searching through every solution.
2 Marks Correct

BFS

DFS

Binary search

Spanning search technique

18. BFS is typically used to traverse an entire graph.

2 Marks Correct
 false

true

19. A rooted binary tree is a tree with a root node in which every node has at most _______ children.

2 Marks Correct

20. Kruskals algorithm is an algorithm in graph theory that nds a minimum spanning tree for a connected
weighted graph.
2 Marks Correct

true

false

21. A spanning tree with weight less than or equal to the weight of every other spanning tree is called a
__________.
2 Marks Incorrect

binary tree

 weighted tree

shortest spanning tree

subgraph

22. A walk in which no edge is repeated is called a ________.

2 Marks Correct

path

cycle

walk

trial

23. If terminal vertices in a trail are same, it is called a closed trail,

2 Marks Correct

true

false

24. Loop is included in a path.

2 Marks Incorrect

false


true

25. Every ____ is trial.

2 Marks Correct

path

cycle

walk

trial

26. The walk in which no vertex is repeated more than once is called a ______.

2 Marks Correct

path

cycle

walk

trial

27. What is meant by length of path?

2 Marks Incorrect