Group A

(Each question carries 1 mark)

1. In _________, the requesting device or devices assert the signal bus request.
Priority encoded arbitration
Distributed arbitration by self-selection
Priority arbitration
Daisy chain arbitration

2. In resource allocation graph a directed edge R0🡪P1 is called _______

Assignment edge
Claim edge
Request edge
Directed edge

3. A sequence of instructions telling the computer what to do is called a______

Program
Language
Translator
Package

4. Initialization of I/O devices is part of the_______.

CPU
MSDOS
UNIX kernel
None of the above

5. A program to be executed must be in _____

Main memory
Secondary memory
Virtual memory
Read only memory

6. _________ are popular way to improve application through parallelism.

Processes
Threads
Context switching
None of these

7. A solution to starvation is ______.

Segmentation
Aging
Paging
Virtual memory

8. Usually the memory is divided into two partitions: one for the operating system and another for
the_______
Single partition
Multiple partitions
Various user processes
Contiguous memory allocation

9. External fragmentation exists when enough memory space exists to satisfy a request but it is _______
Contiguous
Non-contiguous
Single partition
Multiple partitions

10. Paging is scheme used to avoid the _______problem.

International fragmentation
Fragmentation
External fragmentation
None of the above

11. Physical memory is broken into fixed sized blocks called _______
Page fault
Frames
Buffer
Page table

12. Logical memory is broken into blocks of the same size called _______
Page fault
Frames
Pages
Page table

13. Segmentation, another memory management scheme, on which logical addresses consists of two tuple.
They are:
Subroutine & stack address
Symbol table & subroutine address
Segment number & offset address
None of the above

14. A logical address is a collection of _______in segmentation.

Frames
Faults
Segments
Offsets

15. Each entry of the segment table has a _______

Segment address & offset
Segment base & limit
Segment table & base
Segment index & limit

16. CPU scheduler is known as _______

Long term scheduler
Short term scheduler
Medium term scheduler
First term scheduler

17. An operating system defines as _______

Manager or the supervisor of the system
Master control program
Resource allocater
All of the above

18. The main purpose of an operating system is _______

To provide a data
To provide an information
To provide an user interface
To display the result

19. A process is defined as _______

A process to begin
A program in execution
A program to update
A program in middle

20. The different activities of the computer are known as _______

Program
Task/job
Process
All of the above

21. A process includes the _______of the computer.

Program code
Process stacks
Current activities
None of the above

22. The process is waiting to be assigned to a processor known as the _______

Newborn state
Running state
Ready state
Waiting state

23. In unidirectional communication there are_______

One link associate with the process
More then two link associate with the processes
Either one or more
None of the above

24. In bi-directional communication there are_______

One link associate with the process
More then two link associate with the processes
Either one or more
None of the above

25. In the direct communication there are_______

More then two link associate with the processes
A link is associated with exactly two processes
Either one or more
None of the above

26. Instructions are fetches inside a _______for the execution.

Virtual memory
Backup storage
Main memory
Read only memory

27. In the in-direct communication there are_______

More then two link associate with the processes
A link is associated with more then two processes
Either one or more
None of the above

28. SPOOLING is an acronym of _______

Simultaneous peripheral operation on-lining
Simultaneous peripheral operation on-line
Simultaneously peripheral operation on-line
Simultaneously peripheral operation on-lining

29. The state of the process is defined as _______

The past activities of the process
Partly activities of that process
The current activity of that process
Past condition of that process

30. A long term scheduler is known as _______

CPU scheduler
Job scheduler
Medium term scheduler
None of the above

31. The zero capacity buffers have a_______

Maximum length 0
Finite length N
Potentially infinite length
None of the above

32. During the execution time of a process, a _______and the logical address space are same.
Logical address space
Virtual address space
Physical address space
Manual address space

33. A process is ___

Program in main memory
Program in cache memory
Program in secondary storage
Program in execution

34. A ______is a collection of processors that do not share memory, peripheral devices, or a clock.
Computer system
Distributed system
Network
None of the above

35. Approach simplifies debugging and system verification.

Kernel
Layered
Extended
Virtual machine

36. __________ is responsible for allocating primary memory to processes and for assisting the programmer
 in loading and storing the contents of the primary memory.
Operating system
Memory manager
Database administrator
RAM

