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

Thread pools are useful when ____________

A. When we need to limit the number of threads running in the application at the same time
B. When we need to limit the number of threads running in the application as a whole
C. When we need to arrange the ordering of threads
D. None of the mentioned

Instead of starting a new thread for every task to execute concurrently, the task can be passed to a ___________

A. Process
B. Thread pool
C. Thread queue
D. None of the mentioned

Each connection arriving at multi threaded servers via network is generally ____________

A. Is directly put into the blocking queue
B. Is wrapped as a task and passed on to a thread pool
C. Is kept in a normal queue and then sent to the blocking queue from where it is dequeued
D. None of the mentioned

What is the idea behind thread pools?

A. A number of threads are created at process startup and placed in a pool where they sit and wait for work
B. When a process begins, a pool of threads is chosen from the many existing and each thread is allotted equal amount of work
C. All threads in a pool distribute the task equally among themselves
D. None of the mentioned

If the thread pool contains no available thread ____________

A. The server runs a new process
B. The server goes to another thread pool
C. The server demands for a new pool creation
D. The server waits until one becomes free

Thread pools help in ____________

A. Servicing multiple requests using one thread
B. Servicing a single request using multiple threads from the pool
C. Faster servicing of requests with an existing thread rather than waiting to create a new thread
D. None of the mentioned

Thread pools limit the number of threads that exist at any one point, hence ____________

A. Not letting the system resources like cpu time and memory exhaust
B. Helping a limited number of processes at a time
C. Not serving all requests and ignoring many
D. None of the mentioned

The number of the threads in the pool can be decided on factors such as ____________

A. Number of cpus in the system
B. Amount of physical memory
C. Expected number of concurrent client requests
D. All of the mentioned