1.

Which of the following is a condition that

causes deadlock? Ibps main
A. Mutual exclusion
B. Hold and wait
C. No preemption
D. All of these
ANS:- D
2. Match of the following:-
A. Disk scheduling round robin
B. Batch processing scan
C. Time sharing LIFO
D. Interrupt processing FIFO
ABCD
A. 3 4 2 1
B. 4 3 2 1
C. 3 4 1 2
D. 2 4 1 3
ANS:- D
3.Banker’s algorithm used for ___ purpose.
A. Deadlock avoidance
B. Deadlock removal
C. Deadlock prevention
D. Deadlock continuation
ANS:- A
4. Producer consumer problem can be solved
using:-
A. Semaphore
B. Monitors
C. Event occurs
D. All of the Above
ANS:- D
5. Moving process from main memory to disk is
called
A. Caching
B. Termination
C. Swapping
D. Interruption
ANS:- C
6. The principle of locality of reference justifies
the use of:-
A. Virtual memory
B. Interrupts
C. Cache memory
D. Secondary memory
ANS:- C
7. Which is the correct definition of a valid
process transition in an operating system?
A. Wake up : ready running
B. Dispatch: ready  running
C. Block : ready  running
D. Timer run out: ready  blocked
ANS:- B
8. An operating system is
A. Collection of hardware components
B. Collection of input-output devices
C. Collection of software routines
D. All of the above
ANS:- C
9. ____ is one of pre-emptive scheduling
algorithm.
A. Shortest- job- first
B. Round- robin
C. Priority based
D. Shortest- job next
ANS:- B
10. Loading operating system from secondary
memory to primary memory is called
A. Compiling
B. Booting
C. Refreshing
D. Reassembling
ANS:- B
11. A software to create a job queue is called
A. Linkage
B. Interpreter
C. Driver
D. Spooler
ANS:- D
12. In Processor management, round robin
method essentially uses the pre-emptive
version of
A. FILO
B. FIFO
C. SJF
D. Longest time first
ANS:- B
13. Memory is wasted?
A. Fragmentation
B. Compaction
C. Multiplexing
D. Thrashing
ANS:- A
14. The memory allocation scheme subjected to
“external ” fragmentation is:
A. Segmentation
B. Swapping
C. Demand paging
D. Multiple contiguous fixed partitions
ANS:- A
15. A page fault__________.
A. Is an error in specific page
B. Is an access to the page not currently in main memory.
C. Occurs when a page program accesses a page of memory
D. Is reference to the page which belongs to another program
ANS:- B
16. Window is a operating system :
A. Non-pre-emptive
B. Pre-emptive
C. Multi user
D. Real time
ANS:- B
17. Which page replacement policy suffers from
Belady’s anomaly?
A. LRU
B. LFU
C. FIFO
D. OPTIMAL
ANS:- C
18. Cache memory is-
A. high-speed Register
B. Low-speed Ram
C. Non-volatile Ram
D. High-speed Ram
ANS:- D
19. An example of a non- pre-emptive
scheduling algorithm is
A. Round robin
B. Priority scheduling
C. Shortest job first
D. 2 level scheduling
ANS:- C
20. An example of a distributed OS is
A. Amoeba
B. Unix
C. MS-DOS
D. MULTICS
ANS:- A
21. If the executing program size is greater than
existing Ram of a computer, it is still possible to
execute the program if the OS supports
A. Multitasking
B. Virtual memory
C. Paging system
D. None of these
ANS:- B
22. A program is located in the smallest
available hole in the memory is
A. Best-fit
B. first-fit
C. worst-fit
D. Whole
ANS:- A
23. 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
ANS:- A
24. Variable partition memory management
technique with compaction results in
A. Reduction of fragmentation
B. Minimal wastage
C. Segment sharing
D. None of the above
ANS:- A
25. A deadlock is an operating system is
A. Desirable process
B. Undesirable process
C. Definite waiting process
D. All of the above
ANS:- C
26 A thread is a light weight process. In the
above statement, weight refers to
A. Time
B. Number of resources
C. Speed
D. All of the above
ANS:- B
27.Resources are allocated to the process on
non sharable basis is
A. Mutual exclusion
B. Hold and wait
C. No pre-emption
D. Circular wait
ANS:- A
28. A virtual memory based memory
management algorithm partially swaps out a
process. This is an example of
A. Short term scheduling
B. Long term scheduling
C. Medium term scheduling
D. Mutual exclusion
ANS:- C
29.The portion of windows 2000 operating
system which is not portable is
A. Processor management
B. User interface
C. Device management
D. Virtual memory management
ANS:- D
30. Match of the following:-
A. Timeout ordering protocol wait for graph
B. Deadlock prevention Rollback
C. Deadlock detection wait-die scheme
D. Deadlock recovery Thomas write rule
ABCD
A. 4 3 1 2
B. 3 2 4 1
C. 2 1 4 3
D. 3 1 4 3
ANS:- A
31. System calls are usually invoked by using:
A. A privileged instruction
B. An indirect jump
C. A software interrupt
D. Polling
ANS:- C
32.Match of the following
A. Demand paging degree of multiprogramming
B. segmentation working set
C. Dynamic partitions supports user view of memory
D. Fixed partitions compaction
ABCD
A. 3 4 2 1
B. 2 3 1 4
C. 4 3 2 1
D. 2 3 4 1
ANS:- D
33. UNIX is written in which language?

