1 |
Banker's algorithm deals with |
Dead lock prevention
Dead lock avoidance
Dead look recovery
Mutual exclusion
|
2 |
A series of statements explaining how the data is to be processed is called. |
Instruction
Compiler
Program
Interpretor
|
3 |
Daisy chain is a device for |
Connecting a number of controllers to a device
Connecting a number of device to a controller
all of above
None of above
|
4 |
Dijkstra's algorithm deals with |
Mutual exclusion
Dead lock avoidance
Dead lock recovery
Real time processing
|
5 |
Remote computing services involves the use of time sharing and |
Multiprocessing
Interactive processing
Batch processing
Real time processing
|
6 |
Four necessary conditions for dead lock are none pre emption circular wait and |
Mutual exclusion
Race condition
Buffer overflow
None of above
|
7 |
Poor response times are caused by |
Busy processor
High I/O rate
High paging rates
any of above
|
8 |
Dynamic allocation of storage areas with VSAM files is accomplished by |
Hashing
Control splits
Over flow areas
Relative recording
|
9 |
To avoid the race condition the number of process that may be simultaneously inside the critical section is |
1
3
0
12
|
10 |
Which of the following does not interrupt an running process. |
A device
Timer
Scheduler process
Power failure
|
11 |
Which process is known for initializing a microcomputer with its OS. |
Cold booting
Boot recording
Booting
Warm booting
|
12 |
Which operating system use write through catches. |
UNIX
XENIX
ULTRIX
DOS
|
13 |
Creating a job queue is a function of |
Spooler
Interpolator
Complier
Drive
|
14 |
A high paging rate |
May cause a high I/O rate
Keeps the system running well
Is a symptom of too much processor activity
Always creates a slow system.
|
15 |
A publics key encryption system. |
Allows only the correct sender to decode the data
Allows only the correct receiver to decode the data
Allows any one to decode the data
None of above
|
16 |
Fragmentation of a file system. |
Occurs only is file is not used properly
Can always the prevented
Happens in all file systems.
Can be removed by conmpaction
|
17 |
Shortest job First executes first the job. |
With the least processor needs
That first entered the queue
That has been in the queue for the longest
That last entered the queue
|
18 |
A thread is. |
Lightweight process where the context switching is low
Lightweight process where the context switching is high
Used to speed up paging
Used in dead locks
|
19 |
Multiprogramming system |
Are easier to develop than signal programming system.
Execute each job faster
Execute more jobs in the same time
Are used only on large main frame computers.
|
20 |
What the name given to the values that are automatically provided by software to reduce keystrokes and improve a computer users productivity. |
Defined values
Fixed values
Default values
None of the above
|
21 |
The part of machine level instruction which tells the central processor what has to be done is. |
Operation code
Address
Locator
Flip flop
|
22 |
Which technique is used by operating systems to execute several program concurrently by switching back and forth. |
Partitioning
Multitasking
Windowing
Paging
|
23 |
Problem of thrashing is affected significantly by |
Program structure
Program size
Primary storage size
All of above
|
24 |
Macintosh computer uses |
System 7.0
AU/X
Xenix
None
|
25 |
Which operating system reacts in the acutal time. |
Batch system
Quick response system
Real time system
Time sharing system
|
26 |
Reference bit is used for |
Implementing LRU page replacement algorithm
Implementing NRU algorithm
To check the page table entry in the cache memory
None of above
|
27 |
Which is signal user operating system. |
MS-DOS
UNIX
XENIX
LINUX
|
28 |
In which scheduling policies context switching never takes place |
FCFS
Round robin
Shortest job first
Pre empitive
|
29 |
For multiprogramming operating system. |
Special support from processor is essential
Special support from processor is not essential
Cache memory is essential
None of abvoe
|
30 |
Semaphores are used to solve the problem of. |
Race condition
Process synchronization
Mutual exclusion
Belady problem
|