Very Short Answer Type Questions: (PORE KORA ACHE)

1. The ____ must design and program the overlay structure.

2. If one or more devices use a common set of wires to communicate with the computer
system, the connection is called ____
3. __ systems have more than one CPU in close communication with the others.
4. FIFO scheduling is _______
5. A situation where several processes access and manipulate the same data concurrently and
the outcome of the execution depends on the particular order in which access takes place is
called _____
6. A solution to the problem of external fragmentation is _____
7. ____ will happen if a non-recursive mutex Is locked more than once?
8. Each entry in a translation lookaside buffer (TLB) consists of _____
9. On systems where there are multiple operating systems, the decision to load a particular one
is done by _____
10. Trap is a ____
11. ___ are the operations that can be invoked on a condition variable
12. Under multiprogramming, turnaround time lo, short jobs is usually ___ and that for long Jobs
is slightly ___
13. The strategy of making processes that are logically runnable to be temporarily suspended is
called _______
14. An un-interruptible unit is known as_____
15. The ________ swaps processes in and out of memory
16. The hardware mechanism that allows a device to notify the CPU is called _____
17. Operating System acts and ________ between user and hardware
18. ___________ algorithm tends to minimize the process flow time
19. The bounded buffer problem is also known as ________
20. Every address generated by the CPU is divided into two parts. They are ________
21. If the block of free-space list is free then bit will _______
22. ________ operating system that reads and reacts in terms of actual time
23. A process to be executed is selected from the _____ queue by the _____ scheduler
24. _________ will happen if the non-recursive mutex is locked more than once.
25. A thread is a ___________
26. SPOOLING stands for _________
27. Default remedy for starvation is ___________
28. The smallest possible unit of disk storage is _______

29. Round Robin is essentially the preemptive version of ___FIFO_____.

30. The mechanism that brings a page into memory only when it is needed is called __Demand
Paging___
31. Bankers algorithm for resource allocation deals with ____Deadlock Avoidance_____

OS
 The programmer must design and program the overlay structure.

 If one or more devices use a common set of wires to communicate with the computer system,
the connection is called a bus.

 Multiprocessor systems have more than one CPU in close communication with the others.

 FIFO scheduling is non-preemptive.

 A situation where several processes access and manipulate the same data concurrently, and
the outcome of the execution depends on the particular order in which access takes place is
called a race condition.

 A solution to the problem of external fragmentation is compaction.

 Deadlock will happen if a non-recursive mutex is locked more than once.

 Each entry in a translation lookaside buffer (TLB) consists of a page number and frame
number.

 On systems where there are multiple operating systems, the decision to load a particular one
is done by the bootloader.

 Trap is a software-generated interrupt.

 wait and signal are the operations that can be invoked on a condition variable.

 Under multiprogramming, turnaround time for short jobs is usually low, and that for long jobs
is slightly higher.

 The strategy of making processes that are logically runnable to be temporarily suspended is
called process suspension.

 An uninterruptible unit is known as a critical section.

 The swapper or memory manager swaps processes in and out of memory.

 The hardware mechanism that allows a device to notify the CPU is called an interrupt.

 Operating System acts as an interface between user and hardware.

 Shortest Job Next (SJN) algorithm tends to minimize the process flow time.

 The bounded buffer problem is also known as the producer-consumer problem.

 Every address generated by the CPU is divided into two parts. They are page number and page
offset.

 If the block of the free-space list is free, then the bit will be 0.

 Real-time operating system is an operating system that reads and reacts in terms of actual
time.

 A process to be executed is selected from the ready queue by the CPU (short-term) scheduler.
 Deadlock will happen if the non-recursive mutex is locked more than once.

 A thread is a lightweight process.

 SPOOLING stands for Simultaneous Peripheral Operations On-Line.

 The default remedy for starvation is aging.

 The smallest possible unit of disk storage is a sector.

