Back to the 2022 paper
Similar questions
Design 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 edges20222mArtificial intelligenceGraph used to represent semantic network is (i) undirected graph (ii) directed graph (iii) directed acyclic graph (DAG) (iv) directed complete graph20222mDiscrete MathematicsA graph which has the same number of edges as its complement must have number of vertices congruent to \_\_\_\_\_\_ or \_\_\_\_\_\_ modulo 4 (for integral values of number of edges). (i) 6k, 6k-1 (ii) 4k, 4k+1 (iii) k, k+2 (iv) 2k+1, k20222mSoftware EngineeringCyclomatic complexity of a connected control-flow graph with E edges, N nodes and P connected components is (i) E+N+P (ii) E-N-P (iii) N-E+2P (iv) E-N+2P20262m
PreviousWhat is the induction hypothesis assumption for the inequality m! > 2^m where m \ge 4? (i) For m=k, k+1! > 2^k holds (ii) For m=k, k! > 2^k holds (iii) For m=k, k! > 3^k holds (iv) For m=k, k! > 2^{k+1} holdsNextAn 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) 23
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.