Recent questions tagged ugcnetcse-june2014-paper2

3.5k
views
2 answers
0 votes
Match the following $:$\begin{array} {cIcI} & \textbf{List - I} && \textbf{List - II} \\ \text{a.} & \text{DDL} & \text{i.} & \text{LOCK TABLE} \\ \text{b.} & \text{DML ... $\text{a-iv; b-i; c-ii; d-iii}$
20.2k
views
3 answers
2 votes
Let $R =\{A, B, C, D, E, F\}$ be a relation schema with the following dependencies $C \rightarrow F$, $E \rightarrow A$, $EC \rightarrow D$, $A \rightarrow B$. Which of the following is a key for $R$ ? CD EC AE AC
4.4k
views
3 answers
3 votes
A clustering index is created when _______. Primary key is declared and ordered No key orderedForeign key orderedThere is no key and no order
11.0k
views
2 answers
0 votes
Manager’s salary details are hidden from the employee. This is called asConceptual level data hidingPhysical level data hidingExternal level data hiding Local level data hiding
2.8k
views
1 answers
2 votes
Which of the following is the correct value returned to the operating system upon the successful completion of a program ? 01-1Program do not return a value.
5.2k
views
1 answers
0 votes
A friend function can be used toAvoid arguments between classes.Allow access to classes whose source code is unavailable. Allow one class to access an unrelated class. None of the above
2.4k
views
1 answers
0 votes
While (87) printf(“computer”); The above $C$ statement will print “computer” $87$ timesprint “computer” $0$ timesprint “computer” $1$ times print “computer” infinite times
1.7k
views
1 answers
0 votes
When we pass an array as an argument to a function, what actually gets passed ? Address of the array Values of the elements of the array Base address of the arrayNumber of elements of the array
1.9k
views
1 answers
0 votes
Match the following $:$\begin{array}{cIcI} & \textbf{List - I} && \textbf{List - II} \\ \text{a.} & \text{Automatic Storage} & \text{i.} & \text{Scope of the variable is ... $\text{a-iv; b-iii; ci; d-ii}$
2.4k
views
2 answers
1 votes
An algorithm is made up of $2$ modules $M_{1}$ and $M_{2}$ . If time complexity of modules $M_{1}$ and $M_{2}$ are $h(n)$ and $g(n)$ respectively, the time complexity of the algorithm ... $\max (h(n), g(n))$ $h(n) + g(n)$ $h(n) * g(n)$
3.6k
views
2 answers
1 votes
Searching for an element in the hash table requires $O(1)$ time for the _________time, whereas for direct addressing it holds for the _______ time.worst-case, averageworst-case, worst-caseaverage, worst-case best, average
5.5k
views
2 answers
1 votes
A text is made up of the characters $\alpha, \beta, \gamma, \delta$ and $\sigma$ with the probability $0.12, 0.40, 0.15, 0.08$ and $0.25$ respectively. The optimal coding technique will have the average length of $1.7$2.15$ $3.4$3.8$
6.1k
views
2 answers
1 votes
Mergesort makes two recursive calls. Which statement is true after these two recursive calls finish, but before the merge step ?The array elements form a heap.Elements ... or equal to elements in second half of the array.All of the above
2.1k
views
1 answers
0 votes
Which of the following commands will output &ldquo;onetwothree&rdquo; ?for val; do echo-n $val; done < one two threefor one two three; do echo-n-; donefor n in one two three; do echo-n $n; donefor n in one two three {echo &ndash;n $ n}
6.5k
views
2 answers
1 votes
Match the following $:$\begin{array}{clcl} \text{} & \textbf{List - I} && \textbf{List - II} \\ \text{a.} & \text{Contiguous allocation} & \text{i.} & \text{This scheme supports ... {a-i; b-ii; c-iv; d-iii}$\text{a-i; b-iv; c-ii; d-iii}$
7.7k
views
4 answers
3 votes
Consider a system with five processes $P_{0}$ through $P_{4}$ and three resource types $R_{1}$, $R_{2}$ and $R_{3}$ ... . The state resulting after this allocation will be Ready state Safe state Blocked stateUnsafe state
3.4k
views
2 answers
2 votes
Match the following $:$\begin{array}{clcl} & \textbf{List - I} && \textbf{List - II} \\ \text{a}. & \text{Multilevel feedback queue} & \text{i.} & \text{Time-slicing} \\ \text{ ... text{a-iii; b-i; c-iv; d-i}$\text{a-ii; b-iii; c-iv; d-i}$
9.2k
views
3 answers
0 votes
In a paged memory management algorithm, the hit ratio is $70$%. If it takes $30$ nanoseconds to search Translation Look-aside Buffer (TLB) and $100$ nanoseconds (ns) ... the effective memory access time is $91$ ns$69$ ns$200$ ns $160$ ns
1.9k
views
2 answers
0 votes
SET, an open encryption and security specification model that is designed for protecting credit card transactions on ... Electronic TransactionSecular Enterprise for TransactionSecurity Electronic TransmissionSecured Electronic Termination
1.8k
views
1 answers
0 votes
Match the following $:$\begin{array}{clcl} & \textbf{List - I} & & \textbf{List - II} \\ \text{a.} & \text{Classification} & \text{i.} & \text{Principal component analysis} \\ \ ... {a-iii; b-iv; c-i; d-ii}$\text{a-iv; b-iii; c-ii; d-i}$
1.9k
views
1 answers
0 votes
A software agent is defined asA software developed for accomplishing a given task.A computer program which is capable of acting on behalf of the user in order to accomplish ... for accomplishing a given task.$I$ $II$ $III$ All of the above
1.9k
views
1 answers
0 votes
Object Request Broker (ORB) isI. A software program that runs on the client as well as on the application server.II. A software program that runs on the client side only.III. A software ... I$, $II$ & $III$I$ & $II$ $II$ & $III$ $I$ only
2.9k
views
1 answers
1 votes
Match the following with respect to the mobile computing technologies $:$\begin{array}{cIcI} & \textbf{List-I} & & \textbf{List-II} \\ \text{a.} & \text{GPRS} & \text{i.} & \text{ ... {a-ii; b-iii; c-iv; d-i}$\text{a-ii; b-i; c-iv; d-iii}$
3.0k
views
1 answers
1 votes
How many cards must be chosen from a deck to guarantee that at leasttwo aces of two kinds are chosen.two aces are chosen.two cards of the same kind are chosen.two cards of two different ... $52, 52, 14, 5$ $51, 51, 14, 5$
5.5k
views
3 answers
2 votes
Big-$O$ estimates for the factorial function and the logarithm of the factorial function i.e. $n!$ and $\log n!$ is given by $O(n!)$ and $O(n \log n)$O(n^{n})$ and $O(n \log n)$ $O(n!)$ and $O(\log n!)$ $O(n^{n})$ and $O(\log n!)$
7.4k
views
2 answers
1 votes
Consider a complete bipartite graph $k_{m,n}$. For which values of $m$ and $n$ does this, complete graph have a Hamilton circuit $m = 3, n = 2$m = 2, n = 3$ $m = n > 2$m = n > 3$
2.7k
views
1 answers
1 votes
The upper bound and lower bound for the number of leaves in a B-tree of degree $K$ with height $h$ is given by : $K^{h}$ and $2 \lceil \frac{k}{2} \rceil ^{h-1}$ ... {2} \rfloor ^{h-1}$K * h$ and $2 \lceil \frac{k}{2} \rceil ^{h-1}$
3.6k
views
2 answers
2 votes
Consider the graph given below as :Which one of the following graph is isomorphic to the above graph ?
5.9k
views
1 answers
2 votes
Give a compound proposition involving propositions $p, q$ and $r$ that is true when exactly two of $p, q$ and $r$ ...
2.2k
views
2 answers
4 votes
The notation $\exists ! x P(x)$ denotes the proposition &ldquo;there exists a unique $x$ such that $P(x)$ is true&rdquo;. Give the truth values of the following statements : I. ... false. $I$ - false, $II$ - true $I$ - true, $II$ - false