Back to the 2025 paper
Similar questions
Design & Analysis of AlgorithmsThe choice of polynomial class has led to the development of an extensive theory called: - (i) computational complexity - (ii) time complexity - (iii) problem complexity - (iv) decision complexity20222mDesign and Analysis of Algorithms Define P-Class, NP-class, NP-complete class and NP-hard class of problems. What is the relation between them?20227mDesign & Analysis of AlgorithmsHamiltonian path problem is ______? - (i) NP Problem - (ii) NP Complete - (iii) P Class Problem - (iv) N Class Problem20242mDesign & Analysis of AlgorithmsDefine the classes P and NP.20232m
PreviousIf 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) 2VNextWhat is the approximation ratio (or performance ratio) of the greedy algorithm for the Vertex Cover problem? (i) 2 (ii) 1.5 (iii) ln n (iv) 1