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

Explore more Topics under UGC CBSE NET Exam

Q61.
An operating system supports a paged virtual memory, using a central processor with a cycle time of one microsecond. It costs an additional one microsecond to access a page other than the current one. Pages have 1000 words, and the paging device is a drum that rotates at 3000 revolutions per minute and transfers one million words per second. Further, one percent of all instructions executed accessed a page other than the current page. The instruction that accessed another page, 80% accessed a page already in memory and when a new page was required, the replaced page was modified 50% of the time. What is the effective access time on this system, assuming that the system is running only one process and the processor is idle during drum transfers ?

a.

30 microseconds

b.

34 microseconds

c.

60 microseconds

d.

68 microseconds

Discuss
Answer: (b).34 microseconds
Q62.
Consider the following page reference string :

1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6

Which of the following options, gives the correct number of page faults related to LRU, FIFO, and optimal page replacement algorithms respectively, assuming 05 page frames and all frames are initially empty ?

a.

10, 14, 8

b.

8, 10, 7

c.

7, 10, 8

d.

7, 10, 7

Discuss
Answer: (b).8, 10, 7
Q63.
Consider a file currently consisting of 50 blocks. Assume that the file control block and the index block is already in memory. If a block is added at the end (and the block information to be added is stored in memory), then how many disk I/O operations are required for indexed (single-level) allocation strategy ?

a.

1

b.

101

c.

27

d.

0

Discuss
Answer: (a).1
Q64.
A virtual memory has a page size of 1K words. There are eight pages and four blocks. The associative memory page table contains the following entries. Which of the following list of virtual addresses (in decimal) will not cause any page fault if referenced by the CPU?

a.

1024, 3072, 4096, 6144

b.

1234, 4012, 5000, 6200

c.

1020, 3012, 6120, 8100

d.

2021, 4050, 5112, 7100

Discuss
Answer: (c).1020, 3012, 6120, 8100
Q65.
Suppose that the number of instructions executed between page faults is directly proportional to the number of page frames allocated to a program. If the available memory is doubled, the mean interval between page faults is also doubled. Further, consider that a normal instruction takes one micro second, but if a page fault occurs, it takes 2001 micro seconds. If a program takes 60 sec to run, during which time it gets 15000 page faults, how long would it take to run if twice as much memory were available?

a.

60 sec

b.

30 sec

c.

45 sec

d.

10 sec

Discuss
Answer: (c).45 sec
Q66.
Consider a disk with 16384 bytes per track having a rotation time of 16 msec and average seek time of 40 msec. What is the time in msec to read a block of 1024 bytes from this disk?

a.

57 msec

b.

49 msec

c.

48 msec

d.

17 msec

Discuss
Answer: (b).49 msec
Q67.
A system has four processes and five allocatable resources. The current allocation and maximum needs are as follows.The smallest value of x for which the system in safe state is .............

a.

1

b.

3

c.

2

d.

None of the above

Discuss
Answer: (d).None of the above
Q68.
Match the following with respect to various memory management algorithms :

List - I                                     List - II
(a) Demand paging                 (i) degree of multiprogramming
(b) Segmentation                     (ii) working set
(c) Dynamic partitions             (iii) supports user view of memory
(d) Fixed partitions                  (iv) compaction

Codes :
      (a)  (b)   (c)  (d)

a.

(iii)  (iv)  (ii)   (i)

b.

(ii)  (iii)   (i)   (iv)

c.

(iv) (iii)  (ii)   (i)

d.

(ii)  (iii)  (iv)  (i)

Discuss
Answer: (d).(ii)  (iii)  (iv)  (i)
Q69.
Function of memory management unit is :

a.

Address translation

b.

Memory allocation

c.

Cache management

d.

All of the above

Discuss
Answer: (a).Address translation
Q70.
Consider a system with twelve magnetic tape drives and three processes P1, P2 and P3. Process P1 requires maximum ten tape drives, process P2 may need as many as four tape drives and P3 may need upto nine tape drives. Suppose that at time t1, process P1 is holding five tape drives, process P2 is holding two tape drives and process P3 is holding three tape drives. At time t1, system is in:

a.

safe state

b.

unsafe state

c.

deadlocked state

d.

starvation state

Discuss
Answer: (b).unsafe state
Page 7 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!

Software Engineering

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

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...

Web Technologies

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

Software Architecture and Design

Get a strong hold on the blueprint of software systems with our Software Architecture...

Embedded Systems

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

C# programming

Hone your skills in the C# language with our MCQs. Understand data types, operators,...

Internet of Things (IoT)

Discover how devices communicate with each other in the smart world with our IoT...

MS Office

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

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...