Scribd
Upload
45 views7 pages

Os Viva Questions

Os viva qstions

Uploaded by

saabith786786
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
45 views7 pages

Os Viva Questions

Os viva qstions

Uploaded by

saabith786786
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

WWW.VIDYARTHIPLUS.

COM

VIVA QUESTIONS

1.What is an operating system?

An operating system is a program that acts as an intermediary


between the user and the computer hardware. The purpose of an OS
is to provide a convenient environment in which user can execute
programs in a convenient and efficient manner.

2.What are the different operating systems?

1. Batched operating systems


2. Multi-programmed operating systems
3. timesharing operating systems
4. Distributed operating systems
5. Real-time operating systems

6.What is a boot-strap program?

Bootstrapping is a technique by which a simple computer program activates


a more complicated system of programs.

7.What is BIOS?

A BIOS is software that is put on computers which allows the


user to configure the input and output of a computer.

8.What is SCSI?

Small computer systems interface.

.What is a sector?

Smallest addressable portion of a disk.

17.What is cache-coherency?

In a multiprocessor system there exist several caches each may


containing a copy of same variable A. Then a change in one cache
should immediately be reflected in all other caches this process
of maintaining the same value of a data in all the caches s
called cache-coherency.

WWW.VIDYARTHIPLUS.COM V+ TEAM
WWW.VIDYARTHIPLUS.COM

18.What are residence monitors?

Early operating systems were called residence monitors.

19.What is dual-mode operation?

In order to protect the operating systems and the system


programs from the malfunctioning programs the two mode
operations were evolved:
1. System mode.
2. User mode.
Here the user programs cannot directly interact with the system
resources, instead they request the operating system which
checks the request and does the required task for the user
programs-DOS was written for / intel 8088 and has no dual-mode.
Pentium provides dual-mode operation.

What are system calls?

System calls provide the interface between a process and the


operating system.

What is a layered approach and what is its advantage?

Layered approach is a step towards modularizing of the system,


in which the operating system is broken up into a number of
layers (or levels), each built on top of lower layer. The bottom
layer is the hard ware and the top most is the user interface.

What are a virtual machines and site their advantages?

It is the concept by which an operating system can create an


illusion that a process has its own processor with its own
(virtual) memory.

What is a process?

A program in execution is called a process.

What are the states of a process?

1. New
2. Running
3. Waiting
4. Ready
5. Terminated

WWW.VIDYARTHIPLUS.COM V+ TEAM
WWW.VIDYARTHIPLUS.COM

What are various scheduling queues?

1. Job queue
2. Ready queue
3. Device queue

What is a job queue?

When a process enters the system it is placed in the job queue.

What is a ready queue?

The processes that are residing in the main memory and are ready
and waiting to execute are kept on a list called the ready queue.

What is a device queue?

A list of processes waiting for a particular I/O device is


called device queue.

What is a long term scheduler?

Long term schedulers are the job schedulers that select processes from
the job queue and load them into memory for execution.

What are short term scheduler?

The short term schedulers are the CPU schedulers that select a process
form the ready queue and allocate the CPU to one of them.

What is context switching?

Transferring the control from one process to other process


requires saving the state of the old process and loading the
saved state for new process.

What is a thread?

A thread is a program line under execution. Thread sometimes


called a light-weight process, is a basic unit of CPU
utilization.

What are types of threads?

1. User thread
2. Kernel thread

WWW.VIDYARTHIPLUS.COM V+ TEAM
WWW.VIDYARTHIPLUS.COM

User threads are easy to create and are created in user space.Kernel
threads are supported directly by the operating system.

What are multithreading models?


Many-to-one model

One-to-one model

Many-to –many

What is process synchronization?

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 the access takes place, is
called race condition. To guard against the race condition we
need to ensure that only one process at a time can be
manipulating the same data. The technique we use for this is
called process synchronization.

44.What is critical section problem?

Critical section is the code segment of a process in which the


process may be changing common variables, updating tables,
writing a file and so on. Only one process is allowed to go into
critical section at any given time (mutually exclusive). The
three basic requirements of critical section are:
1. Mutual exclusion
2. Progress
3. bounded waiting

45.What is a semaphore?

A semaphore is an integer variable that, apart from


initialization, is accessed only through two standard atomic
operations: Wait and Signal.

What is dining philosophers’ problem?

Consider 5 philosophers who spend their lives thinking and


eating. The philosophers share a common circular table
surrounded by 5 chairs, each belonging to one philosopher. In
the center of the table is a bowl of rice, and the table is laid
with five single chop sticks. When a philosopher thinks, she
doesn’t interact with her colleagues.
From time to time, a philosopher gets hungry and tries to pick

WWW.VIDYARTHIPLUS.COM V+ TEAM
WWW.VIDYARTHIPLUS.COM

up two chop sticks that are closest to her .A philosopher may


pick up only one chop stick at a time. Obviously she can’t pick
the stick in some others hand. When a hungry philosopher has
both her chopsticks at the same time, she eats without releasing
her chopsticks. When she is finished eating, she puts down both
of her chopsticks and start thinking again.

49.What is a deadlock?

51.What is resource allocation graph?

This is the graphical description of deadlocks. This graph consists


of a set of edges E and a set of vertices V. The set of vertices V
is partitioned into two different types of nodes P={p1,p2,…,pn},
the set consisting of all the resources in the system,
R={r1,r2,…rn}.A directed edge Pi?Rj is called a request edge; a
directed edge Rj?
Pi is called an assignment edge. Pictorially we represent a process
Pi as a circle, and each resource type Rj as square.

52.What are deadlock prevention techniques?

1. Mutual exclusion : Some resources such as read only files


shouldn’t be mutually
exclusive. They should be sharable. But some resources such as
printers must be
mutually exclusive.
2. Hold and wait : To avoid this condition we have to ensure
that if a process is
requesting for a resource it should not hold any resources.
3. No preemption : If a process is holding some resources and
requests another
resource that cannot be immediately allocated to it (that is the
process must wait),
then all the resources currently being held are
preempted(released autonomously).
4. Circular wait : the way to ensure that this condition never
holds is to impose a
total ordering of all the resource types, and to require that
each process requests
resources in an increasing order of enumeration.

53.What is a safe state and a safe sequence?

A system is in safe state only if there exists a safe sequence.


A sequence of processes is a safe sequence for the current
WWW.VIDYARTHIPLUS.COM V+ TEAM
WWW.VIDYARTHIPLUS.COM

allocation state if, for each Pi, the resources that the Pi can
still request can be satisfied by the currently available
resources plus the resources held by all the Pj, with j.

Explain briefly about, processor, assembler, compiler, loader, linker


and the functions executed by them.

What is virtual memory?

A virtual memory is hardware technique where the system appears


to have more memory that it actually does.

What is cache memory?

What is CPU Scheduler?

Selects from among the processes in memory that are ready to execute,
and allocates the CPU to one of them.

What is Throughput, Turnaround time, waiting time and Response time?

Throughput – number of processes that complete their execution per


time unit.
Turnaround time – amount of time to execute a particular process
Waiting time – amount of time a process has been waiting in the ready
queue.
Response time – amount of time it takes from when a request was
submitted until the first response is produced, not output.

What is starvation and aging?

Starvation: Starvation is a resource management problem where a


process does not get the resources it needs for a long time because
the resources are being allocated to other processes.
Aging: Aging is a technique to avoid starvation.

WWW.VIDYARTHIPLUS.COM V+ TEAM
WWW.VIDYARTHIPLUS.COM

WWW.VIDYARTHIPLUS.COM V+ TEAM

You might also like