IMPORTANT OF O.S. BY CHETAN :
- update
- PYQ
- mid sem
- Operating system components
- Operating-System Services
- Types of operating systems
- Concept of System calls 2 types
UNIT 2-3
- WHAT is Inter process Communication
- Define what are Threads and Thread issues in os
- what is Critical Section Problem and role of Semaphores ?
- define the following
- Deadlock
- Deadlock prevention
- Deadlock detection
- Deadlock avoidance
- Recovery from Deadlock
Unit 4-5
Q.1 what is virtual memory concept write the advantage virtual memory in a computer system.?
Q.2 explain demand paging write the steps of demand paging?
Q.3 describe the page fault in OS?
Q.4what is page replacement algorithm
- FIFO
- LRU
- OT
Q.5 what is threshing write the advantage and disadvantage of threshing?
Q.6 FRAGMENTATAION?
- What is operating system? What are functions of an operating system?
- What is paging? Explain contiguous allocation memory.
- Explain the term file sharing in operating systems?
- Describe the concept of Virtual memory in operating system?
- List out different services of operating systems.
MID SEM
unit 1
Os, os ke types or components or process state
Unit 2
Process scheduling algorithm theory
Unit 3
Deadlock, detection and recovery and necessary conditions
Unit 4
Contiguous memory allocation, fragmentation or swapping
Demand paging or page fault
Sum NOTES:
1 >>what is virtual memory concept write the advantage virtual memory in a computer system.?
Virtual memory is a common technique used in a computer's operating system (OS). Virtual memory uses both hardware and software to enable a computer
to compensate for physical memory shortages, temporarily transferring data from random access memory (RAM) to disk storage.
**Virtual memory helps to gain speed when only a particular segment of the program is required for the execution of the program.
**It is very helpful in implementing a multiprogramming environment.
**It allows you to run more applications at once.
**It helps you to fit many large programs into smaller programs.
**Common data or code may be shared between memory.
2>> explain demand paging write the steps of demand paging?
Demand paging is a process in which data is moved from secondary memory to RAM on a demand basis, which means all data is not stored in the main memory because the space is limited in RAM.
When a process tries to access a page, the following steps are generally followed:
- Attempt to access page.
- If page is valid (in memory) then continue processing instruction as normal.
- If page is invalid then a page-fault trap occurs.
- Check if the memory reference is a valid reference to a location on secondary memory. If not, the process is terminated (illegal memory access). Otherwise, we have to page in the required page.
- Schedule disk operation to read the desired page into main memory.
- Restart the instruction that was interrupted by the operating system trap.
Q3.describe the page fault in OS?
Page Fault: A page fault happens when a running program accesses a memory page that is mapped into the virtual address space but not loaded in physical memory. Since actual physical memory is much smaller than virtual memory, page faults happen
Q.4 what is page replacement algorithm
In case of a page fault, Operating System might have to replace one of the existing pages with the newly needed page. Different page replacement algorithms
suggest different ways to decide which page to replace.
Page Replacement Algorithms:
//inn mein diagram hai
1. First In First Out (FIFO): This is the simplest page replacement algorithm. In this algorithm, the operating system keeps track of all pages in the memory
in a queue, the oldest page is in the front of the queue. When a page needs to be replaced page in the front of the queue is selected for removal.
2. Optimal Page replacement: In this algorithm, pages are replaced which would not be used for the longest duration of time in the future.
3. Least Recently Used: In this algorithm, page will be replaced which is least recently used.
0 Comments