Address seen by the memory unit is commonly

Address generated by the CPU is commonly referred referred to as

to as a

* Physical Address
* Logical Address

The run-time mapping from virtual to physical address User program never sees the real physical address
is done by the
True
False
* MMU (Memory Management Unit)
* True

The variant of swapping is sometime called roll out, The interrupt vector is often in the low memory or
roll in high memory

True
False * Low Memory

* True

The degree of multiprogramming is bound by the The page of times that a page number is found in the
member of partitions associative register is called what?

True * Hit Ratio

False

* True
Associative registers are also known as Swapping can also be combined with

* Translation Look Aside Buffer * Compaction

The request and release of resources are through Not all useful states are deadlocks
system calls
True
True False
False
* True
* True

UNIX is one those Operating Systems (OS) that If all resources have only a single instance, then we
initially was limited by Hardware functionality can define a deadlock detection algorithm that uses a
varient of the resources allocation graph called what
True
False * wait for graph

* True

Name the two ways by which we can remove What is resource preemption?
deadlocks.
* in resource preemption, we successively
preempt some resources from processes and
* Process Termination and give these resources to other processes until
Resource Preemption the deadlock cycle is broken.
Associative registers are also known as Swapping can also be combined with

* Translation Look Aside Buffer * Compaction

The request and release of resources are through Not all useful states are deadlocks
system calls
True
True False
False
* True
* True

UNIX is one those Operating Systems (OS) that If all resources have only a single instance, then we
initially was limited by Hardware functionality can define a deadlock detection algorithm that uses a
varient of the resources allocation graph called what
True
False * Wait for graph

* True

Name the two ways by which we can remove What is resource preemption?
deadlocks.
* in resource preemption, we successively
preempt some resources from processes and
* Process Termination and give these resources to other processes until
Resource Preemption the deadlock cycle is broken.
What are the three issues that must be considered What are four necessary conditions that must hold
when using resource preemption to deal with simultaneously to create a deadlock?
deadlocks?

* Mutual Exclusion
* selecting a victim Hold and wait
Roll back and No Preemption and
Starvation Circular wait

In the OS (Operating System) each process is Name any two functions of a dispatch
represented by?

* Switching Content
* Process Control Block (PCB) Switching to user mode
Jumping to the proper location in the user
program to restart that program

The time it takes for the dispatcher to stop one process LIFO stands for
and start another running is known as:
* Last In First Out

* Dispatch Latency

The number of processes that are completed per time Response time is the amount of time it takes to output
is called that response and not the time it takes to start
responding

* Throughput True
False

* False
The simplest CPU scheduling algorithm is: The sum of periods spent waiting in the Ready Queue
Is known as:

* FCFS (First Come First Serve)

* Waiting Time

The SJF scheduling algorithm is provably optimal SJF stands for

True
False * Shortest Job First Scheduling

* True

SJF algorithm is a special case of the general priority SJF algorithm can not be preemptive
scheduling
True
True False
False
* False
* True

SJF preemptive scheduling is sometimes called RR scheduling stands for

* Round Robin Scheduling

* Shortest Remaining Time First Scheduling
In RR scheduling algorithm, the average waiting time Time Quantum is also known as
is often quite long

True * Time Slice

False

* True

A time quantum is generally from 10 to 100 seconds The performance of RR algorithm depends heavily on
the
True
False
* Size of time quantum
* False

What happens in a multi level queue-scheduling Every thing below the system call interface and above
algorithm? the physical hardware is

* Processes are permanently assigned to a queue * Kernal

on entry to the system.

The main advantage of layered approach is Modularity A major difficulty with virtual machine approach
involves disk system
True
False True
False
* True
* True
The virtual machine software can run in monitor mode The virtual machine itself can only run in which of the
following
True
False
Monitor mode
* True User Mode

* User Mode only

Name any three major categories of system calls A disk that contains a boot partition is called

* Process Control * Boot disk or system disk

File Manipulation
Device Manipulation
Information Maintenance and
Communication

MFD stands for

* Master File Directory

 MBR stands for GRUB stand for

