PREVIOUS YEAR SOLVED PAPERS - July 2016 Paper 3

51. Which of the following information about the UNIX file system is not correct?

  • Option : C
  • Explanation :
    UNIX file system:
  • Super block contains the number of i-nodes, the number of disk blocks, and the start of the list of free disk blocks.Correct
  • An i-node contains accounting information as well as enough information to locate all the disk blocks that holds the file’s data.Correct
  • All the files and directories are stored in data blocks.Correct
  • Each i-node is 256-bytes long.Incorrect.It is 128 byte long.
  • So, option (C) is correct.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


52. Which of the following option with reference to UNIX operating system is not correct?

  • Option : D
  • Explanation :
    In UNIX operating system:
  • INT signal is sent by the terminal driver when one types and it is a request to terminate the current operation.Correct
  • TERM is a request to terminate execution completely. The receiving process will clean up its state and exit.Correct
  • QUIT is similar to TERM, except that it defaults to producing a core dump if not caught.Correct
  • kILL is not a blockable signal.
  • So, option (D) is correct.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


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 ?

  • Option : D
  • Explanation :
    We have 16 x 16 grid, There will be (M - 1) * (N - 1) hops for M * N grid. In the given question M = N. # of hops = (M - 1) * (M - 1) = 2 * (M - 1) = 2 * (16 - 1) = 2 * 15 = 30 hops. So, option (D) is correct.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


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 ?

  • Option : B
  • Explanation :
    According to given question 1K RPC takes - 1.5 * 32 + 1.0 = 49.0 msec 32 1K RPC will take: 1.5 * 32 + 1.0 * 32 = 80.0 msec So, option (B) is correct.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


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.

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


Related Quiz.
July 2016 Paper 3