Higher number of _______ in a system may degrade the performance of the system .

Context switches

Which is not a CPU scheduling criteria

Seek time

When a job is selected to be brought in the main memory it is called

Job scheduling

job scheduling is performed by ______ and CPU scheduling is performed by _____

LT scheduler, ST scheduler

when a running processes interrupted and the OS assigns another process for execution it is
known as ____and the time required for it is a____

Context switch. overhead

The cause of transfer from ready to running state is ____and from running to ready state is ___
Scheduler dispatch, interrupt

Disadvantage of semaphore implementation is

Busy waiting

_______can be defined as the IPC mechanisms that notify the exceptional condition and alarms

Signal

In dining philosopher problem, chopstick[5] is the array of

semaphores

Do{

wait(full);

wait(mutex);

………………………………

signal(mutex);

signal(empty);

………

Consume the item in next c

………….

} while(1);

What is the critical section statement ?

a. Add nextp to buffer

b. Add next to buffer

c. Remove an item from buffer to nextc

d. Remove an item from buffer to nextp

Block() system call suspedns the process

Which invokes it

spin lock means

Spinning at entry code while waiting the lock

remedy for busy waiting is

To block the process in the list and awaken it when required

no preemption in deadlock conditions is equivalent to

resources cannot be preempted

bankers algorithm is used for

deadlock avoidance

bankers algorithm is composed of

safety algorithm and resource request algorithm

computational complexity of cycle detection algorithm in RAG is

O(N)

rollback is the substep for resource preemption

available = available - request

allocation = allocation + request

need = need - request

resource request algorithm

the semaphore whose value is zero or one is binary and which takes the value greater than 1 is
counting semaphore

Fixed memory allocation suffers from both (internal, external)??

____ is to load only those pages in the memory that are needed at an instant time of execution

demand paging

three processes P1 p2p3 of sizes 67000, 6500o and 60000 bytes respectively need space in
memory. 3 equal partitions of size 70000 byte is there be any fragmentation how much

Internal, 18000

there is system with 64 pages 512 bytes size and a physical memory of 32 frames how many
bytes are required in the logical and physical address

15, 14

seek time is

Disk scheduling criteria

initial disc head is in cylinder number 23. disc Q with IO request 44, 15,34…. number of disk
head movement using sstf is

37
___ disc scheduling algorithm eliminates unnecessary seek operations and their by increases
average response time

LOOK

________ is the time taken by address sector of the appropriate track to rotate into a position
such that read/write head is accessible to it

Rotational latency

a newly submitted job goes to

Ready q

Table of pointers for interrupt to be executed contains the

the addresses

Main memory of computer system is also called

volatile

initial disc head is in cylinder number 23. disc Q with IO request 54, 97,73…. number of disk
head movement using fcfs is

98

The number of processes completed for unit time is known as

throughput
in a symmetric clustering other machines perform operation file one machine is

hot stand by mode

inter process communication this is the definition for

while(S<=0);

S- -;

Wait

a single thread of control allows the process to perform

only one task at a time

in research allocation graphic cycle is the necessary and sufficient condition for deadlock if
resources are

single instance

Which one of the following cannot be schedule in by the kernel

user level thread

System calls for creating a process and terminating a process are

fork() and exit()

the relocation register helps in

to protect the addresses of processes

when a process is assigned the processor it is allowed to execute up to its completion it is called
dash and if the process is dash

non preemptive, prremptive

the strategy of making processes that logically unable to be temporary suspended is called
preemptive schedule

The real difficulty with SJF in short term scheduling is

knowing the burst time of next request

in multi level feedback scheduling algorithm

a process can move to a different classified ready queue

what is a reusable resource

that can be used by one process at a time and is not depleted by that use

Do{

wait(full)

wait(mutex)

Remove an item from buffer to next c

 Signal (mutex)

signal(empty)

Consume the item in next

} while(1)

Semaphores empty and full are initialized with

n,0