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

In segmentation, each address is specified by ____________

A. A segment number & offset
B. An offset & value
C. A value & segment number
D. A key & value

In paging the user provides only ________ which is partitioned by the hardware into ________ and ______

A. One address, page number, offset
B. One offset, page number, address
C. Page number, offset, address
D. None of the mentioned

Each entry in a segment table has a ____________

A. Segment base
B. Segment peak
C. Segment value
D. None of the mentioned

The segment base contains the ____________

A. Starting logical address of the process
B. Starting physical address of the segment in memory
C. Segment length
D. None of the mentioned

The segment limit contains the ____________

A. Starting logical address of the process
B. Starting physical address of the segment in memory
C. Segment length
D. None of the mentioned

The offset ‘d’ of the logical address must be ____________

A. Greater than segment limit
B. Between 0 and segment limit
C. Between 0 and the segment number
D. Greater than the segment number

If the offset is legal ____________

A. It is used as a physical memory address itself
B. It is subtracted from the segment base to produce the physical memory address
C. It is added to the segment base to produce the physical memory address
D. None of the mentioned

When the entries in the segment tables of two different processes point to the same physical location ____________

A. The segments are invalid
B. The processes get blocked
C. Segments are shared
D. All of the mentioned

The protection bit is 0/1 based on ____________

A. Write only
B. Read only
C. Read €? write
D. None of the mentioned

If there are 32 segments, each of size 1Kb, then the logical address should have ____________

A. 13 bits
B. 14 bits
C. 15 bits
D. 16 bits

Explanation: To specify a particular segment, 5 bits are required. To select a particular byte after selecting a page, 10 more bits are required. Hence 15 bits are required.