Back to the 2023 paper
Similar questions
Database Management SystemFor the following set of key values construct a B+ tree with a degree 4: 5, 10, 15, 29, 35, 46, 58, 63, 67, 89 Initially tree is empty. Values must be added in ascending order. Show the step-by-step construction.201910mArtificial intelligenceExplain Breadth First Search and Depth First Search with examples.20257mDatabase 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 children20252mDesign & Analysis of AlgorithmsAny decision tree that sorts n elements has height: - (i) \Omega(\lg n) - (ii) \Omega(n) - (iii) \Omega(n \lg n) - (iv) \Omega(n^2)20192m
PreviousThe minimum number of colors needed to color a graph having n > 3 vertices and 2 edges is: - (i) 2 - (ii) 3 - (iii) 4 - (iv) 1NextAn algorithm is made up of two independent time complexities f(n) and g(n). Then the complexity of the algorithm is in order of: - (i) f(n) \times g(n) - (ii) \max(f(n), g(n)) - (iii) \min(f(n), g(n)) - (iv) f(n) + g(n)
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.