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 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.

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 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 19 of 21

Explore more Topics under UGC CBSE NET Exam

Q181.
Consider the following set of processes and the length of CPU burst time given in milliseconds:

Assume that processes being scheduled with Round-Robin Scheduling Algorithm with time quantum 4 ms. The the waiting time for P4 is .............. ms.

a.

0

b.

4

c.

12

d.

6

Discuss
Answer: (c).12
Q182.
Suppose P, Q and R are co-operating processes satisfying Mutual Exclusion condition. Then, if the process Q is executing in its critical section then

a.

Both ‘P’ and ‘R’ execute in critical section

b.

Neither ‘P’ nor ‘R’ executes in their critical section

c.

‘P’ executes in critical section

d.

‘R’ executes in critical section

Discuss
Answer: (b).Neither ‘P’ nor ‘R’ executes in their critical section
Q183.
A process residing in Main Memory and Ready and Waiting for execution, is kept on

a.

Execution Queue

b.

Job Queue

c.

Ready Queue

d.

Wait Queue

Discuss
Answer: (c).Ready Queue
Q184.
At a particular time of computation, the value of a counting semaphore is 10. Then 12 P operations and “x” V operations were performed on this semaphore. If the final value of semaphore is 7, x will be:

a.

8

b.

9

c.

10

d.

11

Discuss
Answer: (b).9
Q185.
In a multi-user operating system, 30 requests are made to use a particular resource per hour, on an average. The probability that no requests are made in 40 minutes, when arrival pattern is a poisson distribution, is ...............

a.

e^−15

b.

1−e^−15

c.

1−e^−20

d.

e^−20

Discuss
Answer: (d).e^−20
Q186.
Normally user programs are prevented from handling I/O directly by I/O instructions in them. For CPUs having explicit I/O instructions, such I/O protection is ensured by having the I/O instructions privileged. In a CPU with memory mapped I/O, there is no explicit I/O instruction. Which one of the following is true for a CPU with memory mapped I/O?

a.

I/O protection is ensured by operating system routines.

b.

I/O protection is ensured by a hardware trap.

c.

I/O protection is ensured during system configuration.

d.

I/O protection is not possible.

Discuss
Answer: (a). I/O protection is ensured by operating system routines.
Q187.
Which of the following statements are true?

(a) External Fragmentation exists when there is enough total memory space to satisfy a request but the available space is contiguous.
(b) Memory Fragmentation can be internal as well as external.
(c) One solution to external Fragmentation is compaction.

a.

(a) and (b) only

b.

(a) and (c) only

c.

(b) and (c) only

d.

(a), (b) and (c)

Discuss
Answer: (c).(b) and (c) only
Q188.
Page information in memory is also called as Page Table. The essential contents in each entry of a page table is/are ....................

a.

Page Access information

b.

Virtual Page number

c.

Page Frame number

d.

Both virtual page number and Page Frame Number

Discuss
Answer: (c).Page Frame number
Q189.
Consider a virtual page reference string 1, 2, 3, 2, 4, 2, 5, 2, 3, 4. Suppose LRU page replacement algorithm is implemented with 3 page frames in main memory. Then the number of page faults are .................

a.

5

b.

7

c.

9

d.

10

Discuss
Answer: (b).2
Q190.
Consider the following three processes with the arrival time and CPU burst time given in milliseconds. The Gantt Chart for preemptive SJF scheduling algorithm is ...............

a.

1

b.

2

c.

3

d.

4

Discuss
Answer: (b).2
Page 19 of 21

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!

Embedded Systems

Dive into the world of specialized computing systems with our Embedded Systems MCQs....

Software Engineering

Learn about the systematic approach to developing software with our Software...

SQL Server

Master Microsoft's database server with our SQL Server MCQs. Topics cover database...

Computer Graphics

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

Compiler Design

Unravel the process of translating source code into executable programs with our...

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

DBMS

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

Cyber Security

Understand the fundamentals of safeguarding digital assets with our Cyber Security...

UNIX

Become proficient with the Unix operating system using our UNIX MCQs. Learn about...