Online Exam Preparation

MCQs Library

Browse subject-wise multiple choice questions, review answers quickly, and start a test from the same section.

Course Codes

Select a course to load its MCQs.

Selected: CS604 381 MCQs
CS101 533 CS201 225 CS301 232 CS302 174 CS304 192 CS401 224 CS402 258 CS403 228 CS408 113 CS411 121 CS502 249 CS504 268 CS601 679 CS604 381 CS605 261 CS607 184 CS609 230 CS610 300 CS614 100 CS703 65

Questions

Showing page 8 of 20

Code Question Option A Option B Option C Option D Answer
CS604
In Accessing A Disk Block The Longest Delay Is Due To
Rotation Time
Seek Time
Transfer Time
Clock Speed
B
CS604
In Allocation Scheme Free Frames Are Equally Divided Among Processes
Fixed Allocation
Proportional Allocation
Priority Allocation
None Of The Given Options
A
CS604
In Allocation Scheme Number Of Frames Allocated To A Process Is Proportional To Its Size
Fixed Allocation
Proportional Allocation
Priority Allocation
None Of The Given Options
B
CS604
In Case Of Thrashing If Cpu Utilization Is Too Low The Operating System The Degree Of Multiprogramming
Increases
Decreases
Sometimes Increases And Sometimes Decreases
None Of The Given Options
A
CS604
In Deadlock Detection And Recovery Algorithm A Deadlock Exists In The System If And Only If The Wait For Graph Contains A __________
Cycle
Graph
Edge
Node
A
CS604
In Indirect Inter Process Communication A Sender __________ Mention The Name Of The Recipient
Does
Does Not
May
May Not
B
CS604
In Indirect Inter Process Communication A Sendermention The Name Of The Recipient.
Do
Do Not
May
May Not
B
CS604
In Layered Approach Of Os Lowest Layer Is Known As __________
Software Layer
Hardware Layer
Lower Level Layer
None Of The Given
B
CS604
In Layered Approach Of Os The Layer Highest Layer Is User Interface Layer
True
False
Na
Na
A
CS604
In Linux Directory Structure There Is __________ Root Directory
1
2
3
4
A
CS604
In Os The Response Time Is Very Critical
Multitasking
Batch
Online
Real-Time
D
CS604
In Overlay Technique We Can Overload Any Part Of The Program With The Part Of The Program Required Needed Recently
True
False
Na
Na
B
CS604
In Paged Segmentation We Divide Every Segment In A Process Into Pages
Fixed Size
Variable Size
Both A And B
None Of These
A
CS604
In Pages Segmentation The Logical Address Is Legal If D Is ___________Segment Length
Less Than
Greater Than
Equal To
Greater Than Or Equal To
A
CS604
In Paging Systems External Fragmentation Cannot Occur
True
False
Na
Na
A
CS604
In Priority Scheduling A Priority Number Is Associated With Each Process. The Cpu Is Allocated To The Process With The Highest Priority. The Problem Of Starvation ? Low Priority Processes May Never Execute Is Resolved By__________
Terminating The Process
Aging
Mutual Exclusion
Semaphore
B
CS604
In Real Time Operating Systems Which Of The Following Is The Most Suitable Scheduling Scheme?
Round- Robin
Fcfs
Pre-Emptive Scheduling
Random Scheduling
C
CS604
In Resource Allocation Graph A Pi ?Rj Indicates That Process Pi May Request Resource Rj At Some Time In The Future
Claim Edge
Request Edge
Assignment Edge
Allocation Edge
A
CS604
In Shortest Job First Algorithm Cpu Schedule Process According To The
Priority Wise
Cpu Burst
Distribute Cpu Resources Equally Among All Processes
All Of These
B
CS604
In Swapping Technique Of Memory Management The Total Amount Transfer Time Is Directly Proportional To The ___________
Amount Of Memory Swapped
Amount Of Space On Backing Store
Space On Main Memory
All The Given Options Are Correct
A