GATE CSE 2014 SET-1


Q41.

Suppose you break a stick of unit length at a point chosen uniformly at random. Then the expected length of the shorter stick is
GateOverflow

Q42.

For fair six-sided dice are rolled. The probability that the sum of the results being 22 is \frac{X}{1296}. The value of X is _________
GateOverflow

Q43.

Which one of the following propositional logic formulas is TRUE when exactly two of p, q, and r are TRUE?
GateOverflow

Q44.

Consider the statement "Not all that glitters is gold" Predicate glitters(x) is true if x glitters and predicate gold(x) is true if x is gold. Which one of the following logical formulae represents the above statement?
GateOverflow

Q45.

Consider the following three statements about link state and distance vector routing protocols, for a large network with 500 network nodes and 4000 links [S1] The computational overhead in link state protocols is higher than in distance vector protocols. [S2] A distance vector protocol (with split horizon) avoids persistent routing loops, but not a link state protocol. [S3] After a topology change, a link state protocol will converge faster than a distance vector protocol. Which one of the following is correct about S1, S2, and S3?
GateOverflow

Q46.

Let L be a language and \bar{L} be its complement. Which of the following is NOT a viable possibility?
GateOverflow

Q47.

Which one of the following is TRUE?
GateOverflow

Q48.

Consider the relation scheme R = (E, F, G, H, I, J, K, L, M, N) and the set of functional dependencies {{E,F}\rightarrow{G}, {F}\rightarrow{I,J}, {E,H}\rightarrow{K,L}, {K}\rightarrow{M}, {L}\rightarrow{N} } on R. What is the key for R?
GateOverflow

Q49.

Let P be a quick sort program to sort numbers in ascending order using the first element as the pivot. Let t1 and t2 be the number of comparisons made by P for the inputs [1 2 3 4 5] and [4 1 5 3 2] respectively. Which one of the following holds?
GateOverflow

Q50.

Given the following schema: employees(emp-id, first-name, last-name, hire-date, dept-id, salary) departments(dept-id, dept-name, manager-id, location-id) You want to display the last names and hire dates of all latest hires in their respective departments in the location ID 1700. You issue the following query: SQL>SELECT last-name, hire-date FROM employees WHERE (dept-id, hire-date) IN (SELECT dept-id, MAx(hire-date) FROM employees JOIN departments USING(dept-id) WHERE location-id = 1700 GROUP BY dept-id); What is the outcome?
GateOverflow