Back to the 2023 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) 120232mDiscrete MathematicsA graph which consists of disjoint union of trees is called (i) bipartite graph (ii) forest (iii) caterpillar tree (iv) labelled tree20222mDesign 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 An adjacency matrix representation of a graph cannot contain information of (i) nodes (ii) edges (iii) direction of edges (iv) parallel edges20222m
PreviousWhich of the following standard algorithms is not a greedy algorithm? - (i) Dijkstra's shortest path algorithm - (ii) Kruskal algorithm - (iii) Bellman ford shortest path algorithm - (iv) Prim's algorithmNextDiscuss the average, worst, and best time complexity of the algorithm. Give suitable examples.
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.