Operating System - MADE EASY Study Material for GATE, ESE and SES Exams

Latest:

Binary Trees and Types

Binary Tree A binary tree is the one where each node has atmost 2 children. A binary tree is a

The tree traversals of a forest may be defined as the tree traversals of its corresponding binary tree. Routines for

A Tree is a data structure similar to linked lists but instead of each node pointing simply to the next

“A queue is an ordered list in which all insertions are done from one end called REAR and deletions are

The stack is used to store and restore the recursive function and its argument(s). (i) Tail recursion (ii) Non-tail recursion

Given a stack S = (a[1], a[2],… a[n]) then we say that a1 is the bottom most element and element

“A stack is an ordered list in which all insertions and deletions are made at one end, called the top.”

The main problem is how to allocate space to a file so that disk space is utilized effectively and file

File management system is a set of software modules. It provides services to the user and application programs concerning files.

When there is a page fault, the referenced page must be loaded. If there is no available frame in memory

Each page table entry has a valid bit; it indicates whether the corresponding page is currently in memory. If the

Virtual memory is the separation of user logical memory from physical memory. This technique is implemented using both hardware and

Lock variable Entry section I Load Ri, m[lock] II. Comp Ri , #0 III. JNZ to step IIV. IVStore m[lock],

(i) Mutual Exclusion: No two processes may be simultaneously present inside the critical section at any point of time. To

Critical Section: The portion of program text where the shared variables or shared resources will be placed. Race Condition: It

Threads (or processes) are concurrent if they exist at the same time. They are asynchronous if they need to synchronize

Objectives of I/O system: Take an application I/O request and send it to the physical device. Take whatever response comes

Each page table entry has a valid bit, it indicates whether the corresponding page is currently in memory. If the

Paging is static memory allocation technique that permits the physical address space of a process to be non contiguous. The