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

Explore more Topics under UGC CBSE NET Exam

Q11.
Consider n processes sharing the CPU in round robin fashion. Assuming that each process switch takes s seconds. What must be the quantum size q such that the overhead resulting from process switching is minimized but, at the same time each process is guaranteed to get its turn at the CPU at least every t seconds ? 

a.

q ≤ (t – ns)/ (n – 1)

b.

q≥(t−ns)/(n−1)

c.

q ≤ (t - ns)/ (n + 1)

d.

q ≥ (t - ns)/(n + 1)

Discuss
Answer: (b).q≥(t−ns)/(n−1)
Q12.
The virtual address generated by a CPU is 32 bits. The Translation Look-aside Buffer (TLB) can hold total 64 page table entries and  4-way set associative (i.e.with4-cache lines in the set). The page Sill' is 4 KB. The minimum size of TLB tag is

a.

12 bits

b.

15 bits

c.

16 bits

d.

20 bits

Discuss
Answer: (c).16 bits
Q13.
Consider a disk queue with request for input/output to block on cylinders

98,183,37,122,14, 124, 65, 67 in that order

Assume that disk head is  initially positioned at cylinder 53  and moving towards cylinder number 0. The total number of head movements using Shortest Seek lime First (SSTF) and SCAN algorithms are respectively

a.

236 and 252 cylinders

b.

640 and 236 cylinders

c.

235 and 640 cylinder

d.

235 and 252 cylinders

Discuss
Answer: (a).236 and 252 cylinders
Q14.
How much space will be required to store the bit map of a 1.3 GB disk with 512 bytes block size

a.

332.8 KB

b.

836 KB

c.

266.2 KB

d.

256.6 KB

Discuss
Answer: (a).332.8 KB
Q15.
Translation Look-aside Buffer (TLB) is

a.

a cache-memory in which item to be searched is compared on.e-by-one with the keys

b.

a cache-memory in which item to be searched is compared with all the keys simultaneously

c.

an associative memory in which item to be searched is compared one-by-one with the keys

d.

an associative memory in which item to be searched is compared with all the keys simultaneously

Discuss
Answer: (d).an associative memory in which item to be searched is compared with all the keys simultaneously
Q16.
Simplest way of deadlock recovery is

a.

Roll Back

b.

Preempt resource

c.

Lock one of the processes

d.

Kill one of the processes

Discuss
Answer: (a).Roll Back
Q17.
Possible thread states in Windows 2000 operating system include

a.

Ready, running and waiting

b.

Ready, standby, Running,waiting, transition ,terminated

c.

Ready, running, . waiting, transition and terminated

d.

Standby,  running, transition and terminated

Discuss
Answer: (b).Ready, standby, Running,waiting, transition ,terminated
Q18.
Which of the following conditions does not hold good for a solution to a critical section problem?

a.

No assumptions may be made about speeds or the number of CPUs.

b.

No two processes may be simultaneously inside their critical sections.

c.

Processes running outside its critical section may block other processes.

d.

Processes do not wait forever to enter its critical section.

Discuss
Answer: (a).No assumptions may be made about speeds or the number of CPUs.
Q19.
In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. If an empty frame is available or if the replaced page is not modified, and it takes 20 m.sec., if the replaced page is modified. What is the average access time to service a page fault assuming that the page to be replaced is modified 70% of the time?

a.

11.6 m.sec

b.

16.4 m.sec

c.

28 m.sec

d.

14 m.sec

Discuss
Answer: (a).11.6 m.sec
Q20.
The directory can be viewed as _______ that translates filenames into their directory entries.

a.

Symbol table

b.

Partition

c.

Swap space

d.

Cached

Discuss
Answer: (a).Symbol table
Page 2 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!

MongoDB

Learn the leading NoSQL database with our MongoDB MCQs. Understand everything from...

UNIX

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

DBMS

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

Web Technologies

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

R Programming

Unleash the power of statistical computing with our R Programming MCQs. Topics cover...

CSS

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

Computer Graphics

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

Python

Dive into one of the most popular languages with our Python MCQs. Understand...

MS Office

Master the suite of productivity tools with our MS Office MCQs. From Word and Excel...