MCQS
SUBJECT: OPERATING SYSTEM( B.tech IV SEM)
1. A Program in execution is called
a) Process
b) Instruction
c) Procedure
d) Function
2. Interval between the time of submission and completion of the job is called
a) Waiting time
b) Turnaround time
c) Throughput
d) Response time
3. A scheduler which selects processes from secondary storage device is called
a) Short term scheduler
b) Long term scheduler
c) Medium term scheduler
d) Process scheduler
4. The scheduling in which CPU is allocated to the process with least CPU-burst time is called
a) Priority Scheduling
b) Shortest job first Scheduling
c) Round Robin Scheduling
d) Multilevel Queue Scheduling
5. Which scheduling policy is most suitable for a time-shared operating system?
a) Shortest-job First.
b) Elevator.
c) Round-Robin.
d) First-Come-First-Serve.
6. SSTF stands for
a) Shortest-Seek-time-first scheduling
b) Small – small-time-first scheduling
c) simple-seek-time-first scheduling
d) small-simple-time-first scheduling
7. In UNIX, Which system call creates the new process?
a) fork
b) create
c) new
d) none of the mentioned
8. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is
compared with the priority of:
a) all process
b) currently running process
c) parent process
d) init process
9. The processes that are residing in main memory and are ready and waiting to execute are kept
on a list called:
a) job queue
b) ready queue
c) execution queue
d) process queue
10. Time quantum is defined in:
a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm
11. The minimum number of page frames that must be allocated to a running process in a virtual
memory environment is determined by
a) the instruction set architecture
b) page size
c) physical memory size
d) the number of process in memory
12. Multithreaded programs are:
a) lesser prone to deadlocks
b) more prone to deadlocks
c) not at all prone to deadlocks
d) None of these
13. Which one of the following is the address generated by CPU?
a) physical address
b) absolute address
c) logical address
d) none of the mentioned
14.Run time mapping from virtual to physical address is done by:
a) memory management unit
b) CPU
c) PCI
d) none of the mentioned
15. Memory management technique in which system stores and retrieves data from secondary
storage for use in main memory is called:
a) fragmentation
b) paging
c) mapping
d) none of the mentioned
16. The address of a page table in memory is pointed by:
a) stack pointer
b) page table base register
c) page register
d) program counter
17. The number of processes completed per multiprogramming is bounded by
a) the number of partitions
b) the CPU utilization
c) the memory size
d) All of these
18. A process can be terminated due to:
a) normal exit
b) fatal error
c) killed by another process
d) all of the mentioned
19. What is interprocess communication?
a) communication within the process
b) communication between two process
c) communication between two threads of same process
d) none of the mentioned
20. Which system call returns the process identifier of a terminated child?
a) wait
b) exit
c) fork
d) get
22. Pipe unit time is known as .
a) output
b) Throughput
c) Efficiency
d) Capacity
23. Which among following scheduling algorithms give minimum average waiting time
a) FCFS
b) SJF
c) Round robin
d) On priority
24. In which scheduling policies, context switching never takes place
a) FCFS
b) round robin
c) Shortest job first
d) Pre-empitive
25. A page fault occurs
a) when the page is not in the memory
b) when the page is in the memory
c) when the process enters the blocked state
d) when the process is in the ready state
26. The number of processes completed per unit time is known as .
a) Output
b) Throughput
c) Efficiency
d) Capacity.
27. A critical region
a) is a piece of code which only one process executes at a time
b) is a region prone to deadlock
c)is a piece of code which only a finite number of processes execute
d)is found only in Windows NT operation system
28.The mechanism that bring a page into memory only when it is needed is called
a) Segmentation
b) Fragmentation
c) Demand Paging
d) Page Replacement
29. PCB =
a) Program Control Block
b) Process Control Block
c) Process Communication Block
d) None of the above
30. Switching the CPU to another Process requires to save state of the old process and loading new
process state is called as .
a) Process Blocking
b) Context Switch
c) Time Sharing
d) None of the above
31. The model in which one kernel thread is mapped to many user-level threads is called:
a) Many to One model
b) One to Many model
c) Many to Many model
d) One to One model
32. What is a long-term scheduler ?
a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
d) None of the mentioned
33. The wait-for graph is a deadlock detection algorithm that is applicable when :
a) all resources have a single instance
b) all resources have multiple instances
c) all resources have a single & multiple instance
d) all of the mentioned
34. A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units
then, deadlock :
a) can never occur
b) may occur
c) has to occur
d) none of the mentioned
35. To access the services of operating system, the interface is provided by the
a) system calls
b) api
c) library
d) assembly instructions
36. Which one of the following is not true?
a) kernel is the program that constitutes the central core of the operating system
b) kernel is the first part of operating system to load into memory during booting
c) kernel is made of various modules which can not be loaded in running operating system
d) kernel remains in the memory during the entire computer session
37. If a process fails, most operating system write the error information to a
a) log file
b) another running process
c) new file
d) none of the mentioned
38. A set of processes is deadlock if
a) each process is blocked and will remain so forever
b) each process is terminated
c) all processes are trying to kill each other
d) none of the mentioned
39.What is Inter Process Communication (IPC)?
A. A process of sharing memory between two processes
B. A process of exchanging messages between two processes
C. A process of running two processes on the same CPU
D. A process of accessing files between two processes
40. Which of the following is not a type of IPC?
A. Shared Memory
B. Message Passing
C. Remote Procedure Call (RPC)
D. Multithreading
41. Which IPC mechanism is used for communication between processes on the same computer?
A. Shared Memory
B. Message Passing
C. Remote Procedure Call (RPC)
D. Semaphore
42. Which of the following is an example of a message passing IPC mechanism?
A. Pipes
B. Semaphores
C. Message Queues
D. Mutexes
43. Which of the following is an advantage of message passing over shared memory?
A. Simpler implementation
B. Higher performance
C. Easier to scale to multiple processors
D. Lower overhead
44. Which of the following is an example of a synchronous IPC mechanism?
A. Pipes
B. Message Queues
C. Semaphores
D. Signal Handlers
45. Which IPC mechanism is commonly used in real-time systems?
A. Pipes
B. Shared Memory
C. Message Passing
D. Semaphores
46. Which of the following page replacement algorithms suffers from Belady’s Anomaly?
a) Optimal replacement
b) LRU
c) FIFO
d) Both optimal replacement and FIFO
47. Users _______ that their processes are running on a paged system.
a) are aware
b) are unaware
c) may unaware
d) none of the mentioned
48. If no frames are free, _____ page transfer(s) is/are required.
a) one
b) two
c) three
d) four
49. When a page is selected for replacement, and its modify bit is set ____________
a) the page is clean
b) the page has been modified since it was read in from the disk
c) the page is dirty
d) the page has been modified since it was read in from the disk & page is dirty
50. The aim of creating page replacement algorithms is to ____________
a) replace pages faster
b) increase the page fault rate
c) decrease the page fault rate
d) to allocate multiple pages to processes
51. A FIFO replacement algorithm associates with each page the _______
a) time it was brought into memory
b) size of the page in memory
c) page after and before it
d) all of the mentioned
52. What is the Optimal page – replacement algorithm?
a) Replace the page that has not been used for a long time
b) Replace the page that has been used for a long time
c) Replace the page that will not be used for a long time
d) None of the mentioned
53. LRU page – replacement algorithm associates with each page the ______
a) time it was brought into memory
b) the time of that page’s last use
c) page after and before it
d) all of the mentioned
54. Optimal page – replacement algorithm is difficult to implement, because ____________
a) it requires a lot of information
b) it requires future knowledge of the reference string
c) it is too complex
d) it is extremely expensive
55. What are the two methods of the LRU page replacement policy that can be implemented in
hardware?
a) Counters
b) RAM & Registers
c) Stack & Counters
d) Registers
57. Round robin scheduling falls under the category of ____________
(a) Non-preemptive scheduling
(b) Preemptive scheduling
(c) All of the mentioned
(d) None of the mentioned
58. HTTP is
A. a stateful protocol
B. a stateless protocol
C. a protocol that maintains the status of its connection with the client
D. a protocol that does not maintain the status of its connection with the client.
59. In paging the user provides only_____ , which is partitioned by the
hardware into _____and ______.
A. one address, page number, offset
B. one offset, page number, address
C. page number, offset, address
D. none of these
60. What is compaction?
A. a technique for overcoming internal fragmentation
B. a paging technique
C. a technique for overcoming external fragmentation
D. a technique for overcoming fatal error
61. What is the drawback of banker’s algorithm?
A. in advance processes rarely know that how much resource they will need
B. the number of processes changes as time progresses
C. resource once available can disappear
D. all of the mentioned
62. What is the reusable resource?
A. that can be used by one process at a time and is not depleted by that use
B. that can be used by more than one process at a time
C. that can be shared between various threads
D. none of the mentioned
63. A process which is copied from main memory to secondary memory on the basis of
requirement is known as -
a) Demand paging
b) Paging
c) Threads
d) Segmentation
64.FIFO scheduling is a type of:
a) Pre-emptive scheduling
b) Non-pre-emptive scheduling.
c) Deadline scheduling
d) None of the above
65.Which of the type of OS reads and reacts in terms of actual time?
a) Quick sharing OS
b) Time Sharing OS
c) Real time OS
d) Batch OS
66.Thread is a
a) Light weight process
b) Heavy weight process
c) Multi-process
d) I/0 process
67.OS classifies the threads as-
a) Mainframe and motherboard level
b) Kernel and User level
c) Security and Memory level
d) OS and CPU level
68.Among the following CPU scheduling algorithms, which of these allocated the CPU first to the
process that requests the CPU first?
a) FCFS
b) SJF
c) Priority scheduling
d) None
69.Which of the following schedules threads?
a) Virtual memory
b) Operating system
c) CPU
d) Input
70.What is meant by ready state of a process?
a) When the process is scheduled to run after some execution
b) When the process is currently using the CPU
c) When the process is dependent of the execution time of some other process.
d) None of these
71.Among the following, which is an example of a spooled device?
a) A line printer that prints the output of a number of jobs.
b) A terminal that inputs user data
c) A I/O device to display graphics.
d) None
72.Main memory of a computer system is?
a) Non-volatile
b) Volatile
c) Restricted
d) Unrestricted
73.For which of the following purposes in Banker’s algorithm is used?
a) Preventing deadlock
b) Solving deadlock
c) Recover from deadlock
d) None
74.Device driver required in?
a) Register
b) Main memory
c) Disk
d) Cache
75.When are the register context and stack of thread deallocated?
a) when the thread terminates
b) when the thread blocks
c) when the thread unblocks
d) when the thread spawns
76.Threads is not shared among which of the following?
a) stack
b) program counter
c) both program counter and stack
d) none
77.For which of the following is the jacketing technique used?
a) to construct a new thread
b) to communicate between threads
c) convert a blocking system call into non blocking system call
d) None
78.For which of the following is resource sharing used?
a) an application having several threads of activity all within the same address space.
b) share the memory and resources of the process to which the threads belong
c) Compress the address space a process can use
d) all of the mentioned
79.Many to One model is at an advantage in which of the following conditions?
a) When the program needs to be multi-threaded
b) When there is a single processor present
c) When the program does not need multithreading
d) None
80.Identify the system calls that on termination does not return control to the calling point.
a) exec
b) fork
c) longjmp
d) ioctl
81.Consider the following program:
main()
{
if(fork()>0)
sleep(100);
}
a) infinite process
b) orphan process
c) zombie process
d) none
82.The output of the following C program is?
int main(){
fork();
fork();
printf("code ");
}
a) code code code code
b) code code code
c) code code
d) code
83.Identify the call which never returns an error?
a) fork
b) getpid
c) ioctl
d) open
84.What of the following defines Thread cancellation?
a) The process of terminating a thread process before its execution
b) The process of removing a thread after its work is executed
c) The process of destroying the thread after its work is executed
d) None
85,.When a thread terminates some target thread immediately, it is known as?
a) Immediate Termination
b) Asynchronous termination
c) Synchronous termination
d) Deferred cancellation
86.Which of the following commands in UNIX is used to send a signal?
a) send
b) kill
c) sigsend
d) none
87.The speed of writing data in magnetic tape disks is comparable to that of disk drives.
a) True
b) False
c) Both, depends on the data
d) None
88.Which of the following is the only state transition that is initiated by the user process itself?
a) dispatch
b) wakeup
c) block
d) none
89.Identify the two steps of a process execution.
a) CPU & I/O Burst
b) I/O & OS Burst
c) Memory & I/O Burst
d) CPU and Memory burst
90.Why is CPU scheduling done?
a) decrease CPU utilisation
b) decrease cost
c) increase CPU utilisation
d) None
91.The most optimal CPU scheduling algorithm is ________
a) Shortest Job First
b) First Come First Serve
c) Round robin
d) None
92.How many minimum variables is/are required to share between processes, so as to solve the
critical section problem?
a) one
b) two
c) three
d) four
93.Semaphore is a __ and it helps to solve the problem of ___?
a) atomic, critical section
b) integer variable, memory error
c) integer variable, critical section
d) atomic, memory error
94.Which of the following are two types of atomic operations performed by semaphores?
a) wait, signal
b) wait, stop
c) signal, stop
d) signal, wait
95.The two types of semaphores are-
a) Counting and decimal semaphore
b) Counting and binary semaphore
c) Counting and mutex
d) None
96.A binary semaphore has a value of
a) 0
b) 1
c) -1
d) 2
97.The release and request of resources are a type of which of the following?
a) system calls
b) I/O interrupts
c) command lines
d) None
98.Is mutual exclusion required for shareable resources?
a) Yes
b) No
c) Maybe
d) None
99.Unsafe states are?
a) Not deadlocks
b) Deadlocks
c) Livelock
d) None
100.Which of the following is not an operating system?
a) Linux
b) DOS
c) Oracle
d) Windows
101.Which of the following is a single user operating system?
a) Windows
b) Ms-DOS
c) MAC
d) None
102.To access the services of operating system the interface is provided by the?
a) System Calls
b) API
c) Library
d) Assembly Instructions
103.The size of virtual memory is based on which of the following?
a) CPU
b) Address Bus
c) RAM
d) Data Bus
103. If the page size increases, the internal fragmentation is also?..?
a) Decreases
b) Increases
c) Remains constant
d) None of these
104.Which of the following is a single-user operating system?
a) Windows
b) MAC
c) Ms-Dos
d) None of these
105. The size of virtual memory is based on which of the following?
a) CPU
b) RAM
c) Address bus
d) Data bus
106. If a page number is not found in the translation lookaside 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
107. Which of the following is not application software?
A)
a) Windows 7
b) WordPad
c) Photoshop
d) MS-excel
108. Which of the following operating systems does not support more than one program at a time?
a) Linux
b) Windows
c) MAC
d) DOS
109.Who provides the interface to access the services of the operating system?
a) API
b) System call
c) Library
d) Assembly instruction
110. Where are placed the list of processes that are prepared to be executed and waiting?
a) Job queue
b) Ready queue
c) Execution queue
d) Process queue
111. Who among the following can block the running process?
a) Fork
b) Read
c) Down
d) All of these
112. Which of the following does not interrupt the running process?
a) Timer interrupt
b) Device
c) Power failure
d) Scheduler process
113.What type of scheduling is round-robin scheduling?
a) Linear data scheduling
b) Non-linear data scheduling
c) Preemptive scheduling
d) Non-preemptive scheduling
114. Which conditions must be satisfied to solve a critical section problem?
a) Bounded Waiting
b) Progress
c) Mutual Exclusion
d) All of these.
115. Which of the following options is correct about the windows operating system?
a) Windows is a CUI operating system.
b) Windows is based on CUI.
c) Windows is a GUI operating system.
d) None of the these
116. Which of the following operating system runs on the server?
a) Batch OS
b) Distributed OS
c) Real-time OS
d) Network OS
117. Which of the following "semaphore" can take the non-negative integer values?
a) Binary Semaphore
b) Counting Semaphore
c) Real Semaphore
d) All of the these
118. Which method is the best among file allocation methods?
a) Linked
b) Contiguous
c) Indexed
d) None of the these
119. In which allocation method does the user size the file before creating the file?
a) Contiguous
b) Linked
c) Indexed
d) None of the these
120. Which of the following component does not belong to PCB (Process Control Block)?
a) CPU registers
b) CPU scheduling information
c) Operating System information
d) Accounting information
