Back to the 2022 paper
Similar questions
Design & Analysis of AlgorithmsThe node removal of which makes a graph disconnected is called: - (i) Pendant vertex - (ii) Bridge - (iii) Articulation point - (iv) Coloured vertex20232mDatabase Management SystemFor a B-tree of order m, every non-root internal node must have at least: (i) m/2 children (ii) [m/2] children (iii) [m/2]-1 children (iv) m-1 children20252mFormal Language & Automata Theory___________ is the acyclic graphical representation of a grammar (i) Binary tree (ii) Octtree (iii) Parse tree (iv) None of the above20222mFORMAL LANGUAGE & AUTOMATA THEORY____ is the acyclic graphical representation of a grammar. (i) Binary tree (ii) Octtree (iii) Parse tree (iv) None of the above20212m
PreviousA 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, kNextWhich of the following two sets are equal? (i) A = \{1, 2\} and B = \{1\} (ii) A = \{1, 2\} and B = \{1, 2, 3\} (iii) A = \{1, 2, 3\} and B = \{2, 1, 3\} (iv) A = \{1, 2, 4\} and B = \{1, 2, 3\}