MCQGeeks
0 : 0 : 1
CBSE
JEE
NTSE
NEET
English
UK Quiz
Quiz
Driving Test
Practice
Games
Quiz
Discrete Mathematics
Discrete Mathematics Objective
Quiz 1
1
2
3
4
5
6
7
8
9
10
Q.1
Which algorithm efficiently calculates the single source shortest paths in a Directed Acyclic Graph?
a) topological sort
b) hash table
c) binary search
d) radix sort
Q.2
The _______ of a graph G consists of all vertices and edges of G.
a) edge graph
b) line graph
c) path complement graph
d) eulerian circuit
Q.3
A ______ in a graph G is a circuit which consists of every vertex (except first/last vertex) of G exactly once.
a) Euler path
b) Hamiltonian path
c) Planar graph
d) Path complement graph
Q.4
A walk has Closed property if ____________
a) v0=vk
b) v0>=vk
c) v < 0
d) vk > 1
Q.5
A trail in a graph can be described as ______________
a) a walk without repeated edges
b) a cycle with repeated edges
c) a walk with repeated edges
d) a line graph with one or more vertices
Q.6
Let a graph can be denoted as ncfkedn a kind of ____________
a) cycle graph
b) line graph
c) hamiltonian graph
d) path graph
Q.7
Determine the edge count of a path complement graph withvertices.
a) 502
b) 345
c) 78
d) 69
Q.8
The sum of an n-node graph and its complement graph produces a graph called _______
a) complete graph
b) bipartite graph
c) star graph
d) path-complement graph
Q.9
In a directed weighted graph, if the weight of every edge is decreased byunits, does any change occur to the shortest path in the modified graph?
a) 209
b) 65
c) 57
d) 43
Q.10
Let G(V, E) be a directed graph where every edge has weight as either2 orwhat is the algorithm used for the shortest path from a given source vertex to a given destination vertex to get the time complexity of O(V+E)?
a) BFS
b) DFS
c) Binary search
d) Radix sort
0 h : 0 m : 1 s
1
2
3
4
5
6
7
8
9
10
Report Question
×
What's an issue?
Question is wrong
Answer is wrong
Other Reason
Want to elaborate a bit more? (optional)