July 2016 - Paper 3

51:   Which of the following information about the UNIX file system is not correct ?
A.
Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks.
B.
An i-node contains accounting information as well as enough information to locate all the disk blocks that holds the file’s data.
C.

Each i-node is 256-bytes long.

D.

All the files and directories are stored in data blocks.

 
 

Option: C

Explanation :

Click on Discuss to view users comments.

Write your comments here:



52:   Which of the following option with reference to UNIX operating system is not correct ?
A.
INT signal is sent by the terminal driver when one types <Control-C> and it is a request to terminate the current operation.
B.
TERM is a request to terminate execution completely. The receiving process will clean up its state and exit.
C.

QUIT is similar to TERM, except that it defaults to producing a core dump if not caught.

D.

KILL is a blockable signal.

 
 

Option: D

Explanation :

Click on Discuss to view users comments.

Write your comments here:



53:  

A multicomputer with 256 CPUs is organized as 16 × 16 grid. What is the worst case delay (in hops) that a message might have to take ?

A.

16

B.

15

C.

32

D.

30

 
 

Option: D

Explanation :

It passes through 2(N-1) = 2(16-1) = 30 hops

Click on Discuss to view users comments.

Write your comments here:



54:  

Suppose that the time to do a null remote procedure call (RPC) (i.e. 0 data bytes) is 1.0 msec, with an additional 1.5 msec for every 1K of data. How long does it take to read 32 K from the file server as 32 1K RPCs ?

A.

49 msec

B.

80 msec

C.

48 msec

D.

100 msec

 
 

Option: B

Explanation :

A single 32K RPC takes 1.5*32 + 1.0 = 49.0 msec
 
32 1K RPCs take 1.5*32 + 1.0*32 = 80.0 msec

Click on Discuss to view users comments.

Write your comments here:



55:  
Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has _____ equivalence classes.
A.

2

B.

4

C.

5

D.

6

 
 

Option: D

Explanation :

Click on Discuss to view users comments.

Write your comments here: