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

Q51.
Match the following for Unix rue system:

List-I                  List-II
a. Boot block     i. Information about file system,
free block list, free inode list etc.
b. Super block ii. Contains operating system files
as well as program and data files
created by users.
c. Inode block   iii. Contains boot program and
partition table.
d. Data block    iv. Contains a table for every file in
the file system. Attributes of files
are stored here.

Codes:
     a   b  c   d
Discuss
Answer: (b).iii   i   iv  ii
Q52.
Some of the criteria for calculation of priority of a process are:

a. Processor utilization by an individual process.
b. Weight assigned to a user or group of users.
c. Processor utilization by a user or group of processes.

In fair share scheduler, priority is calculated based on:
Discuss
Answer: (c).(a), (b) and (c)
Discuss
Answer: (a).If a user level thread of a process executes a system call, all threads in that process are blocked.
Q54.
Names of some of the Operating Systems are given below:

(a) MS-DOS
(b) XENIX
(c) OS/2

In the above list, following operating systems didn’t provide multiuser facility.
Discuss
Answer: (d).None of the above is correct
Q55.
Consider a system with seven processes A through G and six resources R through W.
Resource ownership is as follows:

process A holds R and wants T
process B holds nothing but wants T
process C holds nothing but wants S
process D holds U and wants S & T
process E holds T and wants V
process F holds W and wants S
process G holds V and wants U

Is the system deadlocked ? If yes, ............. processes are deadlocked.
Discuss
Answer: (c).Yes, D, E, G
Q56.
Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page replacement algorithm is used, .............. number of page faults occur with the reference string.

0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1
Discuss
Answer: (a).11
Q57.
Consider a system having ‘m’ resources of the same type. These resources are shared by three processes P1, P2 and P3 which have peak demands of 2, 5 and 7 resources respectively. For what value of ‘m’ deadlock will not occur?
Discuss
Answer: (b).14
Q58.
Five jobs A, B, C, D and E are waiting in Ready Queue. Their expected runtimes are 9, 6, 3, 5 and x respectively. All jobs entered in Ready queue at time zero. They must run in ............. order to minimize average response time if 3 < x < 5.
Discuss
Answer: (b).C, E, D, B, A
Q59.
Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (pre-emptive scheduling) algorithm, then .............. context switches are required (suppose context switch at the beginning of Ready queue and at the end of Ready queue are not counted).

a.

3

b.

2

c.

4

d.

5

Discuss
Answer: (a).3
Q60.
Consider a system which have ‘n’ number of processes and ‘m’ number of resource types. The time complexity of the safety algorithm, which checks whether a system is in safe state or not, is of the order of:
Discuss
Answer: (d).O(mn^2)
Page 6 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!