Preparing for Excellence...
Master your MCA entrance preparation with over 17 years of solved PYQs from NIMCET, CUET PG, and top universities. Get detailed step-by-step solutions and expert insights—all 100% free.
Don't just practice questions—simulate the real exam. Browse our interactive Full Year-wise Question Papers to build your speed and accuracy.
Browse Full Papers →Jump directly into topic-wise PYQs with exam details — marks, time, and negative marking.
Match List-I with List-II
|
List-I |
List-II |
|
(A) Seek Time |
(I) Total number of bytes transferred, divided by the total time between the first request for service and the completion of the last transfer |
|
(B) Access Time |
(II) Time taken for the disk to rotate the desired sector to the disk head |
|
(C) Rotational Latency |
(III) Seek Time + Rotational Latency |
|
(D) Disk Bandwidth |
(IV) Time taken for the disk arm to move the heads to the cylinder containing the desired sector |
Choose the correct answer from the options gven below:
Which disk scheduling algorithm looks for the track closest to the current head position?
Yes. We continuously update question tags and solutions to reflect the latest pattern and syllabus.
All listed questions include detailed step-by-step solutions, and many also include short video explanations.
Use the filters for exam and subject, and the search box for topics, keywords, or formula names.
No, Mathem Solvex Offers you everything for free, you do not need to pay anything for question bank You will get NIMCET and CUET PYQ and all the information for free.