Operating Systems

Last Updated : 28 Jun, 2021

Recent Articles on Operating Systems

Basics :

System Structure :

CPU Scheduling :

Process Synchronization :

Deadlock :

Processes & Threads :

Memory Management :

  1. Memory Hierarchy Design and its Characteristics
  2. Introduction to memory and memory units
  3. Different Types of RAM (Random Access Memory)
  4. Buddy System: Memory allocation technique
  5. Memory Management | Partition Allocation Method
  6. Fixed (or static) Partitioning in Operating System
  7. Variable (or dynamic) Partitioning in Operating System
  8. Non-Contiguous Allocation in Operating System
  9. Logical vs Physical Address in Operating System
  10. Paging
  11. Requirements of memory management system
  12. Memory management – mapping virtual address to physical addresses
  13. Page Table Entries
  14. Virtual Memory
  15. Memory Interleaving
  16. Virtual Memory Questions
  17. Operating system based Virtualization
  18. Inverted Page Table
  19. Swap Space
  20. Page Fault Handling
  21. Fixed (or static) Partitioning in Operating System
  22. Segmentation
  23. Memory Segmentation in 8086 Microprocessor
  24. Program for Next Fit algorithm in Memory Management
  25. Overlays in Memory Management
  26. Page Replacement Algorithms
  27. Program for Page Replacement Algorithms | Set 1 ( LRU)
  28. Program for Optimal Page Replacement Algorithm
  29. LFU (Least Frequently Used) Cache Implementation
  30. Second Chance (or Clock) Page Replacement Policy
  31. Techniques to handle Thrashing
  32. Allocating kernel memory (buddy system and slab system)
  33. Program for buddy memory allocation scheme in Operating Systems | Set 1 (Allocation)
  34. Program for buddy memory allocation scheme in Operating Systems | Set 2 (Deallocation)
  35. Static and Dynamic Libraries | Set 1
  36. Working with Shared Libraries | Set 1
  37. Working with Shared Libraries | Set 2
  38. Named Pipe or FIFO with example C program
  39. Tracing memory usage in Linux

>> Quiz on Memory Management

Disk Management

Misc

Similar Reads

Operating Systems | Input Output Systems | Question 5
Which of the following is major part of time taken when accessing data on the disk? (A) Settle time (B) Rotational latency (C) Seek time (D) Waiting time Answer: (C) Explanation: Seek time is time taken by the head to travel to the track of the disk where the data to be accessed is stored.Quiz of this Question
1 min read
Operating Systems | Input Output Systems | Question 2
We describe a protocol of input device communication below. a. Each device has a distinct address b. The bus controller scans each device in sequence of increasing address value to determine if the entity wishes to communicate. c. The device ready to communicate leaves it data in IO register. d. The data is picked up and the controller moves to ste
1 min read
Operating Systems | Input Output Systems | Question 5
From amongst the following given scenarios determine the right one to justify interrupt mode of data-transfer: Source: nptel (A) Bulk transfer of several kilo-byte (B) Moderately large data transfer but more that 1 KB (C) Short events like mouse action (D) Key board inputs Answer: (C) (D) Explanation: Both keyboard and mouse controllers typically u
1 min read
Operating Systems | Input Output Systems | Question 4
Normally user programs are prevented from handling I/O directly by I/O instructions in them. For CPUs having explicit I/O instructions, such I/O protection is ensured by having the I/O instructions privileged. In a CPU with memory mapped I/O, there is no explicit I/O instruction. Which one of the following is true for a CPU with memory mapped I/O?
1 min read
Operating Systems | Input Output Systems | Question 5
Put the following disk scheduling policies results in minimum amount of head movement. (A) FCFS (B) Circular SCAN (C) Elevator Answer: (C) Explanation: Circular scanning works just like the elevator to some extent. It begins its scan toward the nearest end and works its way all the way to the end of the system. Once it hits the bottom or top it jum
1 min read
Operating Systems - GATE CSE Previous Year Questions
Solving GATE Previous Year's Questions (PYQs) not only clears the concepts but also helps to gain flexibility, speed, accuracy, and understanding of the level of questions generally asked in the GATE exam, and that eventually helps you to gain good marks in the examination. Previous Year Questions help a candidate practice and revise for GATE, whic
4 min read
Operating Systems | Set 2
Following questions have been asked in GATE CS exam. 1. Consider a machine with 64 MB physical memory and a 32-bit virtual address space. If the page size is 4KB, what is the approximate size of the page table? (GATE 2001) (a) 16 MB (b) 8 MB (c) 2 MB (d) 24 MB Answer: (c) Explanation: A page entry is used to get address of physical memory. Here we
4 min read
Operating Systems | Set 4
Following questions have been asked in GATE CS exam. 1. Using a larger block size in a fixed block size file system leads to (GATE CS 2003) a) better disk throughput but poorer disk space utilization b) better disk throughput and better disk space utilization c) poorer disk throughput but better disk space utilization d) poorer disk throughput and
3 min read
Operating Systems | Set 5
Following questions have been asked in GATE 2012 exam. 1. A process executes the code fork (); fork (); fork (); The total number of child processes created is (A) 3 (B) 4 (C) 7 (D) 8 Answer (C) Let us put some label names for the three lines fork (); // Line 1 fork (); // Line 2 fork (); // Line 3 L1 // There will be 1 child process created by lin
3 min read
Operating Systems | Set 6
Following questions have been asked in GATE 2011 CS exam. 1) A thread is usually defined as a 'light weight process' because an operating system (OS) maintains smaller data structures for a thread than for a process. In relation to this, which of the followings is TRUE? (A) On per-thread basis, the OS maintains only CPU register state (B) The OS do
4 min read