Recent questions tagged ugcnetcse-dec2012-paper2

3 votes
1 answer
3
Match the following :$\begin{array}{clcl} \text{a.} & \text{TTL} & \text{i.} & \text{High fan out} \\ \text{b.} & \text{ECL} & \text{ii.} & \text{Low propagation delay}...
1 votes
2 answers
8
Data Encryption Techniques are particularly used for _____protecting data in Data Communication Systemreduce Storage Space Requirementenhances Data Integritydecreases Dat...
0 votes
1 answer
9
0 votes
1 answer
10
Enumeration is a process ofDeclaring a set of numbersSorting a list of stringsAssigning a legal values possible for a variableSequencing a list of operators
0 votes
2 answers
11
Given an empty stack, after performing push(1), push(2), pop, push(3), push(4), pop, pop, push(5), pop, what is the value of the top of the stack?4321
0 votes
1 answer
12
Match the following with respect to $\text{C++}$ data types :$\begin{array}{clcl} \text{a.} & \text{User defined type} & \text{i.} & \text{Qualifier} \\ \text{b.} & \tex...
0 votes
1 answer
13
Match the following $\textsf{IC}$ families with their basic circuits :$\begin{array}{clcl} \text{a.} & \text{TTL} & \text{i.} & \text{NAND} \\ \text{b.} & \text{ECL} & \...
0 votes
1 answer
14
4 votes
2 answers
15
The maximum number of keys stored in a B-tree of order $m$ and depth $d$ is$m^{d +1}-1$$\frac{m^{d+1}-1}{m-1}$$(m-1)(m^{d+1}-1)$$\frac{m^d-1}{m-1}$
1 votes
1 answer
16
Consider the tree given below:Using the property of eccentricity of a vertex, find every vertex that is the centre of the given tree:d & hc & kg, b, c, h, i, mc & h
0 votes
1 answer
19
1 votes
2 answers
21
Which of the following is true while converting CFG to an LL(1) grammar?Removing left recursion aloneFactoring the grammar aloneRemoving left recursion and factoring the ...
0 votes
1 answer
22
0 votes
1 answer
23
A hash function $f$ defined as $f (key) = key \mod 13$, with linear probing is used to insert keys 55, 58, 68, 91, 27, 145. What will be the location of 79?1234
0 votes
1 answer
25
1 votes
1 answer
26
1 votes
3 answers
28