KAMALA INSTITUTE OF TECHNOLOGY & SCIENCE,SINGAPUR

III B.Tech I SEM I Mid Examination

Subject: Operating systems DOE : 06 -09-2018( F.N)

Branch: ECE Roll No:……………………… Time: 20min Max.Marks:10

Choose the correct answer from the following

1. Which of the following is not an operating system ( )

a. Linux b. Solaris c. Oracle d. Windows XP
2. Which of the following is an example of a systems program? ( )
a. Command interpreter b. Text formatter c. Web browser d. Database sysyem
3. Policy is ( )
a. determines how to do something c determines what will be done
b. is not likely to change across places d. is not likely to change over time
4. Which of the following is not considered a resource that may be allocated by an operating system? ( )
a. CPU b.Storage device C. file System D. I/O devices
5. The list of processes waiting for a particular I/O device is called a(n) ____. ( )
a. Ready queue b.Standby queue c.Job Queue d. Device queue
6. The ____ scheduling algorithm is designed especially for time-sharing systems. ( )
a. SJF b. RR C.FCFS d. Priority scheduling
7. Which system call returns the process identifier of a terminated child? ( )
a) wait b) exit c) fork d) get
8. A Process Control Block(PCB) does not contain which of the following ( )
a) Code b) Stack c) Bootstrap program d) Data
9. 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.
10. Run time mapping from virtual to physical address is done by ( )
a) Memory management unit b) CPU c) PCI d) None of the mentioned
Fill in the blanks
11. Bootstrap programs must be provided using ________
12. The number of processes completed per unit time is known as __________
13. The degree of multiprogramming is------------------------------
14. Most often, application programs access system resources using ______ .
15. In RR scheduling, the time quantum should be _________ the context-switch time.
16. The ___ of a process contains temporary data such as function parameters, return addresses,
and local variables
17. ____ scheduling is approximated by predicting the next CPU burst with an exponential
average of the measured lengths of previous CPU bursts.
18. With relocation and limit registers, each logical address must be _______ the limit register
19. The first fit, best fit and worst fit are strategies to select a ______from available holes.
20. A solution to the problem of external fragmentation is ----------------------------------------