Recent posts tagged gate2019

1
hi I have already posted the same thing . Please have a look ! My question is different !
3
For answering there is no need to execute the query, we can directly answer this as $2$How?Group by Student_NamesIt means all name that are same should be kept in one row...
4
Answer: (B)$\textsf{Bind:}$ Binds the socket to an address$\textsf{Listen:}$ Waits for connections to the socket$\textsf{Accept:}$ Accepts a connection to the socket $\te...
6
Answer - B.Degree of generator polynomial is $3$ hence $3\text{-bits}$ are appended before performing divisionAfter performing division using $2's$ complement arithmetic ...
7
Why 6 bits for addresses for 11 address instruction?
9
the correct option is (A)
10
DCheck difference between no. Of chars between last two characters
11
Let us define a new function $g:$$g(y) = f(y) -f(y+1)$Since, function $f$ is continuous in $[0,2],$ $g$ would be continuous in $[0,1]$.$g(0) = -2, g(1) = 2$Since, $g$ is...
13
ans should be B.suppose E contains 2,3,4,5 and F contains 2,3,6E U F = 2,3,4,5,6; here f(E U F) has 5 and 6 in relation... but in f(E) U f(F) does not have any relation ...
14
Ans: because we have given wavy edges form MST So, for verification of option A we have to check that with MST how many cost to reach at a->b then we will get a->e->d->b ...
15
see my comment on the question. That's a mistake actually.Unit productions are of typeA >B. there shouldn't be any terminal on the RHS.
16
Answer - B.Multiplying $2\ 8$ bit digits will give result in maximum $16$ bitsTotal number of multiplications possible $= 2^8 \times 2^8$Hence, space required $= 64K \tim...
17
Consider a database with three relation instances shown below. The primary keys for the Drivers and Cars relation are did and cid respectively and the records are stored ...
18
How many bytes of data can be sent in $15$ seconds over a serial link with baud rate of $9600$ in asynchronous mode with odd parity and two stop bits in the frame?$10,000...
To see more, click for the full list of questions or popular tags.