Comprehensive-OS-Question-Bank

For more notes visit

https://rtpnotes.vercel.app

Qno Question Answer

1 What portrays the hierarchical representation of data? D
a) Stack b) Array c) Linked List d) Tree
2 When does page fault occur? C
A) Page is present in memory
B) The deadlock occurs
C) The page does not present in memory
D) The buffering occurs
3 Which of the following is the allocation method of a disk D
space?
A)Contiguous allocation
B)Linked allocation
C)Indexed allocation
D)All of the Above
4 In a time sharing operating system, when the time slot given B
to a process is
completed, the process goes from running state to
A)Blocked state
B)Ready state
C) Suspended state
D)Terminated state
5 Which of the following is a condition that causes deadlock? D

A) Mutual exclusion
B) Hold and wait
C) No preemption
D) All of these
6 What else is a command interpreter called? C
A.prompt
B.kernel
C.shell
D.command
Qno Question Answer
7 When a process creates a new process using the fork() D
operation,which of the
following states is shared between the parent process and the
child process?
A.Stack
B.Heap
C.Shared memory segments
D.NONE of the above
8 Which of the following is also known as elevator algorithm? C
(A)SSTF (B) CSCAN (C) SCAN (D)LOOK
9 The size of the virtual memory is based on which of the C
following
a) CPU. b) RAM c). Address bus. d). Data bus
10 A Process Control Block(PCB) does not contain which of the C
following?
a) Code
b) Stack
c) Bootstrap program
d) Data
11 Consider a system with 3 processes that share 4 instances of 2 to 2
the same resource
type. Each process can request a maximum of 𝐾 instances.
Resource instances
can be requested and released only one at a time. The largest
value of 𝐾 that will
always avoid deadlock is ____
12 Which of the following memory unit the processor can access C
rapidly:
A)Main memory
B) Virtual memory
C) Cache memory
D) Read Only memory
13 FIFO scheduling is C
(A) Fair-share scheduling
(B) Deadline scheduling
(C) Non-preemptive scheduling
(D) Preemptive scheduling
14 A file control block contains the information about D
a) File Ownership
b) File Permissions
c) Location of file contents
d) All of the mentioned
Qno Question Answer
15 Which algorithm is defined in Time quantum? B
a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm
16 Which of the following is not an operating system? C

A Windows
B Linux
C Oracle
D DOS
17 The LRU algorithm C
A) Pages out pages that have been used recently
B) Pages out pages that have not been used recently
C) Pages out pages that have been least used recently
D) Pages out the first page in a given area
E) None of the above
18 Which is the linux Operating System ? C
a)Private Operating System
b)Windows Operating System
c)Open-source Operating System
d)None of thes
19 The child process completes execution, but the parent keeps B
executing,
then the child process is known as __________
a) Orphan
b) Zombie
c) Body
d) Dead
20 A ___________ allows a process to be pre-empted while it is B
running in
kernel mode.
a) Kernel mode
b) Pre-emptive kernel mode
c) Non pre-emptive kernel mode
d) Critical section
21 If the page size increases, the internal fragmentation is B
also?..?

A)Decreases
B)Increases
Qno Question Answer
C)Remains constant
D)None of these
22 Which one of the following is not shared by threads? C
a) program counter
b)kerck
c) both program counter and stack
d) none of the mentioned
23 BIOS is used? A
A)By operating system
B)By compiler
C)By interpreter
D)By application software
24 Banker's algorithm is used? A
A To prevent deadlock
B To deadlock recovery
C To solve the deadlock
D None of these
25 Who provides the interface to access the services of the B
operating system?
a. API
b. System call
c. Library
d. Assembly instruction
26 In a time sharing operating system, when the time slot given B
to a process is
completed, the process goes from running state to
A)Blocked state
B)Ready state
C) Suspended state
D)Terminated state
27 Where are placed the list of processes that are prepared to be B
executed and waiting?
a. Job queue
b. Ready queue
c. Execution queue
d. Process queue
28 The Basic Input Output System (BIOS) resides in B
a) RAM
b) ROM
c) The CPU
d) Memory Cache
Qno Question Answer
29 The size of the virtual memory is based on which of the C
following
b) CPU. b) RAM c). Address bus. d). Data bus
30 What is used to make a connection between two applications? C
a) Kernel
b) Thread
c) Socket
31 Which of the following is the major part of time taken when C
accessing data
on the disk?
A)Settle time
B)Rotational latency
C)Seek time
D)Waiting time
32 Each process represented on the OS by a PCB is also called A

