Which of the following is not  a characteristics of real time system....................

a.It is well-defined fixed time constraints

b.It guarantees completion of tasks in maximum time

c. it consists of collection of processors

ans: c

Which of the following is not a feature of distributed system....................

a.Processing must be done within defined constraint or system will fail

b.It consist of collection of processors

c.Processor communication with one another through high speed buses

ans: a

The dual mode operation of operating system is .....................

a.It provides multiple memory bank

b.It provide multiple i/o features

c.It provides the means for protecting the o/s from errant user from one another

ans: c

Which of the following is not a hardware protection of o/s...........................

a.CPU protection

b.Dual mode operation

c.I/O protection

ans: b

System call is defined as .......................

a.It provides interface between peripheral

b.It provides interface between process & o/s

c.It provides interface between i/o & memory

ans: b  

Static binding occurs at ......................

a.Compilation time

b.Run time

c.Program storage time

ans: a

Dynamic binding occurs at ...................

a.Compilation time

b.Run time

c.Data transfer time

ans: b

Directory can be defined as..................

a.It is a file contains directory entries

b.It is a location in buffer

c.It stores program

ans: a

What is the name given to all the programs inside the computer which makes it usable?

a.Application software

b.System software

c.Firmware

ans: b

A front-end processor is usually used in.....................

a.Multi-programming

b.Virtual storage

c.Time sharing

ans: a

Two different time values supported by UNIX is..................

a.Clock time execution time

b.Calendar time process time

c.Access time execution to program

ans: b

The problem of thrashing is affected significantly by......................

a.Program structure

b.Program size

c.Primary storage size

ans: a

Which policy replace a page if it is not in the favoured subset of a process pages?........

a.Working set

b.FIFO

c.LIFO

ans: a

What problem is solved by Dijkstra's bankers algorithm?.........

a.Deadlock prevention

b.Deadlock avoidance

c.Deadlock recovery

ans: a

Moving process from main memory to disk is called......................

a.Swapping

b.Spooling

c.scheduling

ans:b