# Recent questions tagged ugcnetjune2014ii

1
Match the following: ... a-ii; b-i; c-iii; d-iv a-i; b-ii; c-iv; d-iii a-ii; b-iii; c-i; d-iv a-iv; b-i; c-ii; d-iii
2
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
3
A clustering index is created when _______. Primary key is declared and ordered No key ordered Foreign key ordered There is no key and no order
4
Manager&rsquo;s salary details are hidden from the employee. This is called as Conceptual level data hiding Physical level data hiding External level data hiding Local level data hiding
1 vote
5
Which of the following is the correct value returned to the operating system upon the successful completion of a program ? 0 1 -1 Program do not return a value.
6
A friend function can be used to Avoid arguments between classes. Allow access to classes whose source code is unavailable. Allow one class to access an unrelated class. None of the above
7
While (87) printf(“computer”); The above $C$ statement will print “computer” $87$ times print “computer” $0$ times print “computer” $1$ times print “computer” infinite times
8
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 array Number of elements of the array
9
Match the following: \begin{array}{|l|l|l|l|} \hline & \textbf{List-I} && \textbf{List-II} \\ \hline \text{a.} & \text{Automatic Storage} & \text{i.} & \text{Scope of the variable is global}\\ & \text{Class} \\ \hline \text{b.} & \text{Register Storage } & \text{ii.} & \text{Value of the variable ... array} a-iii; b-iv; c-i; d-ii a-iii; b-iv; c-ii; d-i a-iv; b-iii; c-ii; d-ii a-iv; b-iii; ci; d-ii
1 vote
10
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 is $\min (h(n), g(n))$ $\max (h(n), g(n))$ $h(n) + g(n)$ $h(n) * g(n)$
1 vote
11
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, average worst-case, worst-case average, worst-case best, average
1 vote
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$
Which of the following commands will output &ldquo;onetwothree&rdquo; ? for val; do echo-n $val; done < one two three for one two three; do echo-n-; done for n in one two three; do echo-n$n; done for n in one two three {echo &ndash;n $n} 1 vote 2 answers 15 Match the following : \begin{array}{|l|l|l|l|} \hline \text{} & \textbf{List-I} && \textbf{List-II} \\\hline \text{a.} & \text{Contiguous allocation} & \text{i.} & \text{This scheme supports very large}\\&&& \text{ file sizes} \\\hline \text{b.} & \text{Linked allocation} & \text{ii.} & \text{This ... a-iii; b-iv; c-ii; d-i a-iii; b-ii; c-iv; d-i a-i; b-ii; c-iv; d-iii a-i; b-iv; c-ii; d-iii 3 votes 4 answers 16 Consider a system with five processes$P_{0}$through$P_{4}$and three resource types$R_{1}$,$R_{2}$and$R_{3}$. Resource type$R_{1}$has$10$instances,$R_{2}$has$5$instances and$R_{3}$has$7$instances. Suppose that at time ... type$R_{1}$and two instances of resource type$R_{3}$. The state resulting after this allocation will be Ready state Safe state Blocked state Unsafe state 2 votes 2 answers 17 Match the following : ... a-i; b-iii; c-ii; d-iv a-iv; b-iii; c-ii; d-i a-iii; b-i; c-iv; d-i a-ii; b-iii; c-iv; d-i 0 votes 3 answers 18 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) to access memory, the effective memory access time is$91$ns$69$ns$200$ns$160$ns 0 votes 1 answer 19 SET, an open encryption and security specification model that is designed for protecting credit card transactions on the internet, stands for Secure Electronic Transaction Secular Enterprise for Transaction Security Electronic Transmission Secured Electronic Termination 0 votes 1 answer 20 Match the following: ... a-iii; b-iv; c-ii; d-i a-iv; b-iii; c-i; d-ii a-iii; b-iv; c-i; d-ii a-iv; b-iii; c-ii; d-i 0 votes 1 answer 21 A software agent is defined as A software developed for accomplishing a given task. A computer program which is capable of acting on behalf of the user in order to accomplish a given computational task. An open source software for accomplishing a given task.$IIIIII$All of the above 0 votes 1 answer 22 Object Request Broker (ORB) is I. 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 program that runs on the application server, where most of the components reside.$I$,$II$&$IIII$&$IIII$&$IIII$only 1 vote 1 answer 23 Match the following with respect to the mobile computing technologies: ... -iii; b-iv; c-ii; d-i a-iv; b-i; c-ii; d-iii a-ii; b-iii; c-iv; d-i a-ii; b-i; c-iv; d-iii 1 vote 1 answer 24 How many cards must be chosen from a deck to guarantee that at least two aces of two kinds are chosen. two aces are chosen. two cards of the same kind are chosen. two cards of two different kinds are chosen.$50, 50, 14, 551, 51, 15, 752, 52, 14, 551, 51, 14, 5$2 votes 3 answers 25 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!)$1 vote 2 answers 26 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 = 2m = 2, n = 3m = n > 2m = n > 3$1 vote 1 answer 27 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}K * h$and$2 \lfloor \frac{k}{2} \rfloor ^{h-1}K^{h}$and$2 \lfloor \frac{k}{2} \rfloor ^{h-1}K * h$and$2 \lceil \frac{k}{2} \rceil ^{h-1}$1 vote 1 answer 28 Consider the graph given below as : Which one of the following graph is isomorphic to the above graph ? 2 votes 1 answer 29 Give a compound proposition involving propositions$p, q$and$r$that is true when exactly two of$p, q$and$r$are true and is false otherwise$(p\vee q \wedge \neg r) \wedge (p \wedge \neg q \wedge r) \wedge (\neg p \wedge q \wedge r)$...$(p \wedge q \wedge \neg r) \vee (p \wedge \neg q \wedge r) \vee (\neg p \wedge q \wedge r)$4 votes 1 answer 30 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.$\exists ! x P(x) \rightarrow \exists x P(x)$II.$\exists ! x \neg P(x) \rightarrow \neg \forall x P(x)$Both$I$&$II$are true. Both$I$&$II$are false.$I$- false,$II$- true$I$- true,$II\$ - false