* Master boot record * Grand Unified boot loader

Q. Difference between ISR (Interrupt service routine)

and normal routine PIC stands for

* Programmable interrupt controller

* Interrupt service routine end with “interrupt
return” whereas normal routines and procedures end
with “Return” or “far return”.

MULTICS stands for

NTFS stand for ?
*Multiplexed information and computing
services.
* New technology file system

What is Race Condition?

CMS stands for * when two or more process are reading or

writing some shared data and final results depend on
* Conversational monitor system who runs precisely
 the program which gather information about a
particular configuration of hardware for the
Tight coupled system share --------------- and ----------- installation of OS is called as ---------------

* memory
* clock * SYSGEN

Name the software generated interrupt for the purpose Electronic disk are faster than magnetic disk
of requesting OS for a various services.

* trap * true

what is the other name of Control card interrupter Language defined to replace assembly language for
system program allow system call to be made directly
other than “C” or “C++”
* command line interrupter or shell

* Bliss, PL/360

Three methods for passing parameter between a

running program and the OS IPC is faster than message passing

* * False
1) Pass parameter in a register
2) Store the parameter in a table in memory;
and the address is passes as a parameter in
a register.
3) Push the parameter into the stack by the
program, and pop off the stack by the OS.
 Give the name of the three algorithms that are used for
it is possible to combine all the holes into one big by page replacement.
moving all the process downward as for as possible.
This technique is known as----------------
*
1) Not recently used page replacement
* Memory Compaction algorithm
2) FIFO (first in first out)
3) Second chance page replacement algorithm
Clock page replacement algorithm
Least recently used page replacement algorithm

Give the name of the device that is not character based

In Unix, file name are case sensitive and not block based

*Clock
*true

Skipping blocks to give the controller time to transfer UART stands for
data to memory is called what * Universal Asynchronous Receiver Transmitter

*Interleaving

In asymmetric multiprocessing, each processor runs an

Spooling is overlapping of i/o of one job with identical copy of the OS
computation of another job * False

* false
 Short term scheduler also known as
What is the other name of Long term scheduler
* CPU scheduler
* Job scheduler

SFS stands for

RPC stands for
* Remote procedures call * self certifying file system

What is the Difference between Asymmetric

clustering and Symmetric clustering what should be done to to prevent race condition --

* Asymmetric Clustering: *concurrent process must be Synchronized

One server runs the application while other server
stand by.

Symmetric Clustering:
All N hosts are running the application.

IPC facilitates two type of operation. What are those? What does HPFS stands for

* Send message
Receive message * High performance file system
Non-blocking message passing is also known as Swap space can be managed through separate disk
partition.

* Asynchronous * true

SM stands for MSMQ stands for

* hierarchical storage management * Microsoft message Queue server

COW stands for

EAT stands for

* copy on write
* Effective address time

What is thrashing Data migration and computation migration are same

*a process is a busy swapping page in and out.

* False
 SPT stands for
Linux standards based on which OS standard
* swap page time
* Unix standard

What is signal handler table?

Linux used fork system call to create new process
* defines the routines in the process address space to
* true be called when space signal arrive.

Fork and Clone system call perform the same

funcation In Linux, normal kernel code is preempt able

* false * false

the information that the scheduler needs to suspend

GPL stands for and restart the process is ----------

* General Public license * scheduling context

ELF and A. out are not the binary format Directory are system files

* false
* True

The rate at which page are scanned is called -------- System commander is boot menu or boot loader.

* scan rate * boot menu

FFS stands for BeOS is an operating system designed for what ?

*For digital media applications and Internet

* Fast file system. appliances

An invalid page fault is also called considerd an error

what is the name of this error
The set of all legal addresses in memory for a given
application is called what  a page fault error (PFE).

Address space
Do u agree with the statement that DOS (disk
operating system) does not provide Virtual memory paging, in which the operating system attempts to
anticipate which data will be needed next
* Yes
* Anticipatory paging

the hardware component that manages virtual memory Whats Cat-5

systems
 describes network cabling that consists of four
 memory management unit (MMU) twisted pairs