UGC-NET JULY 2016 PAPER 3 QUESTIONS WITH EXPLANATION
Q:: 51 Which of the following information about the UNIX file system is not correct ?
(1) Super block contains the number of i-nodes, the number of disk blocks, and the start
of the list of free disk blocks.
(2) An i-node contains accounting information as well as enough information to locate
all the disk blocks that holds the file’s data.
(3) Each i-node is 256-bytes long.
(4) All the files and directories are stored in data blocks.
Answer:: (3)
Q:: 52 Which of the following option with reference to UNIX operating system is not correct ?
(1) INT signal is sent by the terminal driver when one types <Control-C> and it is a
request to terminate the current operation.
(2) TERM is a request to terminate execution completely. The receiving process will
clean up its state and exit.
(3) QUIT is similar to TERM, except that it defaults to producing a core dump if not
caught.
(4) KILL is a blockable signal.
Answer:: (4)
Q:: 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 ?
(1) 16 (2) 15
(3) 32 (4) 30
Answer:: (4)
Q:: 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 ?
(1) 49 msec (2) 80 msec
(3) 48 msec (4) 100 msec
Answer:: (2)
Q:: 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.
(1) 2 (2) 4
(3) 5 (4) 6
Answer:: (4)
Q:: 56 Let L = {0n1n|n ≥ 0} be a context free language.
Which of the following is correct ?
(1) ~L is context free and Lk is not context free for any k ≥ 1.
(2) ~L is not context free and Lk is context free for any k ≥ 1.
(3) Both ~L and Lk is for any k ≥ 1 are context free.
(4) Both ~L and Lk is for any k ≥ 1 are not context free.
Answer:: (3)
Q:: 57 Given a Turing Machine
M = ({q0, q1, q2, q3}, {a, b}, {a, b, B}, δ, B, {q3})
Where δ is a transition function defined as
δ(q0, a) = (q1, a, R)
δ(q1, b) = (q2, b, R)
δ(q2, a) = (q2, a, R)
δ(q2, b) = (q3, b, R)
The language L(M) accepted by the Turing Machine is given as :
(1) aa*b (2) abab
(3) aba*b (4) aba*
Answer:: (3)
Q:: 58 Consider a discrete memoryless channel and assume that H(x) is the amount of
information per symbol at the input of the channel; H(y) is the amount of information per
symbol at the output of the channel; H(x|y) is the amount of uncertainty remaining on x
knowing y; and I (x; y) is the information transmission.
Which of the following does not define the channel capacity of a discrete memoryless
channel ?
(1) max I (x; y) (2) max [H(y) – H(y|x)]
p(x) p(x)
(3) max [H(x) – H(x|y)] (4) max H(x|y)
p(x) p(x)
Answer:: (4)
Q:: 59 Consider a source with symbols A, B, C, D with probabilities 1/2, 1/4, 1/8, 1/8 respectively. What is the average number of bits per symbol for the Huffman code generated from above information ?
(1) 2 bits per symbol (2) 1.75 bits per symbol
(3) 1.50 bits per symbol (4) 1.25 bits per symbol
Answer:: (2)
Q:: 60 Which of the following is used for the boundary representation of an image object ?
(1) Quad Tree (2) Projections
(3) Run length coding (4) Chain codes
Answer:: (4)
<<< 1 2 3 4 5 6 7 >>>
Q:: 51 Which of the following information about the UNIX file system is not correct ?
(1) Super block contains the number of i-nodes, the number of disk blocks, and the start
of the list of free disk blocks.
(2) An i-node contains accounting information as well as enough information to locate
all the disk blocks that holds the file’s data.
(3) Each i-node is 256-bytes long.
(4) All the files and directories are stored in data blocks.
Answer:: (3)
Q:: 52 Which of the following option with reference to UNIX operating system is not correct ?
(1) INT signal is sent by the terminal driver when one types <Control-C> and it is a
request to terminate the current operation.
(2) TERM is a request to terminate execution completely. The receiving process will
clean up its state and exit.
(3) QUIT is similar to TERM, except that it defaults to producing a core dump if not
caught.
(4) KILL is a blockable signal.
Answer:: (4)
Q:: 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 ?
(1) 16 (2) 15
(3) 32 (4) 30
Answer:: (4)
Q:: 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 ?
(1) 49 msec (2) 80 msec
(3) 48 msec (4) 100 msec
Answer:: (2)
Q:: 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.
(1) 2 (2) 4
(3) 5 (4) 6
Answer:: (4)
Q:: 56 Let L = {0n1n|n ≥ 0} be a context free language.
Which of the following is correct ?
(1) ~L is context free and Lk is not context free for any k ≥ 1.
(2) ~L is not context free and Lk is context free for any k ≥ 1.
(3) Both ~L and Lk is for any k ≥ 1 are context free.
(4) Both ~L and Lk is for any k ≥ 1 are not context free.
Answer:: (3)
Q:: 57 Given a Turing Machine
M = ({q0, q1, q2, q3}, {a, b}, {a, b, B}, δ, B, {q3})
Where δ is a transition function defined as
δ(q0, a) = (q1, a, R)
δ(q1, b) = (q2, b, R)
δ(q2, a) = (q2, a, R)
δ(q2, b) = (q3, b, R)
The language L(M) accepted by the Turing Machine is given as :
(1) aa*b (2) abab
(3) aba*b (4) aba*
Answer:: (3)
Q:: 58 Consider a discrete memoryless channel and assume that H(x) is the amount of
information per symbol at the input of the channel; H(y) is the amount of information per
symbol at the output of the channel; H(x|y) is the amount of uncertainty remaining on x
knowing y; and I (x; y) is the information transmission.
Which of the following does not define the channel capacity of a discrete memoryless
channel ?
(1) max I (x; y) (2) max [H(y) – H(y|x)]
p(x) p(x)
(3) max [H(x) – H(x|y)] (4) max H(x|y)
p(x) p(x)
Answer:: (4)
Q:: 59 Consider a source with symbols A, B, C, D with probabilities 1/2, 1/4, 1/8, 1/8 respectively. What is the average number of bits per symbol for the Huffman code generated from above information ?
(1) 2 bits per symbol (2) 1.75 bits per symbol
(3) 1.50 bits per symbol (4) 1.25 bits per symbol
Answer:: (2)
Q:: 60 Which of the following is used for the boundary representation of an image object ?
(1) Quad Tree (2) Projections
(3) Run length coding (4) Chain codes
Answer:: (4)
<<< 1 2 3 4 5 6 7 >>>
No comments:
Post a Comment