A) Control block
B) Process block
C) management block
D) ALU
33 When does page fault occur? C
A.The page is present in memory.
B.The deadlock occurs.
C.The page does not present in memory.
D.The buffering occurs.
34 Which of the following does not interrupt the running process? D
a)Timer interrupt
b) Device
c) Power failure
d) Scheduler process
35 What are Multithreaded programs? B
a) lesser prone to deadlocks
b) more prone to deadlocks
c) not at all prone to deadlocks
d) none of the mentioned
36 The interval from the time of submission of a process to the B
time of completion is
termed as ____________
a) waiting time
b) turnaround time
c) response time
d) throughput
Qno Question Answer
37 Data blocks of very large file in the unix system are allocated D
using
A.contigious allocation
B.linked allocation
C.indexed allocation
D. An extension of indexed allocation
38 A program in execution is called B
a) A Paging
b) A Process
c) A virtual memory
d) A Demand Page
39 What is POST A
a) Power on self test
b) Power on start test
c) Power off self test
d) Power off start test
40 Piece of code that only one thread can execute at a time is B
called
a) Mutual Exclusion
b) Critical Section
c) Synchronization
d) All of them
41 Logical memory is broken into blocks of the same size called B

A) frames
B) pages
C) backing store
D) none of the mentioned
42 What is the mean of the Booting in the operating system? A
A)Restarting computer
B)Install the program
C)To scan
D) To turn off
43 If a page number is not found in the translation lookaside A
buffer, then it is known as a?
A) Translation Lookaside Buffer miss
B) Buffer miss
C) Translation Lookaside Buffer hit
D) All of the mentioned
44 When the entries in the segment tables of two different C
processes point to the
same physical location ___
Qno Question Answer
a) the segments are invalid
b) the processes get blocked
c) segments are shared
d) all of the mentioned
45 Banker’s algorithm is used in B
(A) Deadlock prevention
(B) Deadlock avoidance
(C) Deadlock detection
(D) Deadlock recovery
46 A system contains three programs and each requires three C
tape units for its
operation. The minimum number of tape units which the
system must have such
that deadlocks never arise is _________
(A)5 (B)8 (C)7 (D)10
47 Usage of Preemption and Transaction Rollback prevents A
A.Deadlock situation
B.Data manipulation
C.Unauthorised usage
D.Other
48 What is the fence register used for? To memory
protection
49 The degree of multi programming is D
(A) The number of process executed per unit time
(B) The number of process in the ready queue
(C) The number of process in the I/O queue
(D) The number of process in memory
50 What is the maximum length of the filename in DOS? 8
51 What is bootstrapping called? A
A Cold boot
B Cold hot boot
C Cold hot strap
D Hot boot
52 Which of the following do not belong to queues for processes? B
a) Job Queue
b) PCB queue
c) Device Queue
d) Ready Queue
53 A process which is copied from main memory to secondary Demand paging
memory on the basis of requirement is
Qno Question Answer
54 For which of the following purposes, Banker’s algorithm is Preventing
used? deadlock
55 Identify the system calls that on termination does not return exec
control to the calling point.
56 A CPU generates 32-bit virtual addresses. The page size is 4 15 bits
KB. The processor has a translation look-aside buffer (TLB)
which can hold a total of 128-page table entries and is 4-way
set associative. The minimum size of the TLB tag is
57 Dirty bit is used to indicate which of the following? A page has
been modified
after being
loaded into
cache
58 A system uses FIFO policy for page replacement. It has 4- 196
page frames with no pages loaded to begin
with. The system first accesses 100 distinct pages in some
order and then accesses the same 100
pages but now in the reverse order. How many page faults will
occur?
59 If a process is executing in its critical section, then no other mutual exclusion
processes can be executing in their
critical section. What is this condition called?
60 What is a long-term scheduler? It selects
processes which
have to be
brought into the
ready queue
61 A systematic procedure for moving the CPU to new process is Context
known as- Switching
62 In a virtual memory system, size of virtual address is 32-bit, 14
size of physical address is 30-bit, page
size is 4 Kbyte and size of each page table entry is 32-bit. The
main memory is byte addressable.
Which one of the following is the maximum number of bits that
can be used for storing protection and
other information in each page table entry?
63 Which of the following is not a primary function of an OS? Database
management
64 The bankers algorithm grants resource requests if D
a) The requested resources are immediately available
b) The requested resources do not exceed the maximum
Qno Question Answer
claim of the process
c) The requested resources do not exceed the total resources
available in the system
d) All of the Above
65 The bankers algorithm is applicable to which type of resource Non preemptive
allocation problem? resource allocation
66 The Dining philosphers problem can lead to a deadlock if All philosphers try
to pick up both
chopsticks
simulataneously
67 In the Dining philosphers problem, the maximum number of N-1, where n is the
philosophers who can eat simultaneously without deadlock is number of
philosphers
68 Which memory management technique allows for efficient Segmentation
utilization of memory by allocation memory in variable sized
blocks
69 A deadlock in an OS occurs when A Process is
unable to access a
required resource
indefinitely
70 9.75

