Data Structure Questions and Answers-Graph

 

 Buy/Download all MCQ Ebook   >>>Click Here<<<

Data Structure Questions and Answers-Graph

Click on any option to know the CORRECT ANSWERS

Question 1
Which of the following statements for a simple graph is correct?
A
Every path is a trail
B
Every trail is a path
C
Every trail is a path as well as every path is a trail
D
None of the mentioned
English grammar Questions answers

Question 1 Explanation: 
In a walk if the vertices are distinct it is called a path, whereas if the edges are distinct it is called a trail.

Question 2
In the given graph identify the cut vertices.
A
B and E
B
C and D
C
A and E
D
C and B
History Questions answers

Question 2 Explanation: 
After removing either B or C, the graph becomes disconnected.

Question 3
For the given graph(G), which of the following statements is true?
A
G is a complete graph
B
G is not a connected graph
C
The vertex connectivity of the graph is 2
D
The edge connectivity of the graph is 1
Arab culture Questions answers

Question 3 Explanation: 
: After removing vertices B and C, the graph becomes disconnected.

Question 4
What is the number of edges present in a complete graph having n vertices?
A
(n*(n+1))/2
B
(n*(n-1))/2
C
n
D
Information given is insufficient
Reading comprehension Questions answers

Question 4 Explanation: 
Number of ways in which every vertex can be connected to each other is nC2.

Question 5
The given Graph is regular.
A
True
B
False
Home science Questions answers

Question 5 Explanation: 
In a regular graph, degrees of all the vertices are equal. In the given graph the degree of every vertex is 3.

There are 5 questions to complete.

 

 Buy/Download all MCQ Ebook >>>CLICK HERE<<<