PSU Papers for Computer Science

1. Dijkstra's banking algorithm in an operating system solves the problem of -

Ans: Deadlock Avoidance

2. In a paged memory system, if the page size is increased, then the internal
fragmentation generally -
Ans: Becomes more

3. An operating system contains 3 user processes each requiring 2 units of resources R.

The minimum number of units of R such that no deadlock will ever occur is -
Ans: 4

4. Critical region is -
Ans: A set of instructions that access common shared resources which exclude one
another in time

5. Kernel is -
Ans: The set of primitive functions upon which the rest of operating system functions are
built up

6. Necessary conditions for deadlock are -

Ans: Non-preemption and circular wait, Mutual exclusion and partial allocation

7. In a time sharing operating system, when the time slot given to a process is
completed, the process goes from the RUNNING state to the -
Ans: READY state

8. Supervisor call -
Ans: Are privileged calls that are used to perform resource management functions,
which are controlled by the operating system

9. Semaphores are used to solve the problem of -

Ans: Mutual exclusion, Process synchronization

10. If the property of locality of reference is well pronounced in a program-

Ans: The number of page faults will be less

1. The problem of fragmentation arises in

(a) static storage Allocation
(b) stack allocation of storage
(c) stack allocation with dynamic binding
(d) Heap allocation

Ans: (d)

2. The process of organizing the memory into two banks to allow 8 and 16-bit
data operation is called

a. Bank Switching
b. Indexed Mapping
c. Two-way memory interleaving
d. Memory segmentation

Ans: (c)

3. Memory refreshing may be done

a. by the CPU that contains a special regress counter, only

b. by an external refresh controller, only
c. either by the CPU or by an external refresh controller
d. none of the above

Ans: (c)

4. The use of hardware in memory management is through segment relocation

and protection is

a. to perform address translation to reduce size of the memory

b. to perform address translation to reduce execution time overhead
c. both (a) and (b)
d. none of the above

Ans: (c)

5. Thrashing occurs when

a. too much of the time is spent in waiting to swap between memory and disk
b. two processes try to access the same resource
c. the size of the data to be inserted is less than the size of a page in memory
d. the processor's mapping table discovers that the program is trying to use an
address that doesn't currently exist

Ans: (a)