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

The model in which one kernel thread is mapped to many user-level threads is called ___________

A. Many to one model
B. One to many model
C. Many to many model
D. One to one model

The model in which one user-level thread is mapped to many kernel level threads is called ___________

A. Many to one model
B. One to many model
C. Many to many model
D. One to one model

In the Many to One model, if a thread makes a blocking system call ___________

A. The entire process will be blocked
B. A part of the process will stay blocked, with the rest running
C. The entire process will run
D. None of the mentioned

In the Many to One model, multiple threads are unable to run in parallel on multiprocessors because of ___________

A. Only one thread can access the kernel at a time
B. Many user threads have access to just one kernel thread
C. There is only one kernel thread
D. None of the mentioned

The One to One model allows ___________

A. Increased concurrency
B. Decreased concurrency
C. Increased or decreased concurrency
D. Concurrency equivalent to other models

In the One to One model when a thread makes a blocking system call ___________

A. Other threads are strictly prohibited from running
B. Other threads are allowed to run
C. Other threads only from other processes are allowed to run
D. None of the mentioned

Which of the following is the drawback of the One to One Model?

A. Increased concurrency provided by this model
B. Decreased concurrency provided by this model
C. Creating so many threads at once can crash the system
D. Creating a user thread requires creating the corresponding kernel thread

When is the Many to One model at an advantage?

A. When the program does not need multithreading
B. When the program has to be multi-threaded
C. When there is a single processor
D. None of the mentioned

In the Many to Many model true concurrency cannot be gained because ___________

A. The kernel can schedule only one thread at a time
B. There are too many threads to handle
C. It is hard to map threads with each other
D. None of the mentioned

In the Many to Many models when a thread performs a blocking system call ___________

A. Other threads are strictly prohibited from running
B. Other threads are allowed to run
C. Other threads only from other processes are allowed to run
D. None of the mentioned