# Recent questions tagged ugcnetjune2019ii

1
Consider the poset $( \{3,5,9,15,24,45 \}, \mid).$ Which of the following is correct for the given poset ? There exist a greatest element and a least element There exist a greatest element but not a least element There exist a least element but not a greatest element There does not exist a greatest element and a least element
2
How many ways are there to place $8$ indistinguishable balls into four distinguishable bins? $70$ $165$ $^8C_4$ $^8P_4$
3
How many bit strings of length ten either start with a $1$ bit or end with two bits $00$ ? $320$ $480$ $640$ $768$
4
Suppose that a connected planar graph has six vertices, each of degree four. Into how many regions is the plane divided by a planar representation of this graph? $6$ $8$ $12$ $20$
5
For which values of $m$ and $n$ does the complete bipartite graph $k_{m,n}$ have a Hamiltonian circuit ? $m\neq n,\ \ m,n \geq 2$ $m\neq n,\ \ m,n \geq 3$ $m=n,\ \ m,n \geq 2$ $m= n,\ \ m,n \geq 3$
6
Which of the following is principal conjunctive normal form for $[(p\vee q)\wedge\ \rceil p \rightarrow \rceil q ]$ ? $p\ \vee \rceil q$ $p \vee q$ $\rceil p \vee q$ $\rceil p\ \vee \rceil q$
7
How many cards must be selected from a standard deck of $52$ cards to guarantee that at least three hearts are present among them? $9$ $13$ $17$ $42$
8
Match List-I with List-II: ... - (iv) (a) - (iv); (b) - (i); (c) - (iii); (d) - (ii) (a) - (iv); (b) - (iii); (c) - (i); (d) - (ii)
1 vote
9
Find the zero-one matrix of the transitive closure of the relation given by the matrix $A$ : $A =\begin{bmatrix} 1 & 0& 1\\ 0 & 1 & 0\\ 1& 1& 0 \end{bmatrix}$ $\begin{bmatrix} 1 & 1& 1\\ 0 & 1 & 0\\ 1& 1& 1 \end{bmatrix}$ ... $\begin{bmatrix} 1 & 1& 1\\ 0 & 1 & 0\\ 1& 0& 1 \end{bmatrix}$
10
Consider an LPP given as $\text{Max } Z=2x_1-x_2+2x_3$ subject to the constraints $2x_1+x_2 \leq 10 \\ x_1+2x_2-2x_3 \leq 20 \\ x_1 + 2x_3 \leq 5 \\ x_1, \: x_2 \: x_3 \geq 0$ ... $x_1 = 0, x_2=\frac{5}{2}, \: x_3=0, \: Z=-\frac{5}{2}$ $x_1 = 0, x_2=0, \: x_3=10, \: Z=20$
11
Which type of addressing mode, less number of memory references are required? Immediate Implied Register Indexed
12
Suppose that the register $A$ and the register $K$ have the bit configuration. Only the three leftmost bits of $A$ are compared with memory words because $K$ has $1$’s in these positions. Because of its organization, this type of memory is uniquely suited to parallel searches by data association. This type of memory is known as RAM ROM content addressable memory secondary memory
13
How many different Boolean functions of degree $n$ are the $2^{2^n}$ $(2^2)^n$ $2^{2^n} -1$ $2^n$
1 vote
14
The fault can be easily diagnosed in the micro-program control unit using diagnostic tools by maintaining the contents of flags and counters registers and counters flags and registers flags, registers and counters
15
What will be the number of states when a MOD-$2$ counter is followed by a MOD-$5$ counter? $5$ $10$ $15$ $20$
1 vote
16
For a magnetic disk with concentric circular tracks, the seek latency is not linearly proportional to the seek distance due to non-uniform distribution of requests arm starting or stopping inertia higher capacity of tracks on the periphery of the platter use of uniform arm scheduling policies
1 vote
17
The parallel bus arbitration technique uses an external priority encoder and a decoder. Suppose, a parallel arbiter has $5$ bus arbiters. What will be the size of priority encoder and decoder respectively? $4 \times 2 , \: 2 \times 4$ $2 \times 4 , \: 4 \times 2$ $3 \times 8 , \: 8 \times 3$ $8 \times 3 , \: 3 \times 8$
18
Consider the equation $(146)_b +(313)_{b-2} = (246)_8$. Which of the following is the value of $b$? $8$ $7$ $10$ $16$
1 vote
19
How many address lines and data lines are required to provide a memory capacity of $16 K \times 16$? $10, \:4$ $16, \: 16$ $14, \:16$ $4, \:16$
1 vote
20
Suppose that a computer program takes $100$ seconds of execution time on a computer with multiplication operation responsible for $80$ seconds of this time. How much do you have to improve the speed of the multiplication operation if you are asked to execute this program four times faster? $14$ times faster $15$ times faster $16$ times faster $17$ times faster
21
Consider the following pseudo-code fragment in which an invariant for the loop is $m ^*x^k=p^n$ and $k \geq 0$ (here, $p$ and $n$ are integer variable that have been initialized): /* Pre-conditions : $p \geq 1 \wedge n \geq 0$ */ /* Assume that overflow never occurs */ int $x=p$; ... $x=p^n$ $m=p^n$ $p=x^n$ $p=m^n$
22
Consider the following C-code fragment running on a $32$-bit $X86$ machine: typedef struct { union { unsigned char a; unsigned short b; } U; unsigned char c; }S; S B[10]; S*p=&B[4]; S*q=&B[5]; p → U.b=0x1234; /* structure S takes 32-bits */ If M is the value of $q-p$ and $N$ is the value of $((\text{int )&} ( p \rightarrow c)) – ((\text{int})p)$, then $(M,N)$ is $(1,1)$ $(3,2)$ $(1,2)$ $(4,4)$
1 vote
23
What is the output of the following JAVA program? public class Good { private int m; public Good (int m){this.m=m;} public Boolean equals (Good n) {return n.m==m;} public static void main (string args[]){ Good m1 = new Good(22); Good m2 = new Good(22); Object ... .out.println(s1.equals(m2)); } } True, True, False, False True, False, True, False True, True, False, True True, False, False, False
1 vote
24
Consider the following C++ function f(): unsigned int f(unsigned int n) { unsigned int b=0; while (n) { b+=n & 1; n>>1; } return b; } The function f() returns the int that represents the ____P____ in the binary representation of positive integer n, where P is number of $0$’s number of bits number of consecutive $1$’s number of $1$’s
25
Which of the following statements is/are true? P : In a scripting language like JacaScript, types are typically associated with values, not variables. Q : It is not possible to show images on a web page without the <img> tag of HTML. Select the correct answer from the options given below: P only Q only Both P and Q Neither P nor Q
1 vote
26
Which of the following statements is/are true? P : An XML document with correct syntax as specified by W3C is called Well Formed . Q : An XML documented validated against a DTD is both Well formed and valid . R : <xml version= 1.0 encoding = UTF-8 > is syntactly ... document. Select the correct answer from the options given below: P and Q only P and R only Q and R only All of P, Q and R
1 vote
27
Consider a raster system with resolution $640$ by $480$. What size is frame buffer (in bytes) for this system to store $12$ bits per pixel? $450$ kilobytes $500$ kilobytes $350$ kilobytes $400$ kilobytes
1 vote
Consider the following statements regarding $2D$ transforms in computer graphics: $S1: \: \begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix}$ is a $2 \times 2$ matrix that reflects (mirrors) only $2D$ point about the X-axis. $S2:$ A $2 \times 2$ matrix which mirrors any $2D$ point ... statements $S1$ and $S2$? Both $S1$ and $S2$ are true Only $S1$ is true Only $S2$ is true Both $S1$ and $S2$ are false