MCQs City

Operating System » Memory Management Paging 2

Operating System Subcategories

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

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

Read more about this MCQ

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

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

Read more about this MCQ

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

Read more about this MCQ

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

Read more about this MCQ

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

Read more about this MCQ

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

Read more about this MCQ

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

Read more about this MCQ

Illegal addresses are trapped using the _____ bit.

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

Read more about this MCQ

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

Read more about this MCQ

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

Read more about this MCQ

MCQs Menu

Past Papers