Question 1 |

Let G=(V, E) be a graph. Define \xi (G)=\sum_{d}i_{d}*d , where i_{d} is the number of
vertices of degree d in G. If S and T are two different trees with \xi (S)=\xi (T) , then

|S|= 2|T| | |

|S|=|T|-1 | |

|S|=|T| | |

|S|=|T|+1 |

Question 1 Explanation:

Question 2 |

Newton-Raphson method is used to compute a root of the equation x^{2} -13=0
with 3.5 as the initial value. The approximation after one iteration is

3.575 | |

3.676 | |

3.667 | |

3.607 |

Question 2 Explanation:

Question 3 |

What is the possible number of reflexive relations on a set of 5 elements?

2^{10} | |

2^{15} | |

2^{20} | |

2^{25} |

Question 3 Explanation:

Question 4 |

Consider the set S = {1, \omega ,\omega ^{2}}, where \omega and \omega ^{2} are cube roots of unity. If * denotes the multiplication operation, the structure (S, *) forms

A group | |

A ring | |

An integral domain | |

A field |

Question 4 Explanation:

Question 5 |

What is the value of \lim_{n\rightarrow \infty }(1-\frac{1}{n})^{2n}?

0 | |

e^{-2} | |

e^{-1/2} | |

1 |

Question 5 Explanation:

Question 6 |

The minterm expansion of f(P,Q,R)=PQ+QR'+PR' is

m_{2}+m_{4}+m_{6}+m_{7} | |

m_{0}+m_{1}+m_{3}+m_{5} | |

m_{0}+m_{1}+m_{6}+m_{7} | |

m_{2}+m_{3}+m_{4}+m_{5} |

Question 6 Explanation:

Question 7 |

A main memory unit with a capacity of 4 megabytes is built using 1Mx1-bit
DRAM chips. Each DRAM chip has 1K rows of cells with 1K cells in each row. The
time taken for a single refresh operation is 100 nanoseconds. The time required
to perform one refresh operation on all the cells in the memory unit is

100 nanoseconds | |

100 *2^{10} nanoseconds | |

100*2^{20} nanoseconds | |

3200*2^{20} nanoseconds |

Question 7 Explanation:

Question 8 |

P is a 16-bit signed integer. The 2's complement representation of P is (F87B)_{16}.
The 2's complement representation of 8*P is

(C3D8)_{16} | |

(187B)_{16} | |

(F878)_{16} | |

(987B)_{16} |

Question 8 Explanation:

Question 9 |

The Boolean expression for the output f of the multiplexer shown below is

\overline{P\bigoplus Q\bigoplus R} | |

P\bigoplus Q\bigoplus R | |

P+Q+R | |

\overline{P+Q+R} |

Question 9 Explanation:

Question 10 |

In a binary tree with n nodes, every node has an odd number of descendants.
Every node is considered to be its own descendant. What is the number of nodes
in the tree that have exactly one child?

0 | |

1 | |

(n-1)/2 | |

n-1 |

Question 10 Explanation:

There are 10 questions to complete.