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
Questions by ABKUNDAN
3
votes
3
answers
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
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 wors...
5.7k
views
asked
Aug 21, 2017
Algorithms
sorting
algorithms
+
–
1
votes
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
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 re...
2.7k
views
asked
Aug 11, 2017
1
votes
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
in IEEE floating point representation, all the exponent bits are one and mantissa bits are non zero. this representA) 0B) infinityC) denormalized valueD) error
1.4k
views
asked
Aug 11, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register