TWO MARKS

1. OPERATING SYSTEM:

Operating system is the combination of process memory, devices and file management. It
helps us to interface between the user and it works as a resource allocator, virtual machine,
bootstrap loader, kernel, multiprogramming, multi tasking and time sharing. They are different
types of operating systems available such as Linux, MS DOS, Windows, Mac etc....

2. PROCESS:

In OS for every process a process table (process block) in that it will note all the steps of
processing of particular method.

• Current state of process is called as Process state.

• Even we can create process with another process, it is called as Child process.

• Interprocess communication is a process to communicate one process to another process.

3. SHELL:

Shell act as a command interpreter in a main memory, it is a small program. Instant of

making entire program in the Mani memory Shell is used. By reading this program (shell), OS
will start the process.

4. BOOTSTRAP PROGRAM:

For a computer to start running for instance, when it is powered on or rebooted – it need
to have initial program to run which program is known as bootstrap program. It is store in ROM
or EEPROM, it initializes all aspects of the system from CPU registers to device controllers to
memory contents.

5. MEMORY MANAGEMENT:

Memory management is that physical memory is shared by OS. Allocation and

reallocation of the memory for the process occurs in memory management. The concept of a
logical address pace that is bound to a separate physical address space is central to proper
memory management.

6. LOGICAL ADDRESS:

Once a CPU is started, it will generate address for every statement or instruction it is
known as logical address space, it is also called as virtual address.

7. PHYSICAL ADDRESS:

It is a secondary storage device, this address seen by the memory unit. The entire
program is stored inside the physical address.

8. MAIN MEMORY:

 Main memory is usually too small to store all needed programs and data
permanently.

 Main memory is a volatile storage device that loses its contents when
power is turned off or otherwise lost.
 9. DUAL MODE OPERATION:

In order to maintain the proper execution of the operation system, we must be able to
distinguish between the executing of operating system code and user defined code. For this we
need two separate modes for the operation: 1.user mode, 2.kernal node. A bit called mode bit is
added to the hardware to distinguish between them.

10. KERNAL MODE:

Kernal mode is executed on behalf of the operating system. At system boot hardware
starts in kernel mode. Whenever trap or interrupt occurs hardware switches from user mode to
kernel mode. It is also called as supervisor mode, system mode or privileged mode. Its job is to
allocate resources in virtual machine.

11. KERNAL (OR) MICRO KERNAL (OR) EXO KERNAL:

Kernal is heart of the OS, and it is a small code segment. It is always in the main
memory instead of dumping entire OS in the main memory…it is used to run user of program.

12. VIRTUAL MACHINE:

The physical computer shares the resources to create the virtual machine. Each process
with a(virtual) copy of the underlying computer(base hardware) . User can run any of the
software packages that are available on the underlying machine.

13. MULTI PROGRAMMING:

 Multi programming is that it can operate more than one process in a single OS. It is
positioned at the 0th layer , that is base of the OS.

14. I/O MANAGEMENT:

It deals with input, output devices and buffering the information streams to and from
them. It take care of the all the I/O operations of the OS.

15. THREADS:

It allow the process to do only one job is called Thread. The process model discussed
so far has implied that is a program that performs single Thread.

Eg: Word processor program, in this process it is a single thread. A user typing the
character & doing spell check is called Multi thread.

16. INTTERUPT VECTOR:

It is a set of program to create interrupt during the execution of the program.

17. PROCESS SCHEDULER (OR) SCHEDULING:

Scheduling is a kind of fundamental operating system function. It enables the process to

wait till the existed process to finish in CPU. During execution it shifts one process to another
process. In this we have Scheduling queue, Ready queue, Device queue.

18. SCHEDULING QUEUE:

Scheduling queue (or) Job queue (or) process queue consists of all the process in the
system which is going to execute.

19. READY QUEUE:

 Ready queue in which process that are reserved in main memory or ready and waiting
to execute or kept on the list.

20. DEVICE QUEUE:

Device queue in which process which are waiting for the I/O operations are queued.

21. SCHEDULERS:

A process migrates between the various scheduling queues throughout its life time. OS
must select for a scheduling processor from these queues. During execution it shifts one process
& queue to another.

