November 25, 2023

Data-Structures

Question 22 The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is A T(n) = 2T(n – 2) […]
Do you like it?
0 Read more
November 25, 2023

Operating-Systems

Question 25 Consider the following five disk access requests of the form (request id, cylinder number) that are present in the disk scheduler queue at a […]
Do you like it?
0 Read more
November 26, 2023

Question 4992 – Algorithms

​The solution of recurrence relation : T(n)=2T(sqrt(n))+lg(n) is Correct Answer: D Question 286 Explanation:  T (n) = l og log (n) · l og (n) T […]
Do you like it?
0 Read more
November 26, 2023

UGC NET CS 2013 Sep-paper-2

Question 10 Suppose that the splits at every level of Quicksort are in proportion 1-β to β, where 0 < β ≤ 0.5 is a constant. […]
Do you like it?
0 Read more
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219