Physical address refers to the address that is seen by the memory unit.
Banker’s algorithm is one form of deadlock-avoidance in a system.
Page swapping or page replacements are called page cannibalizing.
Root partition is where the operating system kernel is located.
Each process has one or more LIFO stacks associated with it.
Logical address refers to the address that is generated by the CPU.
Kernel connects applications to the actual processing of data.
A socket provides a connection between two applications.
A trap is a software interrupt, usually the result of an error condition.
In dynamic loading, a routine is not loaded until it is called.
Dynamic Ram stores the data in the form of Capacitance.
FtDisk is a fault tolerance disk driver for Windows NT.
Absolute path-- Exact path from root directory.
Relative path-- Relative to the current path.
Static RAM stores the data in Voltages.
Global replacement policy allows any page frame from any process to be replaced.
Piping is the process of using the output of one program as an input to another.
A list of processes waiting for a particular I/O device is called device queue.
A thread is composed of a thread ID, program counter, register set and a stack.
If a process fails, most operating system write the error information to a log file.
To access the services of operating system, the interface is provided by the System calls.
Daemon is a program that runs in the background without user’s interaction.
Zombie process are dead processes which are not yet removed from the process table.
Critical section is a section of code which can be executed only by one process at a time.
Overlays are used to enable a process to be larger than the amount of memory allocated to it.
Time-stamping is used to order events in a distributed system without the use of clocks.
Turnaround time is the interval between the submission of a job and its completion.
Primary memory is the main memory (Hard disk, RAM) where the operating system resides.
Caching is the processing of utilizing a region of fast memory for a limited data and process.
Response time is the interval between submission of a request, and the first response to that request.
Virtual memory is a memory management technique for letting processes execute outside of memory.
The main function of the command interpreter is to get and execute the next user-specified command.
The repeated execution of a loop of code while waiting for an event to occur is called busy-waiting.
Local replacement means that an incoming page is brought in only to the relevant process address space.
Deadlock is a situation when two or more processes wait for each other to finish and none of them ever finish.
In a Time sharing system, the CPU executes multiple jobs by switching among them, also known as multitasking.
Synchronization means controlling access to a resource that is available to two or more threads or process.
I/O status information provides info about which I/O devices are to be allocated for a particular process.
Real-time systems are used when rigid time requirements have been placed on the operation of a processor.
When the OS at the explicit request of another process creates a process, this action is called process spawning.
Process migration is the transfer of sufficient amount of the state of process from one machine to the target machine.
Kernel also manages all communications between software and hardware components to ensure usability and reliability.
By operating system, the resource management can be done via time division multiplexing and space division multiplexing.
Thrashing refers to an instance of high paging activity and it happens when it is spending more time paging instead of executing.
Interrupts are part of a hardware mechanism that sends a notification to the CPU when it wants to gain access to a particular resource.
Compaction is a process in which the free space is collected in a large memory chunk to make some space available for processes.
Trapdoor is a secret undocumented entry point into a program used to grant access without normal methods of access authentication.
A binary semaphore is one, which takes only 0 and 1 as values and are used to implement mutual exclusion and synchronize concurrent processes.
Demand paging is referred when all of a process’s pages are in the RAM, then the OS brings the missing pages from the disk into the RAM.
Thrashing is a phenomenon in virtual memory schemes, when the processor spends most of its time swapping pages, rather than executing instructions.
Deadlock situations occur when four conditions occur simultaneously in a system: Mutual exclusion; Hold and Wait; No preemption; and Circular wait.
In batched operating system the users gives their jobs to the operator who sorts the programs according to their requirements and executes them.
An assembler acts as a translator for low level language. Assembly codes, written using mnemonic commands are translated by the Assembler into machine language.
The set of dispatchable processes is in a safe state if there exists at least one temporal order in which all processes can be run to completion without resulting in a deadlock.
Secondary memory can be external devices like CD, floppy magnetic discs etc. secondary storage cannot be directly accessed by the CPU and is also external memory storage.
Spooling is associated with printing. When different applications want to send an output to the printer at the same time, spooling takes all of these print jobs into a disk file and queues them accordingly to the printer.
The entry of all the PCBs of the current processes is in
Process Table
A Process Control Block(PCB) does not contain
Bootstrap program
The number of processes completed per unit time is known as
Throughput
The state of a process is defined by
the current activity of the process
The degree of multi-programming is
the number of processes in memory
The objective of multi-programming is to
Have some process running at all times
The Process Control Block is:
Data Structure
interprocess communication
is communication between two process
the ready state of a process,
when process is scheduled to run after some execution
The address of the next instruction to be executed by the current process is provided by the
Program counter
If a process fails, most operating system write the error information to a ______
log file
By operating system, the resource management can be done via
time division multiplexing
space division multiplexin
kernel is the program that constitutes the central core of the operating system,
kernel is the first part of operating system to load into memory during booting,
kernel remains in the memory during the entire computer session
The systems which allows only one process execution at a time, are called
uniprocessing systems
A single thread of control allows the process to perform:
only one task at a time
codenody