Welcome to the Operating System MCQs Page
Dive deep into the fascinating world of Operating System with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Operating System, a crucial aspect of UGC CBSE NET Exam. In this section, you will encounter a diverse range of MCQs that cover various aspects of Operating System, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within UGC CBSE NET Exam.
Check out the MCQs below to embark on an enriching journey through Operating System. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of UGC CBSE NET Exam.
Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Operating System. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!
Operating System MCQs | Page 9 of 21
Explore more Topics under UGC CBSE NET Exam
Assume that:
Current head position is at track no. 65
Direction of last movement is towards higher numbered tracks
Current clock time is 160 milliseconds
Head movement time per track is 1 millisecond.
“look” is a variant of “SCAN” disk-arm scheduling algorithm. In this algorithm, if no more I/O requests are left in current direction, the disk head reverses its direction. The seek times in Shortest Seek First (SSF) and “look” disk-arm scheduling algorithms respectively are:
(i) P makes a request for 2 resource units.
(ii) Q makes request for 2 resources units.
(iii) R makes a request of 2 resource units.
For a safe state, which of the following options must be satisfied ?
A – B – C – D – E
Using round robin scheduling with time slice of 1 ms, the average turn around time is
5, 4, 3, 2, 1, 4, 3, 5, 4, 3, 4, 1, 4
Assuming that the execution of process is initiated after loading page 5 in memory, the number of page faults in FIFO and second chance replacement respectively are
a. RAID 0 i. Bit interleaved parity
b. RAID 1 ii. Non redundant stripping
c. RAID 2 iii. Mirrored disks
d. RAID 3 iv. Error correcting codes
Codes:
a b c d
Process A B C D
Arrival time 0 1 2 3
CPU cycle 8 4 9 5
The average turn around time of these processes will be
ABACABDBACD
Assuming that a page interrupt occurs when a new page is brought in the main memory, irrespective of whether the page is swapped out or not. The number of page interrupts in FIFO and LRU page replacement algorithms are
Suggested Topics
Are you eager to expand your knowledge beyond Operating System? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
.png)
