Recent posts tagged gate-cse

Yeah why not you have found a solution it cab be one of the option but always choose the best one

hi I have already posted the same thing . Please have a look ! My question is different !

If r is a relation on a then it's xsitive closure = the smallest xsitive relation on a which contain r ...eg a={a,b,c} and r= {(a,c),(c,b)} then r* = { (a,c),(c,b),(a,b)}

In the relation Emp ,should not SS and dno together form the key ?Otherwise we would have a tuple in the EMP relation having multivalue in dno attribute. eg. 1 Sayan 45 ...

yes.

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...

In a data link protocol, the frame delimiter flag is given by $0111$. Assuming that bit stuffing is employed, the transmitter sends the data sequence $01110110$ as:$01101...

A $5$ stage pipelined CPU has the following sequence of stages:IF – instruction fetch from instruction memoryRD – Instruction decode and register readEX – Execute: ALU op...

Which of the following addressing modes are suitable for program relocation at run time?Absolute addressingBased addressingRelative addressingIndirect addressingI and IVI...

A non-planar graph with minimum number of vertices has$9$ edges, $6$ vertices$6$ edges, $4$ vertices$10$ edges, $5$ vertices$9$ edges, $5$ vertices

A $2-3$ tree is such thatAll internal nodes have either $2$ or $3$ childrenAll paths from root to the leaves have the same lengthThe number of internal nodes of a $2-3$ t...

Which of the following problems is not $\text{NP}$-hard?Hamiltonian circuit problemThe $0/1$ Knapsack problemFinding bi-connected components of a graphThe graph coloring ...