37. Refers to the technology in which some space in hard disk is used as an ______
Extension of main memory
Cache memory
Paging
Virtual memory
Associative memory

38. Selects a process from among the ready processes to execute on the CPU
CPU Scheduler
Loader
Dispatcher
Compiler

39. The time taken by the Dispatcher to stop one process and start another running is known as
Turnaround time
Dispatch Latency
Access time
Response time

40. When resources have multiple instances ________ is used for deadlock Avoidance.
Banker’s algorithm
Resource Allocation Graph
Semaphores
All of these

Group B
(Each question carries 2 marks)

41. CPU utilization for lightly loaded system is________ percentages.

40
90
50
60

42. The ________scheduler selects processes from this pool and loads them into memory fro execution.
Simple –term
Mid Term
Long Term
Short Term

43. A logical Address is a collection of __________in segmentation.

Frame
Segments
Faults
Offsets

44. Logical memory is broken into fixed sized blocks called _____
Frame
Pages
Page Table
Page Map

45. ________ solves the external-fragment and size-allocation problems of contagious allocation.
Index allocation
Link Allocation
Direct allocation
All of the above

46. The best reason to use semaphores rather than busy-waiting in a user-level program is:
Decreases the chance of deadlock
Decreases the chance of lovelock
Allows more different types of synchronization to be coded
Avoids wasted processor cycles

47. 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 _______
Process creation
CPU scheduling
Context switch
Throughput

48. CPU bound is defines as _______

A process that uses more CPU time for doing IO
A process that uses more CPU time for doing computation
A process that uses equal CPU time for doing IO & computation
All of the above

49. 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.
Fixed sized memory
Vary sized memory
Similar sized memory
Equal sized memory

50. Every address generated by the CPU is divided into two parts. They are:
Page number & offset
Page table & fault
Index table & frame
Offset address & index address

51. _______ is a situation in which two computer programs sharing the same resource are effectively
preventing each other from accessing the resource, resulting in both programs ceasing to function.
Semaphore
Deadlock
Mutual Exclusion
No preemption

52. The controller can access memory in memory cycles which are not used by the particular bank of
memory into which the DMA controller is writing data. This approach, called _______
Interrupting
Cycle stealing
Swapping
Paging

53. 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 _______
Mutual exclusion
No preemption
Hold & wait
Circular wait

54. A state is unsafe if the system _______

Can allocate necessary resources to each process
Can't allocate necessary resources to each process
May allocate necessary resources to each process
All of the above

55. 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 _______
Multiple process scheduling
Multiprogramming scheduling
Multilevel feedback queue scheduling
Multilevel queue scheduling

56. Throughput is a _______

An interval from the job submission & completion
A unit of time spends waiting in the ready queue
A unit of time to start responding / executing
A unit of time on which how many processes is completed

57. A time sharing operating system _______

Allows the single user to share the computer simultaneously
Allows the many users to share the computer simultaneously
Allows the many users not to share the computer simultaneously
Allows the many users to share the resources simultaneously

58. In CPU scheduling there is a _______

Small number of short CPU bursts and a small number of long CPU bursts
Large number of short CPU bursts and a small number of long CPU bursts
Large number of short CPU bursts and a large number of long CPU bursts
Large number of short CPU bursts and a small number of short CPU bursts

59. Dekker’s algorithm is the _______

Software solution to the mutual exclusion
Hardware solution to the mutual exclusion
Software solution to the un-mutual exclusion
Software solution to the producer, consumer relationship

60. When a process creates a new process, two possibilities exist in terms of execution. They are:
The parent continues its execution concurrently with its children.
Parents can terminate its execution with out terminating its children.
The parent waits until some or all of its children have terminated.
All of the above
Part C (Four mark questions)

61. The condition for Deadlock occurrence are

1. Circular wait
2. Turnaround time
3. No preemption
4. Hold and wait
5. Mutual exclusion
6. Waiting time

1. 1, 2, 3 and 4
2. 2, 3, 4.and 5
3. 3.4.5. And 1
4. 4, 5, 1 and 2

62. The number of faults occurred when FIF0 page replacement algorithm was used for a given string set
Reference string: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1
Page frame: 3
10
15
9
12

63. The Function of the dispatcher involves:

1. Switching Context
2. Switching to user mode
3. Switching to memory location
4. Jumping to the proper location in the user program to restart that program

