Operating System Mcq Question Paper 2021 ( AKTU )
1.The time taken to move the disk arm to the desired cylinder is called as _______.
a- positioning time
b- Random acces time
c- Seek time
d- Rotational latrncy
Answer - Seek Time
2.A paging scheme uses a Translation Look-aside Buffer (TLB). A TLB-access takes 10 ns and a main memory access takes 50 ns. What is the effective access time(in ns) if the TLB hit ratio is 90% and there is no page-fault?
(A) 54ns
(B) 60ns
(C) 65ns
(D) 75ns
Answer: (C) 65ns
3. If a process is executing in its critical section, then no other process is allowed to execute in the critical section.
(A) Mutual exclusion
(B) critical execution
(C) synchronous execution
(D) Asynchronous execution
Answer - (A) Mutual Exclusion
4.A Re-entrant kerne
(a) Is less responsive
(b) Results in less CPU
(c) Is more responsive
(d) Causes more CPU time waste
Answer - (c) Is more responsive
5.A deadlock free solution to the dining philosophers problem :
a. necessarily eliminates the possibility of starvation
b.does not necessarily eliminate the possibility of starvation
c.eliminates any possibility of any kind of problem further
d.none of the mentioned
Answer:(b) does not necessarily eliminate the possibility of starvation
6.Q1. Virtual memory is
(a) Large secondary memory
(b) Large main memory
(c) Illusion of large main memory
(d) None of the above
Answer: (c)
Explanation: Virtual memory is illusion of large main memory.
7.1. Concurrent access to shared data may result in ____________
a) data consistency
b) data insecurity
c) data inconsistency
d) none of the mentioned
Answer: (c) data inconsistency
8.which of these are file attributes
a.Name
b.identifier
c.type
d.All the options are correct
Answer :-d.All the options are correct
9. Que.
The two central themes of modern operating system are ...............
a.
Multiprogramming and Distributed processing
b.
Multiprogramming and Central Processing
c.
Single Programming and Distributed processing
d.
None of above
Answer: (b) Multiprogramming and Distributed processing
10.A solution to the problem of external fragmentation is ____________
a) larger memory space
b) smaller memory space
c) compaction
d) none of the mentioned
answer- c) compaction
11. External fragmentation exists when?
a) enough total memory exists to satisfy a request but it is not contiguous
b) the total memory is insufficient to satisfy a request
c) a request cannot be satisfied even when the total memory is free
d) none of the mentioned
Answer: (a).enough total memory exists to satisfy a request but it is not contiguous
12.For most computers, the bootstrap is stored in ________
a.
RAM
b.
ROM
c.
Cache
d.
Tertiary storage
Answer: (b).ROM
13.Banker's algorithm for resource allocation deals with
A. deadlock prevention & avoidance
B. deadlock detection & prevention
C. deadlock prevention & recovery
D. only deadlock recovery
Answer: Option a- deadlock prevention & avoidance
14. 3. The interval from the time of submission of a process to the time of completion is termed as ____________
a) waiting time
b) turnaround time
c) response time
d) throughput
Answer: b
Explanation: None.
15. What are the two steps of a process execution?
a) I/O & OS Burst
b) CPU & I/O Burst
c) Memory & I/O Burst
d) OS & Memory Burst
Answer: b
16.Switching the CPU to another process requires saving the state of the old process and loading the saved state for the new process. This task is known as a
a) process blocking
b)context switch
c)time sharing
d)none of the options is correct
answer- (b)-Context switch
17. Semaphores are mostly used to implement ____________
a) System calls
b) IPC mechanisms
c) System protection
d) None of the mentioned
Answer: b)- IPC mechanisms
18.If there are 32 segments, each of size 1k byte, then the logical address should have
a)15
b)16
c)17
d)14
Correct option is (a) 15 bits
19. The bounded buffer problem is also known as ____________
a) Readers – Writers problem
b) Dining – Philosophers problem
c) Producer – Consumer problem
d) None of the mentioned
Answer: c- Producer – Consumer problem
20.. What is Response time?
a) the total time taken from the submission time till the completion time
b) the total time taken from the submission time till the first response is produced
c) the total time taken from submission time till the response is output
d) none of the option is correct
Answer: b) b) the total time taken from the submission time till the first response is produced
21.which of the scheduling algorithm will lead to convoy effect mcq?
a)FCFS
b)Round robin
c)Shortest job first
d)None of the options
Answer :- (A). FCFS
22. Which RAID type doesn’t use parity for data protection?
a) RAID 5
b) RAID 4
c) RAID 6
d) RAID 1
Answer :- (d) Raid 1
23.What is dispatch latency?
A. The time taken by the dispatcher to stop one process and start another
B. The time taken by the processor to write a file into disk
C. The whole time taken by all processor
D. None of Above
Answer: Option A
24.) The mechanism of scheduling short process behind long process is called as...
(a) Convoy effect
(b) Little's formula
(c) Belady's anomaly
(d) Peterson's solution
Answer:- (a) Convoy effect
25.Given reference to the following page by a program:
0, 9, 0, 1,8, 1,8, 7, 8, 7, 1,2, 8, 2, 7, 8, 2, 3, 8, 3
If the program contains 3 page frames.
How many page fault will occur in optimal page replacement ?
a)4
b)5 .
c)6
d)7
Correct answer is option 'D
26.Which one of these is characteristic of RAID 5?
a) Distributed parity
b) No Parity
c) All parity in a single disk
d) Double Parity
Answer: a
27.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)224
b)236
c)245
d)240
answer:- b - 236
28. Main function of shared memory is:
A. to use primary memory efficently
B. to do intra process communication
C. to do inter process communication
D. none of above
answer:- (a) use primary memory efficently
Posts
0 Comments