Consider an undirected random graph of eight vertices. The probability

Back to the 2019 paper

Module 4: Graph and Tree Algorithms

20192m

Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is $1/2$ . What is the expected number of unordered cycles of length three?

(i) 1/8
(ii) 1
(iii) 8
(iv) 8

Search Google Ask AI

Similar questions

Discrete MathematicsAn undirected graph has 8 vertices labelled 1, 2, \dots, 8 and 31 edges. Vertices 1, 3, 5, 7 have degree 8 and vertices 2, 4, 6, 8 have degree 7. What is the degree of vertex 8? (i) 15 (ii) 8 (iii) 5 (iv) 2320222m Design & Analysis of AlgorithmsThe minimum number of colors needed to color a graph having n > 3 vertices and 2 edges is: - (i) 2 - (ii) 3 - (iii) 4 - (iv) 120232m Design and Analysis of Algorithms If all edge weights in a graph are positive, what is the minimum number of edges in a spanning tree for a graph with vertices? (i) V (ii) V-1 (iii) V+1 (iv) 2V20252m Design and Analysis of Algorithms The minimum number of colors needed to color a graph having n > 3 vertices and 2 edges is (i) 2 (ii) 3 (iii) 4 (iv) 120222m

PreviousTime complexity of Kadane's Algorithm is: - (i) O(n) - (ii) O(n^2) - (iii) O(n \log n) - (iv) O(n(\log n)^2)NextAny decision tree that sorts n elements has height: - (i) \Omega(\lg n) - (ii) \Omega(n) - (iii) \Omega(n \lg n) - (iv) \Omega(n^2)

Student FinanceWeb Platform

Pocketly — Personal Finance for Students

Keep your hostel and college expenses under control. Track accounts, log spending in seconds, and stay within your monthly budget.

Open Pocketly