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

To obtain better memory utilization, dynamic loading is used. With dynamic loading, a routine is not loaded until it is called. For implementing dynamic loading ____________

A. Special support from hardware is required
B. Special support from operating system is essential
C. Special support from both hardware and operating system is essential
D. User programs can implement dynamic loading without any special support from hardware or operating system

Each entry in a translation lookaside buffer (TLB) consists of ____________

A. Key
B. Value
C. Bit value
D. Constant

If a page number is not found in the TLB, then it is known as a ____________

A. Tlb miss
B. Buffer miss
C. Tlb hit
D. All of the mentioned

An ______ uniquely identifies processes and is used to provide address space protection for that process.

A. Address space locator
B. Address space identifier
C. Address process identifier
D. None of the mentioned

The percentage of times a page number is found in the TLB is known as ____________

A. Miss ratio
B. Hit ratio
C. Miss percent
D. None of the mentioned

Memory protection in a paged environment is accomplished by ____________

A. Protection algorithm with each page
B. Restricted access rights to users
C. Restriction on page visibility
D. Protection bit with each page

When the valid – invalid bit is set to valid, it means that the associated page ____________

A. Is in the tlb
B. Has data in it
C. Is in the process’s logical address space
D. Is the system’s physical address space

Illegal addresses are trapped using the _____ bit.

A. Error
B. Protection
C. Valid €? invalid
D. Access

When there is a large logical address space, the best way of paging would be ____________

A. Not to page
B. A two level paging algorithm
C. The page table itself
D. All of the mentioned

In a paged memory, the page hit ratio is 0.35. The required to access a page in secondary memory is equal to 100 ns. The time required to access a page in primary memory is 10 ns. The average time required to access a page is?

A. 3.0 ns
B. 68.0 ns
C. 68.5 ns
D. 78.5 ns