Graphs
Quiz-summary
0 of 31 questions completed
Questions:
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
Information
- You will be given 180 seconds ( 3 minutes) for every question.
- Every question may contain multiple answers.Once you click the submit button you can not change your answer. You cannot go back to the same question once you click the submit button.
- Every question carries the marks equal to its difficulty level ( from 1 to 5).
- There is a negative marking of -1 for every wrong answer.
- Once a set of questions is complete, you can wait for another set of questions or you can try some other category.
- Your total marks will be displayed after every question.
- For any doubts/comments/suggestions on the question you can go to same question in untimed section.
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading...
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
Results
0 of 31 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 points, (0)
Categories
- Graphs 0%
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- Answered
- Review
-
Question 1 of 31
1. Question
5 pointsWhich out of the following properly defines chromatic number of a graph.
Correct
Incorrect
-
Question 2 of 31
2. Question
5 points
The given graphs have a maximal clique of size
Correct
Incorrect
-
Question 3 of 31
3. Question
5 points
Minimum edge cover of the Graph is
Correct
Incorrect
-
Question 4 of 31
4. Question
5 pointsWhen Does a Graph has a Eulerian Path
Correct
Incorrect
-
Question 5 of 31
5. Question
5 points
Does the given Graph has a Eulerian Path
Correct
Incorrect
-
Question 6 of 31
6. Question
5 points
Does the given graph has a Hamiltonian Cycle
Correct
Incorrect
-
Question 7 of 31
7. Question
5 points
Maximum Independent Set of the given Graph is
Correct
Incorrect
-
Question 8 of 31
8. Question
5 points
Minimum Vertex Cover of the given graph is
Correct
Incorrect
-
Question 9 of 31
9. Question
5 pointsLet P be a shortest path from some vertex s to some other vertex t in a graph. If the weight of each edge in the graph is increased by one, P will still be a shortest path from s to t.
Correct
Incorrect
-
Question 10 of 31
10. Question
5 pointsConsider a simple connected graph G with n vertices and n edges (n=2). Then which of the following statements are true?
Correct
Incorrect
-
Question 11 of 31
11. Question
5 pointsWhat is true about directed Graphs
Correct
Incorrect
-
Question 12 of 31
12. Question
5 pointsWhat is true about undirected graphs
Correct
Incorrect
-
Question 13 of 31
13. Question
5 pointsA graph is called a regular graph
Correct
Incorrect
-
Question 14 of 31
14. Question
5 points
Node X in the given graph has Degree
Correct
Incorrect
-
Question 15 of 31
15. Question
5 pointsWhich of the following are the applications of Graphs
Correct
Incorrect
-
Question 16 of 31
16. Question
5 points
In the given graph which edge is self loop
Correct
Incorrect
-
Question 17 of 31
17. Question
5 points
Which of the following is not a simple path in context of the given graph
Correct
Incorrect
-
Question 18 of 31
18. Question
5 points
Which of the following is not a simple cycle
Correct
Incorrect
-
Question 19 of 31
19. Question
5 pointsA Graph consisting of Subset of edges and subset of vertices of another graph is a sub graph of that graph
Correct
Incorrect
-
Question 20 of 31
20. Question
5 pointsif m=no. of edges n= no. of vertices of a graph then for the graph to be a tree
Correct
Incorrect
-
Question 21 of 31
21. Question
5 pointsif m=no. of edges and n= no. of vertices of a graph
then for the graph to be a connectedCorrect
Incorrect
-
Question 22 of 31
22. Question
5 pointsIf V is the number of vertices and E is the number of edges in the Graph, In the incidence matrix of the graph the size of the matrix is
Correct
Incorrect
-
Question 23 of 31
23. Question
5 pointsIf V is the number of vertices and E is the number of edges in the Graph, In the adjacency matrix of the graph the size of the matrix is
Correct
Incorrect
-
Question 24 of 31
24. Question
5 pointsA Graph can be represented by one of the following data structures
Correct
Incorrect
-
Question 25 of 31
25. Question
5 points
The given graph is a
Correct
Incorrect
-
Question 26 of 31
26. Question
5 pointsIn a Complete Graph of size n the number of edges are
Correct
Incorrect
-
Question 27 of 31
27. Question
5 points
The Given Graph is
Correct
Incorrect
-
Question 28 of 31
28. Question
5 pointsWhich of the following defines multi Graph
Correct
Incorrect
-
Question 29 of 31
29. Question
5 pointsif v is the number of vertices, e is the number of edges and f is the number of faces (regions bounded by edges, including the outer region) of a planar graph then as per the Euler’s Formula
Correct
Incorrect
-
Question 30 of 31
30. Question
5 points
The Given Graph is
Correct
Incorrect
-
Question 31 of 31
31. Question
5 points
The Given Graph is an example of
Correct
Incorrect