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 |
Database Complier Video Games Are Examples Of __________
|
Hardware
|
Application
|
Operating System
|
Users
|
B |
| CS604 |
Deadlock Detection And Recovery Technique Is Exactly Similar To Deadlock Avoidance Technique To Handle Deadlock In The System
|
True
|
False
|
Na
|
Na
|
A |
| CS604 |
Deadlock Is A Situation In Which Two Or More Processes (Or Threads) Are Waiting For An Event That Will Occur In The Future
|
True
|
False
|
Na
|
Na
|
F |
| CS604 |
Deadlocks Can Be Described More Precisely In Terms Of A Directed Graph Called A System ----------
|
Directed Graph
|
Critical Path
|
Resource Allocation Graph
|
Mixed Graph
|
C |
| CS604 |
Demand Paging Requires The Programmer To Take Specific Action To Force The Operating System To Load A Particular Virtual Memory Page
|
True
|
False
|
Na
|
Na
|
F |
| CS604 |
Dijkstra’S Baking Algorithm In An Operating System Solves The Problem Of
|
Deadlock Avoidance
|
Deadlock Recovery
|
Mutual Exclusion
|
Context Switching
|
A |
| CS604 |
Distributed Os Works On The __________ Principle
|
File Foundation
|
Single System Image
|
Multi System Image
|
Networking Image
|
B |
| CS604 |
Dos Is Single User Operating System
|
True
|
False
|
Na
|
Na
|
A |
| CS604 |
Each Page Is A Power Of -------- Bytes Long In Paging Scheme
|
2
|
3
|
4
|
5
|
C |
| CS604 |
Each Process Must First Request Permission To Enter Its Critical Section. The Section Of Code Implementing This Request Is Called The __________
|
Entry Section
|
Critical Section
|
Remainder Section
|
None Of All These
|
A |
| CS604 |
Every --------------Generated By The Cpu Is Divided Into Two Parts: A Page Number (P) And A Page Offset (D)
|
Page
|
Process Address Space
|
Logical Address
|
Physical Address
|
C |
| CS604 |
External Fragmentation Can Be Prevented (Almost Completely) By Frequent Use Of Compaction But The Cost Would Be Too High For Most Systems
|
True
|
False
|
Na
|
Na
|
T |
| CS604 |
Fifo Page Replacement Algorithm Has The Lowest Page Fault Rate
|
True
|
False
|
Na
|
Na
|
B |
| CS604 |
Fifo Scheduling Is __________
|
Preemptive Scheduling
|
Non Preemptive Scheduling
|
Deadline Scheduling
|
Fair Share Scheduling
|
B |
| CS604 |
Files That Start With A -------- In Unix/Linux Directory Structure Are Known As Hidden Files
|
. (Dot)
|
# ( Hash )
|
/ (Slash)
|
~ (Tilt)
|
A |
| CS604 |
First Entries In Per Process File Descriptor Table Are Used As Soon As The Process Is Created
|
1
|
2
|
3
|
4
|
D |
| CS604 |
First-Come First-Served (Fcfs) Is A --------------Scheduling Algorithm
|
Preemptive
|
Non-Preemptive
|
Both Preemptive And Non- Preemptive
|
None Of The Given Options
|
B |
| CS604 |
Following Are The Advantages Of Virtual Memory Except
|
Efficient Process Creation
|
Concept Of Memory Mapped Files
|
Low Cpu Consumption
|
Running Large Sized Processes
|
C |
| CS604 |
Following Is Not True About Virtual Memory
|
Virtual Memory Help In Executing Bigger Programs Even Greater In Size That Of Main Memory
|
Virtual Memory Makes The Processes To Stuck When The Collective Size Of All The Processes Becomes Greater Than The Size Of Main Memory
|
Virtual Memory Also Allows Files And Memory To Be Shared By Several Different Processes Through Page Sharing
|
Virtual Memory Makes The Task Of Programming Easier Because The Programmer Need Not Worry About The Amount Of Physical Memory
|
B |
| CS604 |
Following Schemes Allow Efficient Implementations Of Page Tables Except
|
Hashed Page Table
|
Hierarchical / Multilevel Paging
|
Inverted Page Table
|
Binary Page Table
|
D |