# Recent posts tagged gate-cse

1
Show that in a group of five people (where any two people are either friends or enemies), there are not necessarily three mutual friends or three mutual enemies.
3
Hello sir How can we find the middle for given string ? here they mentioned Even length palindrome according to that we find middle Is this correct ?
4
$\lim_{x\rightarrow 0}\frac{ \sin x^{\circ}}{x}$
5
answer of of 4.12 is c) 10 as in DVR the routers rely completely on their neighbour Routers .So N2 , N4 will send their distance vector to N3 and N3 will find out that in order to reach N1 the option I have are: 1) infinity (from N1)+ 2(N1 N2 distance ) =infinity 2)8 (from N4 )+ 2 (N4 N3 distance)= 10 N3 will choose the minimum of two which is 10.
6
Thank you sir...and as the signals are getting lost their corresponding iterations will be missed out in Process Y. Am I correct?
7
8
hi I have already posted the same thing . Please have a look ! My question is different !
9
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)}
10
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.
14
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
15
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$
16
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$
17
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
18
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
19
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$
20
Which of the following problems is not $\text{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.