GATE CSE 2015 SET-1


Q1.

In one of the pairs of protocols given below, both the protocols can use multiple TCP connections between the same client and the server. Which one is that?
GateOverflow

Q2.

For computers based on three-address instruction formats, each address field can be used to specify which of the following: (S1) A memory operand (S2) A processor register (S3) An implied accumulator register
GateOverflow

Q3.

What is the output of the following C code? Assume that the address of x is 2000 (in decimal) and an integer requires four bytes of memory. int main () { unsigned int x[4][3] ={{1,2,3},{4,5,6},{7,8,9},{10,11,12}}; printf("%u, %u, %u", x+3, *(x+3), *(x+2)+3); }
GateOverflow

Q4.

Which of the following is/are correct inorder traversal sequence(s) of binary search tree(s)? I. 3, 5, 7, 8, 15, 19, 25 II. 5, 8, 9, 12, 10, 15, 25 III. 2, 7, 10, 8, 14, 16, 20 IV. 4, 6, 7, 9 18, 20, 25
GateOverflow

Q5.

What are the worst-case complexities of insertion and deletion of a key in a binary search tree?
GateOverflow

Q6.

Consider the following C function. int fun1(int n){ int i,j,k,p,q=0; for (i=1; i\lt n; ++i) { p=0; for (j=n; j\gt 1; j=j/2) ++p; for (k=1; k\lt p; k=k*2) ++q; } return q; } Which one of the following most closely approximates the return value of the function fun1?
GateOverflow

Q7.

\sum_{x=1}^{99}\frac{1}{x(x+1)}=__________ .
GateOverflow

Q8.

\lim_{x\rightarrow \infty }x^{1/x} is
GateOverflow

Q9.

\int_{1/ \pi }^{2/ \pi}\frac{cos(1/x)}{x^{2}}dx=_________.
GateOverflow

Q10.

The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height 5 are
GateOverflow