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

Q71.
In an operating system, indivisibility of operation means :
Discuss
Answer: (c).Processor can not be pre-empted
Q72.
The character set used in Windows 2000 operating system is ...............
Discuss
Answer: (c).16 bit UNICODE
Discuss
Answer: (c).Tightly coupled software on loosely coupled hardware and message passing, respectively
Q74.
In a paged memory management algorithm, the hit ratio is 70%. If it takes 30 nanoseconds to search Translation Look-aside Buffer (TLB) and 100 nanoseconds (ns) to access memory, the effective memory access time is
Discuss
Answer: (d).160 ns
Q75.
Match the following:

List-I                                                               List-II
a. Multilevel feedback queue           i. Time-slicing
b. FCFS                                                 ii. Criteria to move processes between queues
c. Shortest process next                   iii. Batch processing
d. Round Robin Scheduling             iv. Exponential Smoothening

Codes:
      a    b    c    d
Discuss
Answer: (d).ii    iii   iv    i
Q76.
Consider a system with five processes P0 through P4 and three resource types R1, R2 and R3. Resource type R1 has 10 instances, R2 has 5 instances and R3 has 7 instances. Suppose that at time T0, the following snapshot of the system has been taken :

Allocation R1 R2 R3 P0 0 1 0 P1 2 0 0 P2 3 0 2 P3 2 1 1 P4 0 2 2
Max R1 R2 R3 7 5 3 3 2 2 9 0 2 2 2 2 4 3 3
Available R1 R2 R3 3 3 2

Assume that now the process P1 requests one additional instance of type R1 and two instances of resource type R3. The state resulting after this allocation will be
Discuss
Answer: (b).Safe State
Q77.
Match the following:

List-I                                                      List-II
a. Contiguous Allocation       i. This scheme supports very large file sizes.
b. Linked allocation                 ii. This allocation technique supports only sequential files.
c. Indexed allocation               iii. Number of disks required to access file is minimal.
d. Multi-level indexed                         iv. This technique suffers from maximum wastage of space in storing pointers

Codes:
      a    b    c    d
Discuss
Answer: (b).iii    ii    iv    i
Q78.
Which of the following is the correct value returned to the operating system upon the successful completion of a program?
Discuss
Answer: (a).0
Q79.
Match the following:

List – I                                                   List - II
Process state transition                   Reason for transition
a. Ready→Running                           i. Request made by the process
is satisfied or an event for which
it was waiting occurs.
b. Blocked→Ready                             ii. Process wishes to wait for
some action by another process.
c. Running→Blocked                         iii. The process is dispatched.
d Running→Ready                            iv. The process is preempted.

Codes :
      a   b   c    d
Discuss
Answer: (a).iii   i    ii    iv
Q80.
The hit ratio of a Translation Look Aside Buffer (TLAB) is 80%. It takes 20 nanoseconds (ns) to search TLAB and 100 ns to access main memory. The effective memory access time is ................
Discuss
Answer: (b).140 ns

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!