MCQs City

Operating System » Memory Allocation 1

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

The main memory accommodates ____________

A. Operating system
B. Cpu
C. User processes
D. All of the mentioned

Read more about this MCQ

The operating system and the other processes are protected from being modified by an already running process because ____________

A. They are in different memory spaces
B. They are in different logical addresses
C. They have a protection algorithm
D. Every address generated by the cpu is being checked against the relocation and limit registers

Read more about this MCQ

Using transient code, _______ the size of the operating system during program execution.

A. Increases
B. Decreases
C. Changes
D. Maintains

Read more about this MCQ

What is the operating system?

A. In the low memory
B. In the high memory
C. Either low or high memory (depending on the location of interrupt vector)
D. None of the mentioned

Read more about this MCQ

In contiguous memory allocation ____________

A. Each process is contained in a single contiguous section of memory
B. All processes are contained in a single contiguous section of memory
C. The memory space is contiguous
D. None of the mentioned

Read more about this MCQ

The relocation register helps in ____________

A. Providing more address space to processes
B. A different address space to processes
C. To protect the address spaces of processes
D. None of the mentioned

Read more about this MCQ

With relocation and limit registers, each logical address must be _______ the limit register.

A. Less than
B. Equal to
C. Greater than
D. None of the mentioned

Read more about this MCQ

Transient operating system code is code that ____________

A. Is not easily accessible
B. Comes and goes as needed
C. Stays in the memory always
D. Never enters the memory space

Read more about this MCQ

When memory is divided into several fixed sized partitions, each partition may contain ________

A. Exactly one process
B. At least one process
C. Multiple processes at once
D. None of the mentioned

Read more about this MCQ

In fixed size partition, the degree of multiprogramming is bounded by ___________

A. The number of partitions
B. The cpu utilization
C. The memory size
D. All of the mentioned

Read more about this MCQ

MCQs Menu

Past Papers