|
CS604
|
A Solution To The Critical Section Problem Must Satisfy The Following Requirements
|
Progress
|
Mutual Exclusion
|
Bounded Waiting
|
All Of These
|
D
|
|
CS604
|
The Process Of Switching From One Process To Another Is Called Latency
|
True
|
False
|
Na
|
Na
|
B
|
|
CS604
|
In __________Addressing The Recipient Is Not Required To Name The Sender
|
Symmetric
|
Asymmetric
|
Both Symmetric And Asymmetric
|
None Of The Given Options
|
B
|
|
CS604
|
The Address Generated By The Cpu After Any Indexing Or Other Addressing-Mode Arithmetic Is Called A --------Address And The Address It Gets Translated To By The Mmu Is Called A ---------Address
|
Virtual Physical
|
Hexadecimal Binary
|
Valid Invalid
|
Physical Virtual
|
A
|
|
CS604
|
A Process That Has Finished Working As Well As Its Parent Process Has Also Finished Its Execution. In This State The Process A Will Be Called As ___________ Process
|
Child
|
Thread
|
Zombie
|
Fork
|
A
|
|
CS604
|
The Problem Of Fragmentation Arises In __________
|
Static Storage Allocation
|
Stack Allocation Storage
|
Stack Allocation With Dynamic Binding
|
Heap Allocation
|
D
|
|
CS604
|
__________ Is A Preemptive Scheduling Algorithm
|
First Come First Serve
|
Shortest Job First
|
Round Robin
|
None Of These
|
C
|
|
CS604
|
A ---------------- (Or An Exception) Is A Software-Generated Interrupt Caused Either By An Error (Division By Zero Or Invalid Memory Access) Or By A User Request For An Operating System Service
|
Interrupt
|
Trap
|
Signal
|
Process
|
B
|
|
CS604
|
The Execution Of Critical Sections Must Not Be Mutually Exclusive
|
True
|
False
|
Na
|
Na
|
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
|
When The Address Used In A Program Gets Converted To An Actual Physical Ram Address It Is Called ------------
|
Address Binding
|
Execution
|
Loading
|
Compiling
|
A
|
|
CS604
|
Race Conditions Cannot Occur On A Uniprocessor
|
True
|
False
|
Na
|
Na
|
B
|
|
CS604
|
The Multi-Level Feedback Queue (Mlfq) Scheduling Algorithm Is The Same As Shortest-Job-First
|
True
|
False
|
Na
|
Na
|
B
|
|
CS604
|
An Absolute Pathname Starts With The Root Directory (/) And A Relative Pathname Starts With Your Home Directory
|
True
|
False
|
Na
|
Na
|
A
|
|
CS604
|
A Pathname Is The List Of Directories Separated By ___________
|
#
|
$
|
&
|
/
|
D
|
|
CS604
|
In Allocation Scheme Free Frames Are Equally Divided Among Processes
|
Fixed Allocation
|
Proportional Allocation
|
Priority Allocation
|
None Of The Given Options
|
A
|
|
CS604
|
__________ Displays Information About The Top Processes
|
Is
|
Cs
|
Top
|
Cd
|
C
|
|
CS604
|
A Cpu Scheduling Algorithm Determines An Order For The Execution Of Its Scheduled Processes. Given N Processes To Be Scheduled On One Processor How Many Possible Different Schedules Are There? Give A Formula In Terms Of N
|
N(N-1)
|
N^2
|
N!
|
N/2
|
C
|
|
CS604
|
Multiprocessing Is
|
Same As Multitasking
|
Same As Multiprogramming
|
Multiuser
|
Involves Using More Than One Processor At The Same Time
|
D
|
|
CS604
|
Progress And Bounded Waiting Are Some Of The Characteristics To Solve The Critical Section Problems
|
True
|
False
|
Na
|
Na
|
A
|