Back to the 2023 paper
Similar questions
Design and Analysis of Algorithms Write a short note on: Recursion tree method20257mDesign and Analysis of Algorithms A graph with five nodes is represented using the adjacency list as follows: | | | | | | |---|---|---|---|---| | A | -> | B (10) | C (3) | | | B | -> | C (1) | D (5) | | | C | -> | B (4) | D (8) | E (2) | | D | -> | E (7) | | | | E | -> | D (9) | | | Answer the following: (i) Draw the graph for the above adjacency list. (ii) Write the algorithm for the Breadth-First Traversal (BFS). (iii) Show the BFS traversal of the graph with the starting node as A.20247mDatabase 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 children20252mArtificial intelligenceExplain Breadth First Search and Depth First Search with examples.20257m
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)