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

What is true regarding ‘Fence’?

A. Its a method to confine users to one side of a boundary
B. It can protect operating system from one user
C. It cannot protect users from each other
D. All of the mentioned

What is not true regarding ‘Fence’?

A. It is implemented via hardware register
B. It doesn’t protect users from each other
C. It good to protect os from abusive users
D. Its implementation is unrestricted and can take any amount of space in operating system.

What is correct regarding ‘relocation’ w.r.t protecting memory?

A. It is a process of taking a program as if it began at address 0
B. It is a process of taking a program as if it began at address 0a
C. Fence cannot be used within relocation process
D. All of the mentioned

How can fence and relocation be used together?

A. To each program address, the contents of fence register are added
B. To contents of fence register is subtracted from actual address of program
C. To each program address, the contents of fence register are not added
D. None of the mentioned

Explanation: This both relocates the address and guarantees that no one can access a location lower than a fence address.

What is the basic need in protecting memory in multi-user environment?

A. We need two registers one €?start’ and other €?end’
B. We need a variable register
C. A fence register has to be used known as base register.
D. None of the mentioned

What is the role of base/bound registers?

A. They give starting address to a program
B. Program’s addresses are neatly confined to space between the base and the bound registers
C. They provide encrypted environment
D. This technique doesn’t protects a program’s address from modification by another user

What is all-or-nothing situation for sharing in memory?

A. Program makes all its data available to be accessed
B. It prohibits access to some
C. It creates rules who can access program memory
D. It separates program memory and data memory

How is disadvantage of all-or-nothing approach overcome?

A. Base/bound
B. Relocation technique
C. Fence method
D. Tagged architecture

What is true regarding tagged architecture?

A. Every word of machine memory has one or more extra bits
B. Extra bits are used to do padding
C. Extra bits are not used to identify rights to that word
D. It is very compatible to code upgrades

What is best solution to have effect of unbounded number if base/bound registers?

A. Tagged architecture
B. Segmentation
C. Fence method
D. None of the mentioned