Back to the 2019 paper
Similar questions
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) 120232mDesign 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) 120222mDesign 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) 2V20252mDiscrete MathematicsThe number of edges in a regular graph of degree 46 and 8 vertices is (i) 347 (ii) 230 (iii) 184 (iv) 18620222m
Previous(h) The total number of subgroups of group G of prime order is (i) 1 (ii) 2 (iii) 3 (iv) 4NextUsing truth table, show that- (i) ((p → (q → r)) → ((p → q) → (p → r))) is a tautology; (ii) ¬(q → r) ∧ r ∧ (p → q) is a contradiction.
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.