CS604
|
Pcb Is Called To
|
Program Control Block
|
Process Control Block
|
Process Communication Block
|
None Of The Above
|
B
|
CS604
|
Database Complier Video Games Are Examples Of __________
|
Hardware
|
Application
|
Operating System
|
Users
|
B
|
CS604
|
Operating System Is Manages The Use Of Hardware Among The Various Application Programs For The Users
|
True
|
False
|
Na
|
Na
|
A
|
CS604
|
__________ Is Also Called Swapper
|
Long Term
|
Short Term
|
Medium Term
|
Swap Space
|
C
|
CS604
|
A Critical Region
|
Is A Piece Of Code Which Only One Process Executes At A Time
|
Is A Region Prone To Deadlock
|
Is A Piece Of Code Which Only A Finite Number Of Processes Execute
|
Is Found Only In Windows Nt Operation System
|
A
|
CS604
|
In Accessing A Disk Block The Longest Delay Is Due To
|
Rotation Time
|
Seek Time
|
Transfer Time
|
Clock Speed
|
B
|
CS604
|
A Tree Sturctured File Directory System
|
Allows Easy Storage And Retrieval Of File Names
|
Is A Much Debated Unecessary Feature
|
Is Not Essential When We Have Millions Of Files
|
None Of The Above
|
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
|
Which Of The Following Memory Allocation Scheme Suffers From External Fragmentation?
|
Segmentation
|
Pure Demand Paging
|
Swapping
|
Paging
|
A
|
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
|
The Following Is Not A Classical Problem Of Synchronization
|
Bounded Buffer Problem
|
Reader Writer Problem
|
Dining Philosopher"S Problem
|
Counting Semaphore Problem
|
D
|
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
|
---------Holds The Smallest Legal Physical Memory Address For A Process
|
Base Register
|
Limit Register
|
Index Register
|
Stack Pointers Register
|
A
|
CS604
|
A Page Fault Occurs
|
When The Page Is Not In The Memory
|
When The Page Is In The Memory
|
When The Process Enters The Blocked State
|
When The Process Is In The Ready State
|
A
|
CS604
|
When Process Opens Its First File Explicitly It Will Get Descriptor Number
|
1
|
2
|
3
|
4
|
C
|
CS604
|
In Indirect Inter Process Communication A Sendermention The Name Of The Recipient.
|
Do
|
Do Not
|
May
|
May Not
|
B
|
CS604
|
The Creating Process Is Called A--------------- Process While The New Processes Are Called The -------------- Of That Process
|
None Of The Given Options
|
Children Parent
|
Parent Children
|
Zombie Single
|
C
|
CS604
|
Cryptography Technique Is Used In __________
|
Polling
|
Job Scheduling
|
Protection
|
File Management
|
C
|
CS604
|
Binary Semaphores Are Those That Have Only Two Values__________
|
0 And N
|
0 And 0
|
0 And 1
|
None Of The Given Options
|
C
|
CS604
|
--------------- Indicates Size Of The Page Table
|
Translation Look-Aside Buffers
|
Page-Table Base Register (Ptbr)
|
Page-Table Length Register (Ptlr)
|
Page Offset
|
C
|