CPU Scheduler
Loader
Dispatcher
Compiler
A. CPU Scheduler
MS DOS,8K
Linux ,1024
Linux, 512
Unix, 512
Transfer system files after format
Do not check/scan surface after format
Destroys every byte of data on a disk by overwriting it with with blank spaces
All of above
Existance of multuple computer visible and a provide a single system image to its users.
It runs the program transparently.
It is a technique to shift the program to other computer.
It is technique in which local procedures and remote procedures are indistinguishable to programmers.
DMA
Daisy chain arbitration
polling
none of these
Start -> setting -> font
Start -> control panel -> font -> install new font
Start -> setting -> control panel -> font -> install new font
Start -> setting -> control panel -> font
The time taken by the dispatcher to stop one process and start another
The whole time taken by all processor
The time taken by the processor to write a file into disk
None of Above
COMMANCOM
START.COM
VER.COM
TREE.COM
Operating system
Memory manager
Database administrator
RAM
dot, one or more
dash, only one
dash, one or more
dot,only two
not well separated.
well separated
independent
dependent
Taskbar
Desktop
My computer
Recycle bin
Device setting
Run applications
All of above
Turn off the system
su-pwd
su-pd
su - userID
Sue- ID
Bankers algorithm
Resource Allocation Graph
semaphores
all of these
Source
Sub directory
Destination.
Path name
Static
Dynamic
Deterministic
Probabilistic
Scalability
Reliability
Flexibility
Fault tolerance
Edit
Label
Sys
All of above
Start menu
Dialog boxes
Taskbar
All of above
Explicit replication
Implicit replication
Lazy file replication
Group file replication
Parallel Virtual Machine
Parallel Virtual Message
Process Virtual Machine
Process Virtual Monitor
Start menu
Standard menu
System menu
None of the above
Selection of a process to be migrated
Selection of destination system or node
Actual transfer of the selected process to the destination system or node
All A, B, C
Buffering
Blocking
Message-passing
False sharing
Cache memory
Paging
Virtual memory
Associative memory
kernel
lower-level layers
higher-level layers
all of these
availability
confidentiality
integrity
authenticity
Dialog box
Task bar
Start menu
All of the above
64K
32K
1024K
112K
The system should not enter a state in which nodes spend all their time migrating processes or exchanging control messages without doing any useful work.
The system should be able to handle small and large networked systems.
The algorithm should not be affected by the crash of one or more nodes in the system.
The process assignment decisions should be based on the current load of the system and not on some fixed static policy.