MCQ's: OS Concepts + CA

1. The minimum time delay between the initiation of two independent memory opera
tions is called
a. access time
b. cycle time
c. transfer time
d. latency time
ans: b
2.
a.
b.
c.
d.

Chose the correct statements

Bus is a group of information carrying wires
Bus is needed to achieve reasonable speed of operation
Bus can carry data or addresses
A bus can be shared by more by more than one device.

ans: a,b,c,d
3. On recieving interrupt from an I/O device, the CPU
a. halts for predetermined time
b. hands over control of address bus and data bus to the interrupt device
c. branches off to the interrupt service routine immidiately
d. branches off to the interrupt service routine after completion of the current
instruction
ans: d
4.
a.
b.
c.
d.

Virtual memory is
an extreamly large main memory
an extreamly large secondary memory
an illusion of extreamly large memory
a type of memory used in super computer

ans: c
5. A Computer handles several interrupt sources of which of the following are re
levant for this question
--> Interrupt from CPU temprature sensor(raises interrupt if CPU temp is
too high)
--> Interrupt from mouse (raises interrupt if the mouse is moved or a bu
tton is pressed)
--> Interrupt from Keyboard(raises interrupt when a key is pressed)
--> Interrupt from Hard Disk(raises interrupt when disk read in conmplet
ed)
Which one of these will be handled at the highest priority
a. Interrupt from hard disk
b. Interrupt from Mouse
c. Interrupt from Keyboard
d. Interrupt from CPU temprature sensor
ans: d
6.
a.
b.
c.
d.

Page fault occures when

the page corrupted by application software
the page is in main memory
the page is not in main memory
one tries to divide a number by 0

ans: c

7. The page replacement policy that sometimes leads to more page faults when the
size of the memory is increased as
a. FILFO
b. LRU
c. no such policy exists
d. none of the above
ans: a
8.
a.
b.
c.
d.

Fragmentation is
dividing the secondary memory into equal sized fragments
dividing the main memory into equal-sized fragments
fragments of memory words used in a page
fragments of memory words unused in a page.

ans: d
9.
a.
b.
c.
d.

Neccessary conditions for deadlock are:

non-preemption and circular wait
Mutual exclusion and partial allocation
both (a) and (b)
none of the above

ans: c
10. In a time-sharing operating system, when the time slot given to process is c
ompleted, the process goes from RUNNING state to the
a. BLOCKED state
b. READY state
c. SUSPENDED state
d. TERMINATED state
ans: b
11. Semaphores are used to solve the problem of
a. race condition
b. process synchronization
c. mutual exclusion
d. none of the above
ans: b and c
12. The number of bits in the tag field of an address is
a. 11
b. 14
c. 16
d. 27
ans: c
13. Some computer systems
pervisor or monitor mode.
a. by which user programs
b. by which the operating
c. in which the processor
d. of memory access
ans: c

supports dual mode operation -the user mode and the su

These refers to the modes
handle their data
system executes user programs
and the associated hardware operate

14. Dirty bit (Modify bit) is used to show the

a. page with corrupted data
b. wrong page in the memory
c. page that is modified after being loaded into cache memory
d. page that is less frequently accessed
ans: c
15. Which of the following is a service not provided by the operating system?
a. Protection
b. Accounting
c. Compilation
d. I/O operation
ans: c
16. In Round Robin CPU Scheduling, as the time quantum is increased, the average
turn around time
a. increases
b. decreases
c. reamins constants
d. varies irregularly
ans: d
17. In which of the following scheduling policies does context switching never t
ake place?
a. Round Robin
b. Shortest Job First
c. Preemptive
d. First-Come-First-Served
ans: d
18. Which of the following statement is true
I. Shortest remaining time first time scheduling may causes starvation
II. Preemptive scheduling may cause starvation
III. Round robin is better than FCFS in terms of response time
a.
b.
c.
d.

I only
I and III only
II and III only
I, II and III

ans: d
19. Which of the following scheduling algorithm gives minimum average waiting ti
me?
a. FCFS
b. SJF
c. Round-Robin
d. Priority
ans: b
20. Thrashing
a. reduces page I/O
b. decreases the degree of multiprogramming( the no. of processes in memory)
c. implies excessive page I/O

d. improves the system performance

ans: c
21. Which of the following features of UNIX may be used for IPC?
a. Signals
b. Pipes
c. Semaphore
d. Message queues
e. all of the above
ans: e
22. The system identifies the file by its
a. name
b. absolute path
c. file owner
d. inode number
ans: d
23. The PID of the Kernel process is
a. undefined
b. 0
c. 1
d. 3
ans: b
24. Which of the following calls never returns an error?
a. getpid
b. fork
c. ioctl
d. open
ans: a
25. The dispatcher
a. actually schedules the tasks into the processor
b. puts tasks in I/O wait
c. is always small and simple
d. never changes task priorities
e. none of above
ans: a
26. The Kernel identifies each process by
a. its process number called PID(Process ID)
b. its OS
c. its UNIX
d. none of the above
ans: a
27. Memory Protection is normally done by
a. the processor and associated hardware
b. the operating system
c. the compiler
d. the user program

ans: a
28. Mutual exclusion problem occures between
a. two disjoint processes that do not interact
b. processes that share resources
c. processes that do not use some resource
d. none of the above
ans: b
29. For implementing a multiprogramming OS
a. special support from processor is essential
b. special support from processor is not essential
c. cache memory must be available
d. more than one processor must be available
ans: b
30. Which of the following is required device driver?
a. Register
b. Cache
c. Disk
d. none of the above
ans: c