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

A collection of instructions that performs a single logical function is called ____________

A. Transaction
B. Operation
C. Function
D. All of the mentioned

A terminated transaction that has completed its execution successfully is ____________ otherwise it is __________

A. Committed, destroyed
B. Aborted, destroyed
C. Committed, aborted
D. None of the mentioned

The state of the data accessed by an aborted transaction must be restored to what it was just before the transaction started executing. This restoration is known as ________ of transaction.

A. Safety
B. Protection
C. Roll €? back
D. Revert €? back

Write ahead logging is a way ____________

A. To ensure atomicity
B. To keep data consistent
C. That records data on stable storage
D. All of the mentioned

In the write ahead logging a _____________ is maintained.

A. A memory
B. A system
C. A disk
D. A log record

An actual update is not allowed to a data item ____________

A. Before the corresponding log record is written out to stable storage
B. After the corresponding log record is written out to stable storage
C. Until the whole log record has been checked for inconsistencies
D. All of the mentioned

The undo and redo operations must be _________ to guarantee correct behaviour, even if a failure occurs during recovery process.

A. Idempotent
B. Easy
C. Protected
D. All of the mentioned

Explanation: Idempotent – Multiple executions of an operation have the same result as does one execution.

The system periodically performs checkpoints that consists of the following operation(s) ____________

A. Putting all the log records currently in main memory onto stable storage
B. Putting all modified data residing in main memory onto stable storage
C. Putting a log record onto stable storage
D. All of the mentioned

Consider a transaction T1 that committed prior to checkpoint. The record appears in the log before the record. Any modifications made by T1 must have been written to the stable storage either with the checkpoint or prior to it. Thus at recovery time ____________

A. There is a need to perform an undo operation on t1
B. There is a need to perform a redo operation on t1
C. There is no need to perform an undo and redo operation on t1
D. All of the mentioned

Serializable schedules are ones where ____________

A. Concurrent execution of transactions is equivalent to the transactions executed serially
B. The transactions can be carried out one after the other
C. A valid result occurs after execution transactions
D. None of the mentioned