71 Consider a system with three resource types (A,B,C) and 4 No

processes (P1,P2,P3,P4) The maximum resource allocation
needs for each process are as follows.
Qno Question Answer
72 13

73 Consider 3 CPU-intensive processes, which require 10,20 1

and 30 time units and arrive at times 0,2, and 6 respectively.
How many context switches are needed if the operating
system implements shortest remaining time first scheduling
algorithm? Do not count the context switches at time zero and
at the end
74 Which of the following are not shared by threads of the same D
process
a) Stack
b) Registers
c) Address space
d) Message queue
75 The problem of indefinite blockage of low priority jobs in C
general priority scheduling algorithm can be solved using
a) Swapping
b) Dirty bit
c) Aging
d) Compaction
76 Which of the following are the advantage of A
multiprogramming?

a) High end efficient CPU utilization

b) CPU Scheduling is not required
c) memory management is good
d) All of the above
77 A memory management system has 64 pages with 512 bytes C
page size. Physical memory consists of 32 page frames
Number of bits required in logical and physcial address are
respectively

a) 14 and 15
b) 14 and 29
c) 15 and 14
d) 16 and 32
78 Consider the reference string A
012301401234
Qno Question Answer
If FIFO page replacement algorithm is used then the number
of page faults with 3 page frames and 4 page frames are __
and __ respectively

a) 10,9
b) 9,9
c) 10,10
d) 9,10
79 Consider a disk queue with I/O requests on the following B
cylinders in their arriving order

6,10,12,54,97,73,128,15,44,110,34,45

The disk head is assumed to be at cylinder 23 and moving in

the direction of decreasing number of cylinders. Total number
of cylinders in the disk is 150, The disk head movement using
SCAN scheduling algorithm is

a) 172
b) 173
c) 151
d) 161
80 At a particular time of computation, the value of a counting B
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
81 In the __ algorithm, the disk head moves from one end to SCAN
other, servicing requests along the way. When the head
reaches the other end. It immediately returns to the beginning
of the disk without servicing any requests on the return trip
82 Paging suffers from __ Fragmentation B

a) External
b) Internal
c) Physical
d) All of the above