|
CS604
|
Address Binding Will Be At In Multiprogramming With Fixed Tasks (Mft)
|
Run Time
|
Load Time
|
Dynamic Time
|
None Of The Given Options
|
B
|
|
CS604
|
The Execution Of Critical Sections Must Not Be Mutually Exclusive
|
True
|
False
|
Na
|
Na
|
B
|
|
CS604
|
I Mb Or 1 Megabyte Is Equivalent To__________
|
1024 Bytes
|
1024^2 Bytes
|
1024^3 Bytes
|
1000000 Bytes
|
B
|
|
CS604
|
The Integer Value Of __________Semaphores Can Range Over An Unrestricted Integer Domain
|
Counting
|
Binary
|
Mutex
|
Bounded Buffer
|
A
|
|
CS604
|
A 20-Bit Address Bus Allows Access To A Memory Of Capacity
|
1 Mb
|
2 Mb
|
32 Mb
|
64 Mb
|
A
|
|
CS604
|
The Process Of Switching From One Process To Another Is Called__________
|
Context Switching
|
Scheduling
|
Quantum Period
|
Latency
|
A
|
|
CS604
|
Thrashing Will Never Be A Problem If The System Has 1 Gb Of Real Memory
|
True
|
False
|
Na
|
Na
|
F
|
|
CS604
|
Distributed Os Works On The __________ Principle
|
File Foundation
|
Single System Image
|
Multi System Image
|
Networking Image
|
B
|
|
CS604
|
The Major Criterion In The Selection Of A Particular Algorithm Is That We Want To
|
Minimize The Number Of Page Faults
|
Increase Efficiency
|
Reduce Running Time Of Page Replacement Algorithm
|
Maximize The Number Of Page Faults
|
A
|
|
CS604
|
The ----- Is A Single Program That Produces An Object File
|
Linker
|
Compiler
|
Loader
|
Text Editor
|
B
|
|
CS604
|
First Entries In Per Process File Descriptor Table Are Used As Soon As The Process Is Created
|
1
|
2
|
3
|
4
|
D
|
|
CS604
|
Mach Macos X Server Qnx Os/2 And Windows Nt Are Examples Of Os Based On
|
Layered
|
Micro Kernal
|
Virtual Machine
|
None Of The Given
|
B
|
|
CS604
|
The Home Directory For Superuser In Linux And Unix Is
|
/Home
|
/Root
|
Both A And B
|
None Of The Given
|
B
|
|
CS604
|
User Goal Of Os Is That It Easy To Use Reliable Safe And Fast
|
True
|
False
|
Na
|
Na
|
A
|
|
CS604
|
Which Of The Following Is A Criterion To Evaluate A Scheduling Algorithm?
|
Cpu Utilization: Keep Cpu Utilization As High As Possible
|
Throughput: Number Of Processes Completed Per Unit Time
|
Waiting Time: Amount Of Time Spent Ready To Run But Not Running
|
All Of The Above
|
D
|
|
CS604
|
Assume A Logical Address Space Of 16 Pages Each Of 1024 Words Each Mapped Into A Physical Memory Of 32 Frames. Each Word Consists Of 2 Bytes. What Will Be The Total Number Of Bits Required For F (Frames)?
|
5
|
6
|
7
|
8
|
A
|
|
CS604
|
Semaphores Are Used To Solve The Problem Of
|
Race Condition
|
Process Synchronization
|
Both Of Above
|
None Of The Above
|
B
|
|
CS604
|
A Major Problem With Priority Scheduling Algorithms Is
|
Deadlock
|
Aging
|
Starvation
|
None Of The These
|
C
|
|
CS604
|
48) ___________ Is The Situation In Which A Process Is Waiting On Another Process Which Is Also Waiting On Another Process ... Which Is Waiting On The First Process. None Of The Processes Involved In This Circular Wait Are Making Progress
|
Deadlock
|
Starvation
|
Dormant
|
None Of The Above
|
A
|
|
CS604
|
Hardware Provide Basic Computing Resource
|
True
|
False
|
Na
|
Na
|
A
|