BRAINWARE UNIVERSITY

Programme – B.Tech (CSE)

Course Name –Discrete Mathematics
Course Code –PCC-CS404

Practice Set of Module - V

1. If G is a tree with n vertices, then the number of edges of G are

a. n b. (n-1)
c. n(n+1) d. n(n-1)
2. Every vertex of a null graph is
Pendant b. Isolated
a.
c. Odd d. none of these
3. An edge whose two end vertices coincide is called
ring b. adjacent edge
a.
loop d. none of these
c.
4. A vertex whose degree 1 is called
isolated vertex b. pendant vertex
a.
even vertex d. none of these
c.
5. Choose the correct statement
every walk is a path b. every circuit is a path
a.
every loop is a circuit d. The origin and the terminus of a
c.
walk are always same

6. The degree of an isolated vertex is

a. 0 b. 1
c. 2 d. none
7. The maximum number of edges of a simple graph with 5 vertices and 2 components is

a. 2 b. 7
c. 5 d. 6
8. A complete graph must be a
circuit b. regular graph
a.
 non-simple graph d. null-graph
c.
9. If the origin and terminus of a walk coincide then it is a

path b. open walk

a.
circuit d. closed walk
c.
10. The degree of the common vertex of two edges in series is
a. 0 b. 1
c. 2 d. may be more than 2 .
11. A self-loop cannot be included in a
walk b. circuit
a.
trail d. path
c.
12. A simple graph has
no parallel edges b. no loops
a.
no parallel edges and no d. no isolated vertex
c.
loops
13. A tree is a
a. any connected graph b. minimally connected graph
c. Euler graph d. none .
14. A minimally connected graph cannot have a
a. cycle b. component
c. even vertex d. pendant vertex
15. A binary tree has exactly
a. two vertices of degree 2 b. one vertex of degree 2
c. one vertex of degree 1 d. one vertex of degree 3 .
16. Each vertex (except one ) of a binary tree has degree
a. 1 or 2 b. 2 or 3
c. 1 or 3 d. 2 or 4
17. Sum of the degrees of all vertices of a binary tree is even if the tree has
a. odd no of vertices b. even no of vertices
c. four vertices d. none of these .
18. Tree contains at least
a. one vertex b. two vertex
c. three vertex d. none of these .
19. A tree always is a
a. self complement graph b. Euler graph
c. simple graph d. Hamiltonian graph .
20. Dijkstra’s algorithm is used to
 a. find maximum flow in a b. to scan all vertices of a graph
network
c. find the shortest path from a d. none of these
specified vertex to another
21. Addition of an edge between any two vertices of a tree creates
a. Euler line b. Circuit
c. Longest path d. Regular graph
22. The minimum number of pendant vertices in a tree with five vertices is
a. 1 b. 2
c. 3 d. 4
23. A connected graph with 150 vertices and 149 edges is
a. Not a minimally connected b. Euler graph
graph
c. Binary tree d. Tree
24. Which of the following statement is true?
a. A spanning tree is a super b. A spanning tree is a subgraph of G
graph of G
c. A spanning tree may not be a d. G may not have a spanning tree
tree at all
25. Minimal spanning tree is found by
a. Dijkstra’s algorithm b. Ford-Fukerson’s algorithm
c. Floyd algorithm d. Kruskal’s algorithm
26. To make a graph (with e edges and n vertices) free from any circuit the minimum
number of edges to be removes from G in
a. e-n b. e-n+1
c. n-1 d. e-1
27. In a graph if e=[u, v], Then u and v are called
a. Endpoints of e b. Neighbors
c. Adjacent nodes d. All of above
28. A graph with no circuit and no parallel edges is called

a. Multi graph b. Pseudo graph

c. Simple graph d. None of these
29. A graph G has a spanning tree iff G is
a. regular b. connected
c. simple d. tree
30. Sum of the degree of all the vertices in a graph is always
a. even b. odd
c. prime d. none of these
31. If a graph has 6 vertices and 15 edges then the size of its adjacency matrix is
a. 6X6 b. 6X15
 c. 15X6 d. 15X15
32. Number of edges in a complete graph with n-vertices is:
n
C1 b. n C2
a.
n n
C3 d. Cn
c.
33. The root of a binary tree is the vertex having degree
a. 1 b. 2
c. 3 d. 4
34. A minimally connected graph is a
a. Binary tree b. Hamiltonian graph
c. Tree d. Regular graph

---------------------------------------