Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Ramij
0
votes
1
multilevel paging
731
views
answered
Dec 26, 2018
Operating System
paging
multilevel-paging
memory-management
operating-system
+
–
0
votes
2
GATE CSE 2013 | Question: 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)$
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)...
28.2k
views
answered
Oct 22, 2018
Algorithms
gatecse-2013
algorithms
sorting
normal
heap-sort
+
–
0
votes
3
GATE CSE 2010 | Question: 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$
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 ...
12.8k
views
answered
Oct 20, 2018
Algorithms
gatecse-2010
algorithms
time-complexity
easy
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register