search
Log In

Recent questions tagged ugcnetjune2014ii

0 votes
2 answers
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
asked Jul 1, 2016 in Databases makhdoom ghaya 1.8k views
0 votes
3 answers
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
asked Jul 1, 2016 in Databases makhdoom ghaya 7.4k views
3 votes
3 answers
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
asked Jul 1, 2016 in Databases makhdoom ghaya 2.3k views
0 votes
2 answers
4
Manager’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
asked Jul 1, 2016 in Databases makhdoom ghaya 3.8k views
1 vote
1 answer
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.
asked Jul 1, 2016 in Operating System makhdoom ghaya 1.4k views
0 votes
1 answer
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
asked Jul 1, 2016 in Object Oriented Programming makhdoom ghaya 2.2k views
0 votes
1 answer
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
asked Jul 1, 2016 in Programming makhdoom ghaya 1.2k views
0 votes
1 answer
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
asked Jul 1, 2016 in Programming makhdoom ghaya 742 views
0 votes
1 answer
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
asked Jul 1, 2016 in Programming makhdoom ghaya 941 views
1 vote
2 answers
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)$
asked Jul 1, 2016 in Algorithms makhdoom ghaya 736 views
1 vote
2 answers
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
asked Jun 29, 2016 in DS makhdoom ghaya 1.7k views
1 vote
2 answers
12
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$
asked Jun 29, 2016 in Digital Logic makhdoom ghaya 3.7k views
1 vote
2 answers
13
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 in each half of the array are sorted amongst themselves. Elements in the first half of the array are less than or equal to elements in second half of the array. All of the above
asked Jun 29, 2016 in Algorithms makhdoom ghaya 3k views
0 votes
1 answer
14
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}
asked Jun 29, 2016 in Others makhdoom ghaya 1k views
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
asked Jun 29, 2016 in Operating System makhdoom ghaya 1.6k views
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
asked Jun 29, 2016 in Operating System makhdoom ghaya 1.7k views
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
asked Jun 29, 2016 in Operating System makhdoom ghaya 1.5k views
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
asked Jun 29, 2016 in Operating System makhdoom ghaya 4.6k views
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
asked Jun 27, 2016 in Computer Networks makhdoom ghaya 1k views
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
asked Jun 27, 2016 in Others makhdoom ghaya 861 views
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. $I$ $II$ $III$ All of the above
asked Jun 27, 2016 in IS&Software Engineering makhdoom ghaya 937 views
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$ & $III$ $I$ & $II$ $II$ & $III$ $I$ only
asked Jun 27, 2016 in Distributed Computing makhdoom ghaya 768 views
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
asked Jun 27, 2016 in Computer Networks makhdoom ghaya 1.6k views
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, 5$ $51, 51, 15, 7$ $52, 52, 14, 5$ $51, 51, 14, 5$
asked Jun 27, 2016 in Combinatory makhdoom ghaya 1.8k views
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!)$
asked Jun 27, 2016 in Algorithms makhdoom ghaya 3k views
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 = 2$ $m = 2, n = 3$ $m = n > 2$ $m = n > 3$
asked Jun 27, 2016 in Graph Theory makhdoom ghaya 3.1k views
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}$
asked Jun 27, 2016 in Databases makhdoom ghaya 1.6k views
1 vote
1 answer
28
Consider the graph given below as : Which one of the following graph is isomorphic to the above graph ?
asked Jun 27, 2016 in Graph Theory makhdoom ghaya 1.9k views
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)$
asked Jun 25, 2016 in Mathematical Logic makhdoom ghaya 1.1k views
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
asked Jun 25, 2016 in Mathematical Logic makhdoom ghaya 868 views
...