A. C
B. C++
C. C#
D. Java
ANS:- A
34.A LRU page replacement is used with four
page frames and eight pages. How many page
faults will occur with reference string
0,1,7,2,3,2,7,1,0,3 if the four frames are initially
empty?
A. 6
B. 7
C. 5
D. 8
ANS:- A
35. Dining philosopher’s problem is a:-
A. Producer- consumer problem
B. Classical IPC problem
C. Starvation problem
D. Synchronization primitive
ANS:- B
36. ___ allocation method for disk block
allocation in a file system, insertion and
deletion of blocks in a file is easy.
A. Index
B. Linked
C. Contiguous
D. Bit map
ANS:- B
37. A Unix file may be of the type
A. Regular file
B. Directory file
C. Device file
D. Any one of these
ANS:- D
38. Threads is not shared among which of the
following?
A. Program counter
B. Stack
C. Both a and b
D. None
ANS:- C
39. Which of the following scheduling
algorithms may cause starvation?
A. FCFS
B. ROUND ROBIN
C. PRIORITY
D. SHORTEST PROCESS NEXT
E. SHORTEST REAMINING TIME FIRST

A. c, d and e
B. b, d and e
C. b, c and d
D. a, c and e
ANS:- A
40 In distributed system, the capability of a
system to adapt the increased service load is
called
A. Tolerance
B. Scalability
C. Capability
D. Loading
ANS:- B
41. Which module gives control of the cpu to
the process selected by the short-term
scheduler?
A. Dispatcher
B. Interrupt
C. Scheduler
D. Threading
ANS:- A
42.Two atomic operations permissible on
semaphores are ____ and _____
A. Wait , stop
B. Wait, hold
C. Hold, signal
D. Wait, signal
ANS:- D
43.In _____ disk scheduling algorithm the disk
head move from one end to other end of the
disk, serving the requests along the way. When
the head reaches the other end, it immediately
returns to the beginning of the disk without
serving any requests on the return trip.
A. LOOK
B. SCAN
C. C-LOOK
D. C-SCAN
ANS:- D
44. The Bounded buffer problem is also known
as
A. Producer – consumer problem
B. Reader- writer problem
C. Dining philosophers problem
D. Both (b) and (c)
ANS:- A
45. Page information in memory is also called as
page table. The essential contents in each entry
of a page table is/are___
A. Page access information
B. Virtual page number
C. Page frame number
D. Both virtual page number and page frame number
ANS:- C
46. In which of the following scheduling criteria,
context switching will never take place?
A. Round robin
B. Pre-emptive SJF
C. Non- pre-emptive SJF
D. Pre-emptive priority
ANS:- C
47. A process residing in main memory and
ready and waiting for execution , is kept on
A. Execution queue
B. Wait queue
C. Job queue
D. Ready queue
ANS:- D
48. Which of the following are not shared by
the threads of the same process?
A. Stack
B. Registers
C. Address space
D. Message queue
a) I and IV C) II and III
b) I and II d) I, II and III
ANS:- C
49. Match of the following:-
A. Disk B. Thread
B. CPU D Signal
C. Memory A .File system
D. Interrupt C virtual address space
50. Which of the following CPU scheduling
algorithms is supported by linux operating
system?
A. Non- pre-emptive priority scheduling
B. Pre-emptive priority scheduling and time sharing cpu scheduling
C. Time sharing scheduling only
D. Priority scheduling only
ANS:- B