FOR FREE YEAR SOLVED
- Introduction: OS
- Booting Process
- Command Interpreter
- Dual mode of operation
- System Calls
- Difference between system call and library call
- Interrupt and Trap
- Introduction
- Scheduling Criteria, Terms and Concepts
- Different Type Scheduling Algorithms
- Longest Job First
- Longest Remaining Time First
- Highest Response Ratio Next (HRRN)
- Priority Scheduling
- Least Completed Next (LCN) Scheduling
- Multi-Level Queue Scheduling
- Multilevel Feedback Queue Scheduling
- Guaranteed Scheduling
- Fair Share Scheduling
- Lottery Scheduling
- Multi-Processor Scheduling
- Deadline Scheduling
- Rate-Monotonic Scheduling
- POSIX Real-Time Scheduling
- Priority Inversion
- Proportional Share Scheduling
- Comparison table of Scheduling Algorithm
- Algorithm Evaluation for Scheduling
- Important concept of MM
- Memory Representation as Address
- Memory layout for a Process
- Logical and Physical Address Space
- Necessity of Memory Management
- Introduction
- Concept of Non-contiguous memory allocation
- Basic concept of Paging
- Address Translation
- Process of Paging Method
- Calculation of Offset for paging
- Calculation of Logical Address Bit and number of Pages
- Calculation of Physical Address Bit and number of Frames
- Calculation of Page Table Size
- Organization of MMU
- Why Page size power of 2
- Paging Address Calculation: example1
- Paging Numeric Problem: Example2
- Paging Address Calculation: Example3
- Paging Address Calculation: Question1
- Some Important Question 2
- Paging Address Translation: Question3
- UGC NET Paging Question
- GATE Paging Question
- Number of information at Page Entry
- Exams Question on Page Entry Information
- Exam Question: Page Entry Information
- Calculates Page Table Entry Size
- Calculates Page Size
- Calculation of Optimal Page Size
- Question on Optimal Page Size
- Hashed Page Table with Example
- Inverted Page Table with Gate Question
- Question on Inverted Page Table
- Multi-Level Paging
- Multi-level paging: Example1
- Multi-level paging: Example2
- Allocation of Frames
- Subject Mock
Memory layout for a process:
.png)
Text/Code segment: Text segment contains executable instructions of a program. It is a read-only section because code cannot be changed or modified during execution.
Generally, code segments allow sharing a single code i.e. more than one process can access a single sharable code in memory and the advantage is that only a single copy needs to memory i.e. no need for extra memory for this sharable code for all programs.
Data segment: This Segment contains a static and global variable of the program.
Example: int static sum=0.
Below the data segment, there is another segment called "Block Started by Symbol"(BSS) which store uninitialized static variables. Example: int static sum.
Stack segment: This segment contains part of the program which uses the stack as temporary usage.
This area is dedicated to store all the variables required by a function call in a program.
For every function of the program, there is a stack frame that contains local variables as well as actual parameters of the function.
So, variables of all functions are completely separated by individual stack frames.
The same way the recursion functions are implemented. Each time a recursion function calls itself, new stack frame is allocated on the top of the stack.
Heap segment: This segment contains that part of the program where dynamic memory allocation is used. Example: Malloc and Alloc in C.
