Answers by Ramij - GATE Overflow

0 votes

1

multilevel paging

answered Dec 26, 2018 in Operating System | 160 views

0 votes

2

GATE2013-30
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is $\Theta(1)$ $\Theta(\sqrt{\log} n)$ $\Theta(\frac{\log n}{\log \log n})$ $\Theta(\log n)$

answered Oct 22, 2018 in Algorithms | 8.2k views

0 votes

3

GATE2010-12
Two alternative packages $A$ and $B$ are available for processing a database having $10^k$ records. Package $A$ requires $0.0001 n^2$ time units and package $B$ requires $10n\log_{10} n$ time units to process $n$ records. What is the smallest value of $k$ for which package $B$ will be preferred over $A$? $12$ $10$ $6$ $5$

answered Oct 21, 2018 in Algorithms | 3.6k views

50,644 questions

56,505 answers

195,555 comments

101,054 users