1. An example of a distributed OS is
a.) Amoeba
b.) Unix
c.) Microsoft DOS
d.) Multics
Ans.: a.)
2. In process management, Round-Robin is essentially the pre-emptive mechanism of
a.) FILO
b.) FIFO
c.) SSF
d.) LTF
Ans.: b.)
3. Which of the following treats hardware as a file system
a.) DOS
b.) UNIX
c.) Windows NT
d.) Linux
Ans.: b.)
4.) Find the pre-emptive scheduling algorithm from the following
a.) Round robin technique
b.) Priority based
c.) Shortest job first
d.) Shortest job next
Ans.: a.)
5.) The directory found in most UNIX systems is
a.) waitpid
b.) brk
c.) unmap
d.)usr
Ans.: d.)
6.) The storage replacement strategy program placed in the largest hole in memory is
a.)Best fit
b.) First fit
c.) Worst fit
d.) Conference fit
Ans.: c.)
7. Banker's algorithm is used for
a.) Deadlock recovery
b.) Deadlock avoidance
c.) Deadlock prevention
d.) Deadlock comparison
Ans.: b.)
8.) Peer hole optimization is an example of
a.) Local optimization
b.) Laptop optimization
c.) Data flow analysis
d.) Constant folding
Ans.: d.)
9.) A software used to create job queue is
a.) Linkage editor
b.) Interpreter
c.) Caller
d.) Spooler
Ans.: d.)
10.) Loading an OS from secondary memory to primary memory
a.) Compiling
b.) Booting
c.) Refreshing
d.) Recovering
Ans.: b.)
11.) A page fault
a.) is an error specific page.
b.) is an acess to the page not currently in memory.
c.) occur when a page program occur in a page memory.
d.) pages used in previous page referencee.
Ans.: b.)
12.) Moving process from main memory to disk is called
a.) Caching
b.) Swapping
c.) Termination
d.) Interruption
Ans.: b.)
13.) Windows is
a.) Real time
b.) Multi-user
c.) Multi-structured
d.) Pre-emptive
Ans.: d.)
14.) The page replacement policy that suffers from belady's anamoly is
a.) LRV
b.) FIFO
c.) LFU
d.) OPTIMAL
Ans.: b.)
15.) Cache memory is
a.) High speed register
b.)Low speed RAM
c.) Non-Volatile ram
d.)High speed RAM
Ans.: d.)
a.) Amoeba
b.) Unix
c.) Microsoft DOS
d.) Multics
Ans.: a.)
2. In process management, Round-Robin is essentially the pre-emptive mechanism of
a.) FILO
b.) FIFO
c.) SSF
d.) LTF
Ans.: b.)
3. Which of the following treats hardware as a file system
a.) DOS
b.) UNIX
c.) Windows NT
d.) Linux
Ans.: b.)
4.) Find the pre-emptive scheduling algorithm from the following
a.) Round robin technique
b.) Priority based
c.) Shortest job first
d.) Shortest job next
Ans.: a.)
5.) The directory found in most UNIX systems is
a.) waitpid
b.) brk
c.) unmap
d.)usr
Ans.: d.)
6.) The storage replacement strategy program placed in the largest hole in memory is
a.)Best fit
b.) First fit
c.) Worst fit
d.) Conference fit
Ans.: c.)
7. Banker's algorithm is used for
a.) Deadlock recovery
b.) Deadlock avoidance
c.) Deadlock prevention
d.) Deadlock comparison
Ans.: b.)
8.) Peer hole optimization is an example of
a.) Local optimization
b.) Laptop optimization
c.) Data flow analysis
d.) Constant folding
Ans.: d.)
9.) A software used to create job queue is
a.) Linkage editor
b.) Interpreter
c.) Caller
d.) Spooler
Ans.: d.)
10.) Loading an OS from secondary memory to primary memory
a.) Compiling
b.) Booting
c.) Refreshing
d.) Recovering
Ans.: b.)
11.) A page fault
a.) is an error specific page.
b.) is an acess to the page not currently in memory.
c.) occur when a page program occur in a page memory.
d.) pages used in previous page referencee.
Ans.: b.)
12.) Moving process from main memory to disk is called
a.) Caching
b.) Swapping
c.) Termination
d.) Interruption
Ans.: b.)
13.) Windows is
a.) Real time
b.) Multi-user
c.) Multi-structured
d.) Pre-emptive
Ans.: d.)
14.) The page replacement policy that suffers from belady's anamoly is
a.) LRV
b.) FIFO
c.) LFU
d.) OPTIMAL
Ans.: b.)
15.) Cache memory is
a.) High speed register
b.)Low speed RAM
c.) Non-Volatile ram
d.)High speed RAM
Ans.: d.)
No comments:
Post a Comment