Operating System Subcategories

Memory Management Swapping 1	Process Scheduling Queue
Virtual Memory Page Replacement Algorithms 1	Linux
Cpu Scheduling	Memory Management
Computer Fundamentals	Cpu Scheduling Benefits
Threads Signal Handling	Threads Ult Klt
Distributed Operating System	Basics
Operating System	Processes
Cpu Scheduling Algorithms 1	Cpu Scheduling Algorithms 2
Deadlock	Deadlock Avoidance
Memory Management Swapping 2	Memory Allocation 1
Secondary Storage	Memory Management Paging 1
Memory Management Paging 2	Rtos
Multimedia System Cpu Disk Scheduling	Security Intrusion Detection
Virtual Memory Thrashing	File System Interface Access Methods 1
File System Interface Directory Structure 1	File System Interface Directory Structure 2
File System Interface Mounting Sharing	File System Allocation Methods 1
Disk Scheduling 2	Disk Management
Classic Sync Problems	Semaphores 1
Process Creation	Multimedia System Network Management
Semaphores 2	Cpu Scheduling 2
Application Io Interface 1	Inter Process Communication
Process Synchronization	Multimedia System Compression 1
Network File System 1	Disk Scheduling 1
Mass Storage Raid 1	File System 1
Communication Systems Bandwidth Transmission Medium	Security Cryptography
Two Port Network	Process Rpc
Virtual Memory Page Replacement Algorithms 2	Virtual Memory Frame Allocation
Network File System 2	File System Allocation Methods 2
File System Allocation Methods 3	Process Control Block
Process Structures	Critical Section Problem
Process Sync Monitors	Atomic Transactions
Deadlock Recovery	Memory Allocation 2
Memory Management Segmentation	Application Io Interface 2
Kernel Io Subsystems	Multimedia System Compression 2
Multimedia System Compression 3	Security User Authentication
Security Program System Threats	Security System Facility
Threads Fork Exec	Threads Cancellation
Threads Pools	Multi Threading Models
Virtual Memory Demand Paging	Virtual Memory
File System Concepts	File System Implementation
File System Interface Access Methods 2	File System Recovery
Io Subsystem	Swap Space Management
Mass Storage Raid 2	Mass Storage Tertiary Storage
Protection Concepts	Protection Access Matrix
Security	Protection Memory Protection
Protection Revocation Access Rights	Network Structure Topology
Robustness	Distributed File System
Distributed Synchronization	Deadlock Prevention
Deadlock Detection	Threads
File System Interface Protection	File System Free Space Performance

When using counters to implement LRU, we replace the page with the ____________

A. Smallest time value
B. Largest time value
C. Greatest size
D. None of the mentioned

Explanation: Whenever a reference to a page is made, the contents of the clock register are copied into the time-of-use field in the page-table entry for that page. In this way, we always have the time of the last reference to each page.

In the stack implementation of the LRU algorithm, a stack can be maintained in a manner ____________

A. Whenever a page is used, it is removed from the stack and put on bottom
B. The bottom of the stack is the lru page
C. The top of the stack contains the lru page and all new pages are added to the top
D. None of the mentioned

There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called ____________

A. Queue algorithms
B. Stack algorithms
C. String algorithms
D. None of the mentioned

Applying the LRU page replacement to the following reference string. 1 2 4 5 2 1 2 4 The main memory can accommodate 3 pages and it already has pages 1 and 2. Page 1 came in before page 2. How many page faults will occur?

A. 2
B. 3
C. 4
D. 5

Increasing the RAM of a computer typically improves performance because ____________

A. Virtual memory increases
B. Larger rams are faster
C. Fewer page faults occur
D. None of the mentioned

The essential content(s) in each entry of a page table is/are ____________

A. Virtual page number
B. Page frame number
C. Both virtual page number and page frame number
D. Access right information

The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by ____________

A. The instruction set architecture
B. Page size
C. Physical memory size
D. Number of processes in memory

What is the reason for using the LFU page replacement algorithm?

A. An actively used page should have a large reference count
B. A less used page has more chances to be used again
C. It is extremely efficient and optimal
D. All of the mentioned

What is the reason for using the MFU page replacement algorithm?

A. An actively used page should have a large reference count
B. A less used page has more chances to be used again
C. It is extremely efficient and optimal
D. All of the mentioned

The implementation of the LFU and the MFU algorithm is very uncommon because ____________

A. They are too complicated
B. They are optimal
C. They are expensive
D. All of the mentioned