# Recent posts tagged gate-cse

1
Yeah why not you have found a solution it cab be one of the option but always choose the best one
2
hi I have already posted the same thing . Please have a look ! My question is different !
3
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)}
4
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 45000 {10,11} where 10 is dno fr Toy and 11 for shoe.
8
Answer - B. Multiplying $2\ 8$ bit digits will give result in maximum $16$ bits Total number of multiplications possible $= 2^8 \times 2^8$ Hence, space required $= 64K \times 16$ bits
9
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 $01101011$ $011010110$ $011101100$ $0110101100$
10
A $5$ stage pipelined CPU has the following sequence of stages: IF - instruction fetch from instruction memory RD - Instruction decode and register read EX - Execute: ALU operation for data and address computation MA - Data memory access - for write access, the register read ... clock cycles taken to complete the above sequence of instructions starting from the fetch of $I_1$? $8$ $10$ $12$ $15$
11
Which of the following addressing modes are suitable for program relocation at run time? Absolute addressing Based addressing Relative addressing Indirect addressing I and IV I and II II and III I, II and IV
12
Choose the correct alternatives ( more than one may be correct) and write the corresponding letters only: (viii) A non-planar graph with minimum number of vertices has (a) 9 edges, 6 vertices (b) 6 edges, 4 vertices (c) 10 edges, 5 vertices (d) 9 edges, 5 vertices
13
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: A $2-3$ tree is such that All internal nodes have either $2$ or $3$ children All paths from root to the leaves have the same length. The number of internal nodes of a $2-3$ tree having $9$ leaves could be $4$ $5$ $6$ $7$
14
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Which of the following problems is not $NP$-hard? Hamiltonian circuit problem The $0/1$ Knapsack problem Finding bi-connected components of a graph The graph coloring problem
To see more, click for the full list of questions or popular tags.