January 3, 2025

Algorithms

Question 40 The correct matching for the following pairs is (A) All pairs shortest path (1) Greedy (B) Quick Sort (2) Depth-First search (C) Minimum weight […]
January 3, 2025

Algorithms

Question 43 Give the correct matching for the following pairs: A. O(log n) 1. Selection sort B. O(n) 2. Insertion sort C. O(nlog n) 3. Binary […]
March 2, 2025

Time-Complexity

Question 33 Suppose T(n) = 2T (n/2) + n, T(0) = T(1) = 1 Which one of the following is FALSE? A T(n) = O(n2) B […]