GATE CSE
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Questions by ABKUNDAN
User ABKUNDAN
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User ABKUNDAN
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
answer
1
Sorted List
suppose there are 4 sorted lists of n/4 elements each. if we merge these list into a single sorted list of n elements, for the n=400 number of key comparisons in the worst case using an efficient algorithm is
asked
2 days
ago
in
Algorithms

41
views
sorting
algorithms
+1
vote
1
answer
2
madeeasy workbook
if a disk system has an average seek time of 30ns and rotation rate of 360RPM. each track of the disk has 512 sectors each of size 512 Bytes. what is the time taken to read 4 successive sectors,also compute the effective data transfer rate a) 0.0843 sec , 1536 kbps b) 0.123 sec , 1436 kbps c) 0.156 sec ,1326 kbps d) 0.135 sec , 1252 kbps
asked
Aug 11
in
CO & Architecture

35
views
+1
vote
1
answer
3
IEEE floating point
in IEEE floating point representation, all the exponent bits are one and mantissa bits are non zero. this represent A) 0 B) infinity C) denormalized value D) error
asked
Aug 11
in
CO & Architecture

33
views
25,071
questions
32,223
answers
75,101
comments
30,232
users