Pre-final examination 2009
BScIT 2nd semester
Operation System
Section A
Each question carries 1 mark [1x21=21]
1. When using the “Banker’s Algorithm” for resource allocation, a process that requests a resource may be forced to wait even if there are far more units available than it requests, and even if no other process currently holds even a single unit of that resource.
A. It is true
B. It is False
C. Only UNIX operating system
D. Only Windows O/S
2. Multiprogramming refers to _______
A. Having several programs in RAM at the same time
B. Multitasking
C. Writing programs in multiple languages
D. None of the Above
3. Which is/are logical resources?
A. Files
B. Semaphores
C. Monitors
D. All of the above
4. Instructions are fetches inside a ____ for the execution.
A. Virtual memory
B. Main memory
C. Backup storage
D. Read only memory
5. The zero capacity buffers have a___
A. Maximum length 0
B. Potentially infinite length
C. Finite length N
D. None of the above
6. Logical memory is broken into fixed sized blocks called _____
A. Frame
B. Pages
C. Page Table
D. Page Map
7. An operating system define as _______
A. Manager or the supervisor of the system
B. Resource allocate
C. Master control program
D. All of the above
8. Process define as _______
A. A process to begin
B. A program in execution
C. A program to update
D. A program in middle
9. Usually the memory is divided into two partitions: one for the operating system and another for the _______
A. Single partition
B. Various user processes
C. Multiple partitions
D. Contiguous memory allocation
10. The process is waiting to be assigned to a processor known as the______
A. Newborn state
B. Ready state
C. Running state
D. Waiting state
11. In the direct communication there are______
A. More then two link associate with the processes
B. A link is associated with exactly two processes
C. Either one or more
D. None of the above
12. Paging is scheme used to avoid the ____ problem
A. Internal Fragmentation
B. External Fragmentation
C. Fragmentation
D. None of above
13. Spooling the name is an acronym for _______
A. Simultaneous peripheral operation on-lining
B. Simultaneous peripheral operation on-line
C. Simultaneously peripheral operation on-line
D. Simultaneously peripheral operation on-lining
14. Which of these is/are states of a process?
A. Waiting
B. Terminated
C. Running
D. All of the above
15. The _______scheduler selects processes from this pool and loads them into memory fro execution.
A. Simple –term
B. Mid Term
C. Long Term
D. Short Term
16. An address generated by the CPU is commonly referred to as a ___
A. Logical Address
B. Physical address
C. Memory Address
D. All of the above
17. The process continues to fault; replacing page for which it will then fault and bring back in right away paging activity is called ___
A. Page-replacement algorithm
B. Thrashing
C. Buffering
D. Back storing
18. The delay between job submission and job completion time is called _________
A. Turnaround time
B. Throughput
C. Seek Time
D. Execution Time
19. Multilevel feedback queues allow processes to moves from _____
A. One queue to another
B. One Process to another
C. Process to Queue
D. All of the above
20. Assuming process execution times are known in advance, for which of the following algorithms can the maximum wait time for a given process be computed at the time the job is submitted?
A. Shortest job first
B. First-come, first-served
C. Priority-based
D. Lottery scheduling
21. In multiprogramming environment, CPU switches from one process to another to achieve multitasking. At that time the process needs to save its state before switching takes place. Such type of process mechanism is known as ____
A. Process Creation
B. Context Switch
C. CPU scheduling
D. Throughput
Section B
Each question carries 2 marks [2x11=22]
Each question carries 2 marks [2x11=22]
22. CPU bound is defines as ______
A. A process that uses more CPU time for doing IO
B. A process that uses more CPU time for doing computation
C. A process that uses equal CPU time for doing IO & computation
D. All of the above
23. Every address generated by the CPU is divided into two parts. They are:
A. Page number & offset
B. Page table & fault
C. Index table & frame
D. Offset address & index address
24. _____solves the external-fragment and size-allocation problems of contagious allocation
A. Index allocation
B. Link Allocation
C. Direct allocation
D. All of the above
25. Physical memory is broken into fixed-sized blocks called ____ and logical memory is also broken into blocks of the same size called _____
A. Frame & Pages
B. Pages & Frame
C. Fragements & Pages
D. Frames & Framgementation
26. The conditions for Deadlock occurrence are ___
A. Circular wait
B. Turnaround time
C. No preemption
D. Hold and wait
E. Mutual exclusion
F. Waiting time
i. 1, 2, 3 and 4
ii. 2, 3, 4.and 5
iii. 3.4.5. and 1
iv. 4, 5, 1 and 2
27. The number of faults occurred when FIF0 page replacement algorithm was used for a given string set:
7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1
A. 10
B. 15
C. 9
D. 12
28. The Function of the dispatcher involves ______
A. Switching Context
B. Switching to user mode
C. Switching to memory location
D. Jumping to the proper location in the user program to restart that program
i. 1, 2, and 3
ii. 2, 3 and 4
iii. 1, 2 and 4
iv. 1, 2, 3 and 4
29. Given the set of input process and their burst requirement what is the average waiting time if SJF algorithm is used for CPU Scheduling?
Process Burst
P1 6
P2 8
P3 7
P4 3
A. 7
B. 9
C. 15
D. 24.5
30. Usually the memory is divided into two partitions: one for the operating system and another for the _______
A. Single partition
B. Multiple partitions
C. Various user processes
D. Contiguous memory allocation
31. External fragmentation exists when enough memory space exists to satisfy a request but it is ______
A. Contiguous
B. Non-contiguous
C. Single partition
D. Multiple partitions
32. Paging is scheme used to avoid the __ problem.
A. International fragmentation
B. Fragmentation
C. External fragmentation
D. None of the above
Section C
Each question carries 4 marks [4x8=32]
33. Segmentation, another memory management scheme, on which logical addresses consists of two tuple. They are _______
A. Subroutine & stack address
B. Symbol table & subroutine address
C. Segment number & offset address
D. None of the above
34. In multiprogramming environment, CPU switches from one process to another to achieve multitasking. At that time the process needs to save its state before switching takes place. Such type of process mechanism is known as _______
A. Process creation
B. CPU scheduling
C. Context switch
D. Throughput
35. Paging is a memory management scheme which avoids the considerable problem of fitting the ___ chunks (blocks) into the backing store, from which most of the previous memory management scheme suffered.
A. Fixed sized memory
B. Vary sized memory
C. Similar sized memory
D. Equal sized memory
36. A process that is holding at least one resource and is waiting to acquire additional resources that are currently being held by other processes is a characteristic of deadlock is known as _______
A. Mutual exclusion
B. No preemption
C. Hold & wait
D. Circular wait
37. In resource allocation graph a directed edge R0P1 is called _______
A. Assignment edge
B. Claim edge
C. Request edge
D. Directed edge
38. If a process moves between the different levels of queue i.e. the process generates the acknowledgement signals to move from one level to another levels is refers a _______
A. Multiple process scheduling
B. Multiprogramming scheduling
C. Multilevel feedback queue scheduling
D. Multilevel queue scheduling
39. In CPU scheduling there is a _______
A. Small number of short CPU bursts and a small number of long CPU bursts
B. Large number of short CPU bursts and a small number of long CPU bursts
C. Large number of short CPU bursts and a large number of long CPU bursts
D. Large number of short CPU bursts and a small number of short CPU bursts
40. When a process creates a new process, two possibilities exist in terms of execution. They are_______
A. The parent continues its execution concurrently with its children.
B. Parents can terminate its execution with out terminating its children.
C. The parent waits until some or all of its children have terminated.
D. All of the above
Section D
Each question carries 5 marks [5x5=25]
41. Explain the operating system with its functions.
42. Write short notes for the followings:
• Time-sharing system
• Real time system
• Spooling
• PCB
• Monitor
43. Explain the process state with the transition diagram.
44. What are the necessary conditions for deadlock? Explain.
45. What is paging? Explain with paging diagram.
0 Comments