UGC NET CS 2014 Dec - II

Question 21

The directory can be viewed as ________ that translates filenames into their directory entries

• Symbol table
• Partition
• Swap space
• Cache

Question 22

Consider a two dimensional array A[20][10]. Assume 4 words per memory cell, the base address of array A is 100, elements are stored in row-major order and first element is A[0][0]. What is the address of A[11][5] ?

• 560

• 460

• 570

• 575

Question 23

A full binary tree with n leaves contains

• n nodes
• log ₂ n nodes
• 2n –1 node
• 2 ⁿ nodes

Question 24

The period of a signal is 10 ms. What is its frequency in Hertz?

• 10
• 100
• 1000
• 10000

Question 25

In a classful addressing, first four bits in Class A IP address is

• 1010
• 1100
• 1011
• 1110
• (A) , (B), (C) and (D) are wrong.

Question 26

Which of the following algorithm(s) is/are a broadcast routing algorithm?

• Flooding
• Multidestination routing
• Reverse path forwarding
• All of the above

Question 27

An analog signal has a bit rate of 6000 bps and a baud rate of 2000 baud. How many data elements are carried by each signal element?

• 0.336 bits/baud
• 3 bits/baud
• 120,00,000 bits/baud
• None of the above

Question 28

How many distinct stages are there in DES algorithm, which is parameterized by a 56-bit key?

• 16
• 17
• 18
• 19

Question 29

Shift-Reduce parsers perform the following:

• Shift step that advances in the input stream by K(K > 1) symbols and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol.
• Shift step that advances in the input stream by one symbol and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol.
• Shift step that advances in the input stream by K(K = 2) symbols and Reduce step that applies a completed grammar rule to form a single tree
• Shift step that does not advance in the input stream and Reduce step that applies a completed grammar rule to form a single tree.

Question 30

Which of the following is true?

• Canonical LR parser is LR (1) parser with single look ahead terminal
• All LR(K) parsers with K > 1 can be transformed into LR(1) parsers.
• Both (A) and (B)
• None of the above