A) 1, 2, and 3
B) 2, 3 and 4
C) 1,2 and 4
D) 1, 2, 3 and 4

64. 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
7
9
15
24.5

65. How can a semaphore s be used to solve the critical-section problem?

Initialize s to 0; enter section after waiting on s; exit after signaling on s.
Initialize s to 1; enter section after waiting on s; exit after signaling on s.
Initialize s to 0; enter section after signaling on s; exit after waiting on s.
Initialize s to 1; enter section after signaling on s; exit after waiting on s.
66. Match the following
Set A:
1. Operating system
2. Library system
3. Secondary storage
4. Main memory

Set B:
I). Application software
Ii) system software
Iii) smaller capacity
V) larger capacity

Ii, 2-i, 3-iv, 4-iii

Iv, 2-ii, 3-I, 4-iii
Ii, 2-i, 3-iii, 4-iv
Iv, 2-I, 3-ii, 4-iii

67. Which of these is a reason for using threads in designing operating systems?
Unlike processes, threads are not independent of one another
All threads can access every address in the task.
Because threads can share common data, they do not need to use inter-process communication.
Like processes, thread can create children.

68. The introduction of mutual exclusion can prevent race conditions but can lead to problems such as__
Deadlock
Starvation
Both a) and b)
None of these

69. Match the following:

Set A:
1. Programmed controlled I/O
2. Interrupt controlled I/O
3. DMA

Set B:
I. Polled I/O
Ii. Cycle stealing
Iii. Maskable and non maskable

I, 2-iii, 3-ii
Ii, 2-iii, 3-i
Iii, 2-ii, 3-i
1-i , 2-ii , 3-iii

70. Match the following:

Set A:
A) kernel
B) Operating system
C) Unix commands
D) Novell

Set B:
I) Switches between processes
Ii) Initialization of I/O devices
Iii) Sells unixware
Iv) Case sensitive

Iv, b-ii, c-iii, d-i

Ii, b-i, c-iv, d-iii
Iii, b-i, c-ii ,d-iv
I, b-iii, c-iv, d-ii

71. Match the following:

Set A:
A) A named pipe
B) renice command
C) child process
D) semaphore

Set B:
I. FIFO
Ii. A resource that contains an integer value
Iii. Change the priority of a process,
Iv. Zombie

Iv, b-ii, c-iii, d-I

Ii, b-i, c-iv, d-iii
Iii, b-i, c-ii ,d-iv
I, b-iii, c-iv, d-ii

72. Match the following:

Set A:
1. New, Ready Running, Wait
2. Indicate next instruction of process
3. Process priority, queue
4. Time limit accounts number and process number

Set B:
A) Accounting information
B) Process State
C) CPU scheduling
D) Program counter

1-a, 2-b, 3-c, 4-d

1-b, 2-d, 3-a, 4-c
1-a, 2-b, 3-c, 4-d
1-b, 2-d, 3-c, 4-a

73. PCB contains;

a. Process no
b. Registers
c. Program counter
d. Program state
e. Protection system
f. Networking
I) a,b,e,f
Ii) a,b,c,d,
Iii) c,d,e,f

74. Several reasons for providing an environment that allows process co-operation are;
System call
Semaphores
Information Sharing
Computation Speed-up
Modularity
Convenience

A,d,e,f
B,c,d,e
C,d,e,f
A,b,e,f

75. Following are the scheduling criteria;

Dispatcher
CPU utilization
Deadlock
Throughput
Waiting time
Response time

C,d,e,f
A,b,e,f
B,c,d,e
A,b,d,e
Group D
Answer the following questions (any five)
(Each question carries 6 marks)
76. Write short notes for the followings:
● Time-sharing system
● Real time system
● Spooling
77. What are the necessary conditions for deadlock? Explain.
78. What is Semaphore? Explain with synchronization problem.
79. Explain the followings:
● Scheduling criteria
● PCB
● SJF
80. Discuss the page replace algorithm with suitable examples.
81. Differentiate the logical vs. Physical address space.
82. Explain the followings:
● Contiguous allocation
● Segmentation
● Demand paging
83. Discuss First Come First Served scheduling algorithm.
84. Explain the process with the transition diagram.
85. Explain the operating system with its functions.

Best of luck