UGC NET December 2014 Paper 3, Computer Applications

# Recent questions tagged ugcnetdec2014iii

1
Assume that the software team defines a project risk with $80$% probability of occurrence of risk in the following manner: Only $70$ percent of the software components scheduled for reuse will be integrated into the application and the remaining functionality will have to be custom developed ... $25,200$20,160 $17,640$15,120
2
To compute function points $(FP)$, the following relationship is used $FP$ = Count - total $\times (0.65 + 0.01 \times \sum(F_{i}))$ where $F_{i} (i = 1$ to $n$) are value adjustment factors $(VAF)$ based on $n$ questions. The value of $n$ is $12$ $14$ $16$ $18$
3
Which one of the following is not a source code metric ? Halstead metric Function point metric Complexity metric Length metric
4
Which method is called first by an applet program ? start( ) run( ) init( ) begin( )
5
What is true about $UML$ stereotypes ? Stereotype is used for extending the $UML$ language. Stereotyped class must be abstract The stereotype indicates that the $UML$ element cannot be changed UML profiles can be stereotyped for backward compatibility
1 vote
6
The behaviour of the document elements in $XML$ can be defined by Using document object Registering appropriate event handlers Using element object All of the above
1 vote
7
Converting a primitive type data into its corresponding wrapper class object instance is called Boxing Wrapping Instantiation Autoboxing
1 vote
8
How to express that some person keeps animals as pets?
1 vote
9
Which methods are utilized to control the access to an object in multi-threaded programming ? Asynchronized methods Synchronized methods Serialized methods None of the above
1 vote
10
Suppose that we have numbers between $1$ and $1000$ in a binary search tree and we want to search for the number $365$. Which of the following sequences could not be the sequence of nodes examined ? $4, 254, 403, 400, 332, 346, 399, 365$ $926, 222, 913, 246, 900, 260, 364, 365$ $927, 204,913, 242, 914, 247, 365$ $4, 401, 389, 221, 268, 384, 383, 280, 365$
1 vote
11
Consider the problem of a chain $<A_{1}, A_{2}, A_{3}>$ of three matrices. Suppose that the dimensions of the matrices are $10 \times 100$, $100 \times 5$ and $5 \times 50$ respectively. There are two different ways of parenthesization : (i) ... $5$ $10$ $20$ $100$
1 vote
12
Dijkstra algorithm, which solves the single-source shortest--paths problem, is a _______, and the Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a ________. Greedy algorithm, Divide-conquer algorithm Divide-conquer algorithm, Greedy algorithm Greedy algorithm, Dynamic programming algorithm Dynamic programming algorithm, Greedy algorithm
1 vote
13
We can show that the clique problem is $NP$-hard by proving that CLIQUE $\leq$ P 3-CNF_SAT CLIQUE $\leq$ P VERTEX_COVER CLIQUE $\leq$ P SUBSET_SUM None of the above
1 vote
14
Match the following : $\begin{array}{|c|l|c|l|} \hline& \textbf{List-I} & {} & \textbf{List-II} \\\hline a. & \text{Bucket sort} & i. & \text{$O(n^3\lg n)$} \\\hline b. & \text{Matrix chain multiplication} & ii. & \text{$ ... $} \\ \hline\end{array}$ Codes : a b c d iv ii i iii ii iv i iii iv ii iii i iii ii iv i
15
Any decision tree that sorts $n$ elements has height $\Omega(n)$ $\Omega(\text{lg}n)$ $\Omega(n \text{lg} n)$ $\Omega(n^2)$
1 vote
16
Which one of the following is true for asymmetric-key cryptography ? Private key is kept by the receiver and public key is announced to the public. Public key is kept by the receiver and private key is announced to the public. Both private key and public key are kept by the receiver. Both private key and public key are announced to the public.
1 vote
17
________ is a bit-oriented protocol for communication over point-to-point and multipoint links. Stop-and-wait HDLC Sliding window Go-back-N
1 vote
18
What is the propagation time if the distance between the two points is $48,000$ ? Assume the propagation speed to be $2.4 &times; 10^{8}$ metre/second in cable. $0.5$ ms $20$ ms $50$ ms $200$ ms
1 vote
19
Which of the following is not a field in $TCP$ header ? Sequence number Fragment offset Checksum Window size
20
How many characters per second ($7$ bits + $1$ parity) can be transmitted over a $3200$ bps line if the transfer is asynchronous ? (Assuming $1$ start bit and $1$ stop bit) $300$ $320$ $360$ $400$
1 vote
21
For $n$ devices in a network, ________ number of duplex-mode links are required for a mesh topology. $n(n + 1)$ $n (n &ndash; 1)$ $n(n + 1)/2$ $n(n &ndash; 1)/2$
1 vote
22
Given two languages : $L_{1}=\left\{(ab)^{n} a^{k} | n > k, k \geq 0\right\}$ $L_{2}=\left\{a^{n}b^{m} | n \neq m\right\}$ Using pumping lemma for regular language, it can be shown that $L_{1}$ is regular and $L_{2}$ is not regular. $L_{1}$ is not regular and $L_{2}$ is regular. $L_{1}$ is regular and $L_{2}$ is regular. $L_{1}$ is not regular and $L_{2}$ is not regular.
23
The pushdown automation $M=(\left\{q_{0}, q_{1}, q_{2}\right\}, \left\{a, b\right\}, \left\{0, 1\right\}, \delta, q_{0}, 0, \left\{q_{0}\right\})$ with $\delta (q_{0}, a, 0)= \left\{(q_{1}, 10)\right\}$ $\delta (q_{1}, a, 1)= \left\{(q_{1}, 11)\right\}$ ... $L=\left\{a^{n}b^{m} | n, m > 0\right\}$ $L=\left\{a^{n}b^{n} | n > 0\right\}$
24
Which of the following statements is not true ? MPI_Isend and MPI_Irecv are non-blocking message passing routines of MPI. MPI_Issend and MPI_Ibsend are non-blocking message passing routines of MPI. MPI_Send and MPI_Recv are non-blocking message passing routines of MPI. MPI_Ssend and MPI_Bsend are blocking message passing routines of MPI.
25
How many tokens will be generated by the scanner for the following statement ? $x = x ∗ (a + b) - 5$; $12$ $11$ $10$ $07$
26
Consider the following statements $S1, S2$ and $S3$: $S1$: In call-by-value, anything that is passed into a function call is unchanged in the caller's scope when the function returns. $S2$: In call-by-reference, a function receives implicit reference to a variable used as argument. $S3$: In call-by ... . $S3$ and $S2$ are true. $S3$ and $S1$ are true. $S2$ and $S1$ are true. $S1, S2, S3$ are true.
27
Match the following : LIST-I LIST-II a. Cavalier Projection i. The direction of projection is chosen so that there is no foreshortening of lines perpendicular to the $xy$ plane b. Cabinet Projection ii. The direction of projection is chosen so that lines perpendicular to the $xy$ planes are ... perpendicular to the view plane. Codes : a b c d i iii iv ii ii iii i iv iv ii iii i i ii iii iv
1 vote
In Cyrus-Beck algorithm for line clipping the value of $t$ parameter is computed by the relation: (Here $P_{1}$ and $P_{2}$ are the two end points of the line, $f$ is a point on the boundary, $n_{1}$ is inner normal). $\frac{(P_{1}-f_{i}).n_{i}}{(P_{2}-P_{1}).n_{i}}$ ... $\frac{(P_{2}-f_{i}).n_{i}}{(P_{1}-P_{2}).n_{i}}$ $\frac{(f_{i}-P_{2}).n_{i}}{(P_{1}-P_{2}).n_{i}}$
Consider a triangle represented by $A(0, 0), B(1, 1), C(5, 2)$. The triangle is rotated by $45$ degrees about a point $P(-1, -1)$ ... $A'(-1, \sqrt{2}-1), B'(2\sqrt{2}-1, -1), C'\left(\frac{9}{2}\sqrt{2}-1, \frac{3}{2}\sqrt{2}-1\right)$