Dr.
RafiqZakaria Campus
Maulana Azad College of Arts, Commerce & Science, Aurangabad
P.G. Dept. of Computer Science
M.Sc. I Semester
CSC-407: Modern Operating System
Time: 1 hr. TEST – I Marks: 20
Note: 1. Question 1 is compulsory.
2. From question number 2 to 5 attempt any two. (5 marks each)
Q.1. MCQ’s: 10 Marks
1. . 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
2. CPU fetches the instruction from memory according to the value of ____________
a) program counter
b) status register
c) instruction register
d) program status word
3. A memory buffer used to accommodate a speed differential is called ____________
a) stack pointer
b) cache
c) accumulator
d) disk buffer
4. Run time mapping from virtual to physical address is done by ____________
a) Memory management unit
b) CPU
c) PCI
d) None of the mentioned
5. 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
6. 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
7Program always deals with ____________
a) logical address
b) absolute address
c) physical address
d) relative address
8. Operating System maintains the page table for ____________
a) each process
b) each thread
c) each instruction
d) each address
9. The page table contains ____________
a) base address of each page in physical memory
b) page offset
c) page size
d) none of the mentioned
10What 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
Q.2. What are the different types of CPU Scheduling Algorithms?
write advantages and dis advantages of each algorithm
Q.3.Wite a note on context switching.
Q.4.explain page replacement strategies in detail:1)FIFO 2)LRU
Q.5 Explain threads and inter process communication.
Dr.RafiqZakaria Campus
Maulana Azad College of Arts, Commerce & Science, Aurangabad
P.G. Dept. of Computer Science
M.Sc. I Semester
CSC-407: Modern Operating System
Time: 1 hr. TEST – II Marks: 20
Note: 1. Question 1 is compulsory.
2. From question number 2 to 5 attempt any two. (5 marks each)
Q.1. MCQ’s: 10 Marks
1. The systems which allow only one process execution at a time, are called __________
a) uniprogramming systems
b) uniprocessing systems
c) unitasking systems
d) none of the mentioned
2. A process can be terminated due to __________
a) normal exit
b) fatal error
c) killed by another process
d) all of the mentioned
3. What is the ready state of a process?
a) when process is scheduled to run after some execution
b) when process is unable to run until some task has been completed
c) when process is using the CPU
d) none of the mentioned
4. 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
5. 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
6. . Which process can be affected by other processes executing in the system?
a) cooperating process
b) child process
c) parent process
d) init process
7. If a process is executing in its critical section, then no other processes can be executing in
their critical section. What is this condition called?
a) mutual exclusion
b) critical exclusion
c) synchronous exclusion
d) asynchronous exclusion
8. Which one of the following is a synchronization tool?
a) thread
b) pipe
c) semaphore
d) socket
9. A semaphore is a shared integer variable __________
a) that can not drop below zero
b) that can not be more than zero
c) that can not drop below one
d) that can not be more than one
10. Process synchronization can be done on __________
a) hardware level
b) software level
c) both hardware and software level
d) none of the mentioned
Q.2. What is MONITOR..Explain in detail.
Q.3. explain Semaphore in detail
Q.4. what is Deadlock? Explain Banker’s Algorithm.
Q.5. Write short notes on Classic Synchronization Problem:
a. Producer Consumer Problem
b. Dining Philosophers
c. Readers and Writer
d. Sleeping Barber
