Recent posts tagged #gate_preparation

2,027
views
BOOK (acc_no, year, title)USER (card_no, name, address)SUPPLIER (s_name, address)BORROWED_BY (acc_no, card_no, date of issue)SUPPLIED_BY (acc_no, date of supply, ... in the following forms: (a) Relational Algebra(b) SQL(c) Tuple Calculus
4,292
views
2 Tuplesfor verification purposes : SQL_Fiddle
4,987
views
In this question why there is 1 cache miss for the first 64 bytes of array ..Plz explain.....
3,943
views
Answer - B.Degree of generator polynomial is $3$ hence $3\text{-bits}$ are appended before performing divisionAfter performing division using $2's$ complement arithmetic ... $M = 11001001.$Courtesy, Anurag Pandey
2,710
views
A serial transmission $T1$ uses $8$ information bits, $2$ start bits, $1$ stop bit and $1$ ... $100$ characters/sec, $136$ characters/sec$80$ characters/sec, $153$ characters/sec
3,512
views
Consider the following program segment for concurrent processing using semaphore operators $P$ and $V$ for synchronization. Draw the precedence graph for the statements $S_1$ to $S_9$. var ... V(j) end; begin P(j); P(k); S9 end; coend end;
5,870
views
Consider a simple connected graph $G$ with $n$ vertices and $n$ edges $(n > 2)$. Then, which of the following statements are true?$G$ has no ... cycleThe graph obtained by removing any two edges from $G$ is not connectedNone of the above
1,326
views
If you think of a $12\times 12$ grid (like a chess board of size $12\times 12$), then each each point $\left(i,j\right)$, which is in $i^{\text{th}}$ row ... $= 242$.So total edges $= 132 + 132 + 242 = 506.$
1,294
views
Consider following graphDfs is .so D is answer.
To see more, click for the full list of questions or popular tags.