adplus-dvertising

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 GATE CSE 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 GATE CSE Exam.

frame-decoration

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 GATE CSE 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 16

Explore more Topics under GATE CSE Exam

Q81.
Consider the situation in which the disk read/write head is currently located at track 45 (of tracks 0-255) and moving in the positive direction. Assume that the following track requests have been made in this order: 40, 67, 11, 240, 87. What is the order in which optimized C-SCAN would service these requests and what is the total seek distance?

a.

600

b.

810

c.

505

d.

550

Discuss
Answer: (c).505
Q82.
Suppose the following disk request sequence (track numbers) for a disk with 100 tracks is given: 45, 20, 90, 10, 50, 60, 80, 25, 70. Assume that the initial position of the R/W head is on track 50. The additional distance that will be traversed by the R/W head when the Shortest Seek Time First (SSTF) algorithm is used compared to the SCAN (Elevator) algorithm (assuming that SCAN algorithm moves towards 100 when it starts execution) is _________ tracks.

a.

8

b.

9

c.

10

d.

11

Discuss
Answer: (c).10
Q83.
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute (RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in milliseconds) needed to read the entire file is _________.

a.

14020

b.

14000

c.

25030

d.

15000

Discuss
Answer: (a).14020
Q84.
Consider a typical disk that rotates at 15000 rotations per minute (RPM) and has a transfer rate of 50 × 106 bytes/sec. If the average seek time of the disk is twice the average rotational delay and the controller’s transfer time is 10 times the disk transfer time, the average time (in milliseconds) to read or write a 512 byte sector of the disk is _____________.

a.

6.2

b.

6.1

c.

6.0

d.

5.9

Discuss
Answer: (b).6.1
Q85.
Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92, 10. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number 63, moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from 0 to 199. The total head movement (in number of cylinders) incurred while servicing these requests is:

a.

346

b.

165

c.

154

d.

173

Discuss
Answer: (b).165
Q86.
Which of the following DMA transfer modes and interrupt handling mechanisms will enable the highest I/O band-width?

a.

Transparent DMA and Polling interrupts

b.

Cycle-stealing and Vectored interrupts

c.

Block transfer and Vectored interrupts

d.

Block transfer and Polling interrupts

Discuss
Answer: (c).Block transfer and Vectored interrupts
Q87.
Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turn around time is:

a.

13 units

b.

14 units

c.

15 units

d.

16 units

Discuss
Answer: (a).13 units
Q88.
Consider three processes, all arriving at time zero, with total execution time of 10, 20 and 30 units, respectively. Each process spends the first 20% of execution time doing I/O, the next 70% of time doing computation, and the last 10% of time doing I/O again. The operating system uses a shortest remaining compute time first scheduling algorithm and schedules a new process either when the running process gets blocked on I/O or when the running process finishes its compute burst. Assume that all I/O operations can be overlapped as much as possible. For what percentage of time does the CPU remain idle?

a.

0%

b.

10.6%

c.

30.0%

d.

89.4%

Discuss
Answer: (b).10.6%
Q89.
Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at times 0, 2 and 6, respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end.

a.

1

b.

2

c.

3

d.

4

Discuss
Answer: (b).2
Q90.
Which of the following process scheduling algorithm may lead to starvation

a.

FIFO

b.

Round Robin

c.

Shortest Job Next

d.

None of the above

Discuss
Answer: (c).Shortest Job Next
Page 9 of 16

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!

Microprocessor

Understand the heart of your computer with our Microprocessor MCQs. Topics include...

Web Technologies

Master the building blocks of the web with our Web Technologies MCQs. From HTML and...

Neural Networks

Dive into the world of Artificial Intelligence with our Neural Networks MCQs. Uncover...

Operating System

Dive deep into the core of computers with our Operating System MCQs. Learn about...

Computer Graphics

Step into the visual side of computing with our Computer Graphics MCQs. Cover topics...

CSS

Polish your web design skills with our CSS MCQs. Learn about selectors, properties,...

Visual Basic

Enhance your knowledge of Microsoft's event-driven programming language with our...

DBMS

Get a firm grasp on database systems with our DBMS MCQs. Explore relational...

Big Data Computing

Enhance your understanding of Big Data Computing with our comprehensive MCQs. Explore...