UGC-NET/GATE Multiple Choice Questions for Operating System.
Those processes should be aborted on occurrence of a deadlock, the termination of which:
is more time consuming
incurs minimum cost
safety is not hampered
all of the mentioned
User data are stored in
The problem of thrashing is affected significantly by:
all of the above
In Linux character device manager calls used to manage
Two ways to arrange multiple windows on the desktop are
drag and drop
point and click
cascade and tile
minimize and maximize
If each access to a file is controlled by a password, then the disadvantage is that:
user will need to remember a lot of passwords
it is not reliable
it is not efficient
all of the mentioned
The two methods how LRU page replacement policy can be implemented in hardware are:
RAM & Registers
Stack & Counters
Peter uses a Microsoft Windows 95 computer. What should he do to be able to administer domain user accounts from his computer?
install User Manager for Domains on his computer
install the Client-based Network Administration Tools on his computer
install Windows NT Server on his computer
install Windows NT Workstation on his computer
Processor wait ratio is given by..........
What type of addressing format is used by Class A network.
Which is the system call that is responsible for sending of SYN packets?
A memory buffer used to accommodate a speed differential is called
When a process begins execution with no pages in memory:
process execution becomes impossible
a page fault occurs for every page brought into memory
process causes system crash
none of the mentioned
The quality of service requirements are guaranteed in:
Best effort service
Worst effort service
In.......... allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy.
To resolve the problem of data representation on different systems RPCs define..........
machine dependent representation of data
machine representation of data
machine-independent representation of data
None of these
There are 16 questions to complete.