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

An un-interruptible unit is known as ____________

A. Single
B. Atomic
C. Static
D. None of the mentioned

TestAndSet instruction is executed ____________

A. After a particular process
B. Periodically
C. Atomically
D. None of the mentioned

Semaphore is a/an _______ to solve the critical section problem.

A. Hardware for a system
B. Special program for a system
C. Integer variable
D. None of the mentioned

What are the two atomic operations permissible on semaphores?

A. Wait and signal
B. Stop and wait
C. Hold and signal
D. None of the mentioned

What are Spinlocks?

A. Cpu cycles wasting locks over critical sections of programs
B. Locks that avoid time wastage in context switches
C. Locks that work better on multiprocessor systems
D. All of the mentioned

What is the main disadvantage of spinlocks?

A. They are not sufficient for many process
B. They require busy waiting
C. They are unreliable sometimes
D. They are too complex for programmers

The wait operation of the semaphore basically works on the basic _______ system call.

A. Stop()
B. Block()
C. Hold()
D. Wait()

The signal operation of the semaphore basically works on the basic _______ system call.

A. Continue()
B. Wakeup()
C. Getup()
D. Start()

If the semaphore value is negative ____________

A. Its magnitude is the number of processes waiting on that semaphore
B. It is invalid
C. No operation can be further performed on it until the signal operation is performed on it
D. None of the mentioned

The code that changes the value of the semaphore is ____________

A. Remainder section code
B. Non €? critical section code
C. Critical section code
D. None of the mentioned