CS604 Final Term Solved MCQs by Junaid

CS604 · 0PERATING SYSTEM · FINAL TERM

Q1. ……………is the separation of user logical memory from physical memory.

1. physical memory
2. ROM
3. virtual memory pg#185
4. one of the given

Correct answer: virtual memory pg#185

Q2. When the address used in the program gets converted to an actual physical RAM address is called……..

1. Execution
2. loading
3. compiling
4. Address binding pg#151

Correct answer: Address binding pg#151

Q3. The set of all Logical address generated by a program from………….of the process.

1. process address space
2. Physical address space pg#155
3. logical address space
4. none of the given

Correct answer: Physical address space pg#155

Q4. 1 KB is equivalent to…..

1. 10 bytes
2. 100 bytes
3. 1000bytes from Google
4. 1024 bytes

Correct answer: 1000bytes from Google

Q5. …….. Page replacement algorithm suffers from Belay’s anomaly.

1. LIFO
2. FIFO pg#199
3. MRU
4. LRU

Correct answer: FIFO pg#199

Q6. ..…….points to the smallest memory address of a process.

1. Limit register
2. Base register pg#10 Base register – it holds the smallest legal physical memory address for a process
3. Stack register
4. None of the given

Correct answer: Base register pg#10 Base register – it holds the smallest legal physical memory address for a process

Q7. In ……… system, the user space contain one process at a time because only one process is executing at given time

1. Multi programmed
2. Batch pg#5
3. Time-sharing system
4. None of the given

Correct answer: Batch pg#5

Q8. ………wastes CPU cycles and hence a problem in real multiprogramming system.

1. Busy Waiting pg#111
2. Semaphore
3. Critical Section
4. Mutex

Correct answer: Busy Waiting pg#111

Q9. A new process is called by the …………system call

1. exit
2. fork pg#36
3. wait
4. exec

Correct answer: fork pg#36

Q10. The address generated by the CPU after any indexing or other addressing- mode arithmetic is called……….address and the address it gets translated by MMU is called………..address.

1. Virtual, physical pg#153
2. Hexadecimal, Binary
3. Valid, Virtual
4. Physical, Virtual

Correct answer: Virtual, physical pg#153

Q11. ………is single program that produces an object file.

1. Linker
2. Compiler pg#86
3. loader
4. text editor

Correct answer: Compiler pg#86

Q12. In …………..frame allocation scheme free frames are equally divided among processes.

1. Fixed pg#205 or Fixed Allocation
2. Proportional
3. Priority
4. All of the given

Correct answer: Fixed pg#205 or Fixed Allocation

Q13. Named pipes give …………flow of data by default.

1. half-duplex pg#46
2. full-duplex
3. both half and full duplex
4. none of the above

Correct answer: half-duplex pg#46

Q14. …..….. Is the variation of frok system call in several Unix operating system used for virtual memory.

1. vfrok() pg#194
2. wfrok()
3. afrok()
4. bfrok()

Correct answer: vfrok() pg#194

Q15. In scan algorithm the disk…………starts at one end of the disk, and moves towards other end, servicing requests as it reaches each cylinder, until it gets to the other end of the disk.

1. arm pg#245
2. cylinder
3. head
4. none

Correct answer: arm pg#245

Q16. The problem of Deadlock can be solved by………….method(s).

1. Deadlock prevention
2. Deadlock avoidance
3. Allowing Deadlock
4. All of the given Google

Correct answer: All of the given Google

Q17. In…………., each file is a linked lists blocks may be scattered anywhere on the disk.

1. Indexed Allocation
2. Contiguous Allocation
3. Linked Allocation pg#235
4. none of the above

Correct answer: Linked Allocation pg#235