October 26, 2023
Question 16 (a) Consider the following algorithm. Assume procedure A and procedure B take O(1) and O(1/n) unit of time respectively. Derive the time complexity of […]
October 26, 2023
Question 52 An undirected graph G(V, E) contains n (n > 2) nodes named v1, v2, ….vn. Two nodes vi , vj are connected if and […]
October 26, 2023
Question 1 Eight-queens problem can be solved by A Brute Force Method B Backtracking C Breadth-First Search D All the above AlgorithmsBack-TrackingAPPSC-2012-DL-CS Question 1 Explanation: Eight-queens […]
October 26, 2023
Question 96 The number of swappings needed to sort the numbers 8, 22, 7, 9, 31, 5, 13 in ascending order, using bubble sort is A […]