October 8, 2023
Question 601 Consider the graph below: How many spanning trees can be found? A 10 B 5 C 9 D 8 AlgorithmsMinimum-Spanning-TreeNTA UGC NET DEC-2022 Paper-2Video-Explanation […]
October 10, 2023
Question 183 The smallest element that can be found in time___ in a binary max heap A O(nlogn) B O(logn) C O(n) D O(n2) AlgorithmsBinary-HeapNielit Scentist-B […]
October 10, 2023
Question 14 ___ is the worst case time complexity for all operations(i.e. Search,update and delete) in a general binary search tree A O(n) B O(nlogn) C […]
October 11, 2023
Question 236 Which of the following greedy strategies gives the optimal solution for the following 0-1 knapsack problem? w=30, w1=10, p1=11, w2=15, p2=12, w3=20, p3=24, w4=25, […]