Online Exam Preparation
MCQs Library
Browse subject-wise multiple choice questions, review answers quickly, and start a test from the same section.
Questions
| Code | Question | Option A | Option B | Option C | Option D | Answer |
|---|---|---|---|---|---|---|
| CS604 |
The Purpose Of Operating System Is To Generate Executable Programs And To Them
|
Regenetrate
|
Execute
|
Store
|
Remove
|
B |
| CS604 |
The Resident Set Of A Process Can Be Changed In Response To Actions By Other Processes
|
True
|
False
|
Na
|
Na
|
T |
| CS604 |
The Returned Code To The Child Process After Successful Fork System Call Execution Is
|
0
|
1
|
2
|
3
|
A |
| CS604 |
The Run-Time Mapping From Virtual To Physical Addresses Is Done By A Piece Of Hardware In The Cpu Called The ------------------
|
Cpu Scheduler
|
Memory Management Unit (Mmu)
|
Registers
|
None Of The Given Options
|
B |
| CS604 |
The Scheduling Of Are Done By The Operating System
|
Kernel Threads
|
User Level Threads
|
Both Kernel And User Level Thread
|
None Of The Give Option
|
A |
| CS604 |
The -----------Scheme Is Not Applicable To A Resource Allocation System With Multiple Instances Of Each Resource Type
|
Wait For Graph
|
Resource Allocation Graph
|
Both Resource-Allocation And Wait-For Graph
|
None Of The Given Options
|
A |
| CS604 |
The --------------Semaphore Provides Mutual Exclusion For Accesses To The Buffer Pool And Is Initialized To The Value 1
|
Mutex
|
Binary
|
Couting
|
None Of The Given Options
|
A |
| CS604 |
The Set Of All Physical Addresses Corresponding To The Logical Addresses Is A ----------------- Of The Process
|
Physical Address Space
|
Process Address Space
|
Logical Address Space
|
None Of The Given Options
|
A |
| CS604 |
The Shortest-Job-First Scheduling Algorithm Can Be
|
Preemptive Only
|
Non-Preemptive Only
|
Preemptive Or Non-Preemptive
|
None Of The Given Options
|
C |
| CS604 |
The Size Of A Page Is Defined By __________
|
Cpu
|
Page Table
|
Physical Memory
|
Logical Memory
|
A |
| CS604 |
The Size Of Pages And Frames Are Same In Logical Memory And Physical Memory Respectively
|
True
|
False
|
Na
|
Na
|
B |
| CS604 |
The Size Of Virtual Memory Depends On
|
The Size Of The Data Bus
|
The Size Of Main Memory
|
The Size Of Address Bus
|
None Of The Above
|
C |
| CS604 |
The Solution To Critical Section Problem Is : Mutual Exclusion Progress And Bounded Waiting
|
The Statement Is False
|
The Statement Is True
|
The Statement Is Contradictory
|
None Of The Above
|
B |
| CS604 |
The State Of A Process After It Encounters An I/O Instruction Is __________
|
Ready
|
Blocked/Waiting
|
Idle
|
Running
|
B |
| CS604 |
The Swap Instruction Which Is The Hardware Solution To Synchronization Problem Does Not Satisfy The __________ Condition Hence Not Considered To Be A Good Solution
|
Progress
|
Bounded Waiting
|
Mutual Exclusion
|
None Of The Given
|
B |
| CS604 |
The Time It Takes For The Dispatcher To Stop One Process And Start Another Running Is Known As The__________
|
Dispatch Latency
|
Scheduling
|
Context Switching
|
None Of The Given Options
|
A |
| CS604 |
The Time Taken By The Disk Arm To Locate The Specific Address Of A Sector For Getting Information Is Called __________
|
Rotational Latency
|
Seek Time
|
Search Time
|
Response Time
|
B |
| CS604 |
The Top-Down View Is That It Is A Program That Acts As An Intermediary Between A User Of A Computer And The Computer Hardware And Makes The Computer System Convenient To Use
|
True
|
False
|
Na
|
Na
|
A |
| CS604 |
The Translation Look Aside Buffer Is A Software Data Structure That Supports The Virtual Memory Address Translation Operation
|
True
|
False
|
Na
|
Na
|
F |
| CS604 |
The Two-Phase Locking Protocol Guarantees That Concurrent Transactions Are Deadlock-Free
|
True
|
False
|
Na
|
Na
|
B |