The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Answers by Ramij
User Ramij
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Ramij
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
multilevel paging
answered
Dec 27, 2018
in
Operating System

212
views
paging
multilevelpaging
memorymanagement
operatingsystem
pagetable
0
votes
2
GATE201330
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 23, 2018
in
Algorithms

10.4k
views
gate2013
algorithms
sorting
normal
0
votes
3
GATE201012
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

4.5k
views
gate2010
algorithms
timecomplexity
easy
52,375
questions
60,585
answers
202,002
comments
95,407
users