Group A
(Each question carries 1 mark)
(Each question carries 1 mark)
1. Usually the memory is divided into two partitions: one for the operating system and another for the....
i. Single partition
ii. Multiple partitions
iii. Various user processes
iv. Contiguous memory allocation
2. External fragmentation exists when enough memory space exists to satisfy a request but it is ……..
i. Contiguous
ii. Non-contiguous
iii. Single partition
iv. Multiple partitions
3. Paging is scheme used to avoid the …………problem.
i. International fragmentation
ii. Fragmentation
iii. External fragmentation
iv. None of the above
4. Physical memory is broken into fixed sized blocks called ………..
i. Page fault
ii. Frames
iii. Buffer
iv. Page table
5. Logical memory is broken into blocks of the same size called ……….
i. Page fault
ii. Frames
iii. Pages
iv. Page table
6. Segmentation, another memory management scheme, on which logical addresses consists of two tuple. They are:
i. Subroutine & stack address
ii. Symbol table & subroutine address
iii. Segment number & offset address
iv. None of the above
7. A logical address is a collection of …………… in segmentation.
i. Frames
ii. Faults
iii. Segments
iv. Offsets
8. Each entry of the segment table has a ………
i. Segment address & offset
ii. Segment base & limit
iii. Segment table & base
iv. Segment index & limit
9. CPU scheduler is known as …………
i. Long term scheduler
ii. Short term scheduler
iii. Medium term scheduler
iv. First term scheduler
10. An operating system defines as
i. Manager or the supervisor of the system
ii. Master control program
iii. Resource allocater
iv. All of the above
11. The main purpose of an operating system is
i. To provide a data
ii. To provide an information
iii. To provide an user interface
iv. To display the result
12. A process is defined as ……………..
i. A process to begin
ii. A program in execution
iii. A program to update
iv. A program in middle
13. The different activities of the computer are known as ………..
i. Program
ii. Task/job
iii. Process
iv. All of the above
14. A process includes the ………. of the computer.
i. Program code
ii. Process stacks
iii. Current activities
iv. None of the above
15. The process is waiting to be assigned to a processor known as the …………
i. Newborn state
ii. Running state
iii. Ready state
iv. Waiting state
16. In unidirectional communication there are……………
i. One link associate with the process
ii. More then two link associate with the processes
iii. Either one or more
iv. None of the above
17. In bi-directional communication there are……………
i. One link associate with the process
ii. More then two link associate with the processes
iii. Either one or more
iv. None of the above
18. In the direct communication there are……………
i. More then two link associate with the processes
ii. A link is associated with exactly two processes
iii. Either one or more
iv. None of the above
19. Instructions are fetches inside a ………… for the execution.
i. Virtual memory
ii. Backup storage
iii. Main memory
iv. Read only memory
20. In the in-direct communication there are……………
i. More then two link associate with the processes
ii. A link is associated with more then two processes
iii. Either one or more
iv. None of the above
Group B
(Each question carries 2 marks)
21. SPOOLING is an acronym of ………….
i. Simultaneous peripheral operation on-lining
ii. Simultaneous peripheral operation on-line
iii. Simultaneously peripheral operation on-line
iv. Simultaneously peripheral operation on-lining
22. The state of the process is defined as …………..
i. The past activities of the process
ii. Partly activities of that process
iii. The current activity of that process
iv. Past condition of that process
23. A long term scheduler is known as ………..
i. CPU scheduler
ii. Job scheduler
iii. Medium term scheduler
iv. None of the above
24. 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 …………
i. Process creation
ii. CPU scheduling
iii. Context switch
iv. Throughput
25. CPU bound is defines as ……………
i. A process that uses more CPU time for doing IO
ii. A process that uses more CPU time for doing computation
iii. A process that uses equal CPU time for doing IO & computation
iv. All of the above
26. The zero capacity buffers have a………..
i. Maximum length 0
ii. Finite length N
iii. Potentially infinite length
iv. None of the above
27. During the execution time of a process, a …………… and the logical address space are same.
i. Logical address space
ii. Virtual address space
iii. Physical address space
iv. Manual address space
28. 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.
i. Fixed sized memory
ii. Vary sized memory
iii. Similar sized memory
iv. Equal sized memory
29. Every address generated by the CPU is divided into two parts. They are:
i. Page number & offset
ii. Page table & fault
iii. Index table & frame
iv. Offset address & index address
Group C
(Each question carries 4 marks)
30. 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 ………
i. Mutual exclusion
ii. No preemption
iii. Hold & wait
iv. Circular wait
31. In resource allocation graph a directed edge R0 P1 is called ………
i. Assignment edge
ii. Claim edge
iii. Request edge
iv. Directed edge
32. A state is unsafe if the system ………….
i. Can allocate necessary resources to each process
ii. Can't allocate necessary resources to each process
iii. May allocate necessary resources to each process
iv. All of the above
33. 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 …………….
i. Multiple process scheduling
ii. Multiprogramming scheduling
iii. Multilevel feedback queue scheduling
iv. Multilevel queue scheduling
34. Throughput is a ………..
i. An interval from the job submission & completion
ii. A unit of time spends waiting in the ready queue
iii. A unit of time to start responding / executing
iv. A unit of time on which how many processes is completed
35. A time sharing operating system …………
i. Allows the single user to share the computer simultaneously
ii. Allows the many users to share the computer simultaneously
iii. Allows the many users not to share the computer simultaneously
iv. Allows the many users to share the resources simultaneously
36. In CPU scheduling there is a ……….
i. Small number of short CPU bursts and a small number of long CPU bursts
ii. Large number of short CPU bursts and a small number of long CPU bursts
iii. Large number of short CPU bursts and a large number of long CPU bursts
iv. Large number of short CPU bursts and a small number of short CPU bursts
37. Dekker’s algorithm is the ……..
i. Software solution to the mutual exclusion
ii. Hardware solution to the mutual exclusion
iii. Software solution to the un-mutual exclusion
iv. Software solution to the producer, consumer relationship
38. When a process creates a new process, two possibilities exist in terms of execution. They are:
i. The parent continues its execution concurrently with its children.
ii. Parents can terminate its execution with out terminating its children.
iii. The parent waits until some or all of its children have terminated.
iv. All of the above
Group D
Answer the following questions (any five)
(Each question carries 6 marks)
39. a). Explain the operating system with its functions.
b). What do you mean by System Calls?
40. Write short notes for the followings:
i. Time-sharing system
ii. Real time system
iii. Spooling a). Explain the process with the transition diagram.
b). Explain the different levels of scheduling.
41. Explain the followings:
i. Scheduling criteria
ii. PCB
iii. FCFS a). What are the necessary conditions for deadlock? Explain.
b). What is Semaphore? Explain with synchronization problem.
42. Write short notes for the followings:
i. Monitor
ii. Deadlock recovery
iii. System model a). Discuss the page replace algorithm with suitable examples.
b). Differentiate the logical vs. physical address space.
43. Explain the followings:
• Contiguous allocation
• Segmentation
• Demand paging
0 Comments