22. TYPES OF SCHEDULERS:

• Long term schedulers:

Selects processor from the pool and loads them into the memory for execution.

• Mid-term schedulers:

Selects among the processors which are ready, and allocates CPU to one of them.

• Short term schedulers:

The mid-term scheduler temporarily removes processes from main memory and
places them on secondary memory (such as a disk drive) or vice versa. This is commonly
referred to as "swapping out" or "swapping in".

23. INTER PROCESS COMMUNICATION (IPC):

 It is the way of communication between one process to another. Each and every
process has its own ID using that we can easily communicate from one process to another. They
are two types of process Independent and Co operation.

24. ADVANTAGES OF IPC:

 Information sharing.

 To increase the process speed up.

 Modularity concept.

 For convenience.

25. TYPES OF IPC:

• INDEPENDENT PROCESS:

It can individually perform its actions.

• CO OPERATION PROCESS:

It depends on another process to complete.

26. TYPES OF COMMUNICATION METHODS:

• Direct or Indirect communication.

• Symmetric or Asymmetric communication.

 • Buffering communication.

• Sending by copy or reference.

27. RACE CONDITION:

Race section, a situation where several process access and manipulate the same data
concurrently and the outcome of the execution depends on the particular order in which the
access take place is called as Race condition.

28. CRITICAL SECTION:

A common process like output can be accessed by another process. These common
process are put in a particular section, it is known as critical section. Otherwise each process has
segment of section called critical section Only one process can access during the critical section.

Structure of critical section:

Do

Entry section
CRITICAL SECTION

Exit section

Remainder section

While (1)
 29. THREE REQUIREMENT FOR CRITICAL SECTION PROBLEM:

• Mutual exclusions.

• Progress exclusions.

• Bounded waiting.

30. MUTUAL EXCLUSION:

If process P1 is executing in its critical section, then no other processes can be executing
in their critical section.

31. PROGRESS EXCLUSION:

Once the process P1 is reached its remainder section after executed in critical
section, then they won’t allow to re-enter the critical section.

32. BOUNDED WAITING:

There is allot or limit or on number of times that other processes are allowed to re-
enter the critical section, when that particular time exceeds it will post-pond that process.

33. SEMAPHORE:

It is an synchronization tool or is an integer variable that apart from initialization,

is accessed through two standard optimize operations.

The two operations are:

 • Wait –sleep(s).

• Signal –awake.

34. TWO OPERATIONS OF SEMAPHORE:

• WAIT:

It uses the counter variable that makes the number of process which
approaching the critical section to access, to wait for some time, to make the
process which is currently accessing its critical section to finish.

• SIGNAL:

It signals the process to access the critical section after the wait.

35. NON PREEMPTIVE SCHEDULING:

Under non preemptive or Cooperative scheduling, once the CPU has been
allocated to a process, the process keeps the CPU until it releases the CPU either by terminating
or by switching to the waiting state.

36. PREEMPTIVE SCHEDULING:

CPU – scheduling decisions may take place under four circumstances.

• When a process switches from the running state to waiting state.

• When a process switches from the running state to ready state.

• When a process switches from the waiting state to ready state.

 • When a process terminates.

37. TURNAROUND TIME:

The interval from the time of submission of a process to the time of

completion is the turnaround time. Turnaround time is the sum of the periods spent waiting to get
into memory, waiting in the ready queue, executing on the CPU, and doing I/O.

38. DEAD LOCK:

A process requests a resource, when at that time resource not available. The
continues waiting of the number process leads to dead lock.

39. PROCESS RESOURCES:

• Request.

• Use.

• Release.

40. NECESSARY CONDITIONS OF DEADLOACK:

A dead lock situation can arrive in the following four conditions by

holding simultaneously in a system.

• Mutual exclusions
 • Hold & Wait.

• No preemption.

• Circular wait.

41. METHODS TO DEAL WITH DEAD LOCK:

• Ignore the problem

• Detect the algorithm and recover it.

• Avoid dead lock / Dynamic avoidance by careful resource

allocation.

• Prevent by strictly negating, if any of the four necessary conditions

occurs which cause dead lock.