Two balls are drawn uniformly at random without replacement from a set of five balls numbered 1, 2, 3, 4, 5. What is the expected value of the larger number on the balls drawn?

Let M be a real nXn matrix such that for every non-zero vector xεRⁿ, we have x^T Mx > 0. Then

Let A be an nXn invertible matrix with real entries whose column sums are all equal to 1. Consider the following statements:
(1) Every column in the matrix A² sums to 2.
(2) Every column in the matrix A³ sums to 3.
(3) Every column in the matrix A^-1 sums to 1.
Which of the following is TRUE?

What is the maximum number of regions that the plane R² can be partitioned into using 10 lines?
Hint: Let A(n) be the maximum number of partitions that can be made by n lines. Observe that A(0) = 1, A(2) = 2, A(2) = 4 etc. Come up with a recurrence equation for A(n).

A lottery chooses four random winners. What is the probability that at least three of them are born on the same day of the week? Assume that the pool of candidates is so large that each winner is equally likely to be born on any of the seven days of the week independent of the other winners

Consider a function f : [0, 1] --> [0, 1] which is twice differentiable in (0, 1). Suppose it has exactly one global maximum and exactly one global minimum inside (0, 1). What can you say about the behaviour of the first derivative f' and and second derivative f'' on (0, 1) (give the most precise answer)?

A contiguous part, i.e., a set of adjacent sheets, is missing from Tharoor’s GRE preparation book. The number on the first missing page is 183, and it is known that the number on the last missing page has the same three digits, but in a different order. Note that every sheet has two pages, one at the front and one at the back. How many pages are missing from Tharoor’s book?

In a certain year there were exactly four Fridays and exactly four Mondays in January. On what day of the week did the 20th of January fall that year (recall that January has 31 days)?

Suppose we toss m = 3 labelled balls into n = 3 numbered bins. Let A be the event that the first bin is empty while B be the event that the second bin is empty. P(A) and P(B) denote their respective probabilities. Which of the following is true?

The hour needle of a clock is malfunctioning and travels in the anti-clockwise direction, i.e., opposite to the usual direction, at the same speed it would have if it was working correctly. The minute needle is working correctly. Suppose the the two needles show the correct time at 12 noon, thus both needles are together at the 12 mark. After how much time do the two needles meet again?

What is the area of the largest rectangle that can be inscribed in a circle of radius R?

A ball is thrown directly upwards from the ground at a speed of 10 ms⁻¹, on a planet where the gravitational acceleration is 10 ms⁻². Consider the following statements:
1. The ball reaches the ground exactly 2 seconds after it is thrown up
2. The ball travels a total distance of 10 metres before it reaches the ground
3. The velocity of the ball when it hits the ground is 10 ms⁻¹
What can you say now?

The sequence s0, s1, . . . , s9 is defined as follows:

what is s0

Consider the following statements.
1. The intersection of two context-free languages is always context-free.
2. The super-set of a context-free language is never regular.
3. The subset of a decidable language is always decidable.
4. Let Σ ≡ {a, b, c} . Let L ⊆ Σ be the language of all strings in which either the number of occurrences of a is the same as the number of occurrences of b OR the number of occurrences of b is the same as the number of occurrences of c. Then, L is not context-free.
Which of the above statements are true?

Consider the (decimal) number 182, whose binary representation is 10110110. How many positive integers are there in the following set?
{n ∈ N : n ≤ 182 and n has exactly four ones in its binary representation}

A clamp gate is an analog gate parametrized by two real numbers a and b, and denoted as clamp_a,b. It takes as input two non-negative real numbers x and y. Its output is defined as

Consider circuits composed only of clamp gates, possibly parametrized by different pairs (a, b) of real numbers. How many clamp gates are needed to construct a circuit that on input non-negative reals x and y outputs the maximum of x and y?

Consider the context-free grammar below (s denotes the empty string, alphabet is {a, b}):
S → ε|aSb|bSa|SS.
What language does it generate?

Consider the following algorithm (Note: For positive integers p, q, p/q denotes the floor of the rational number p/q , assume that given p, q, p/q can be computed in one step):
Input: Two positive integers a, b, a ≥ b.
Output: A positive integer g. while (b > 0) {
x = a - (a/b)*b; a = b;
b = x;
}
g = a;
Suppose K is an upper bound on a. How many iterations does the above algorithm take in the worst case?

Jobs keep arriving at a processor. A job can have an associated time length as well as a priority tag. New jobs may arrive while some earlier jobs are running. Some jobs may keep running indefinitely. A starvation free job-scheduling policy guarantees that no job waits indefinitely for service. Which of the following job-scheduling policies is starvation free?

A particular Panini-Backus-Naur Form definition for a < word > is given by the following rules:

Which of the following lexical entities can be derived from < word >?
I. word
II. words
III. c22

Among the following asymptotic expressions, which of these functions grows the slowest (as a function of n) asymptotically?

Which of the following graphs are bipartite?

Given the pseudocode below for the function remains(), which of the following statements is true about the output, if we pass it a positive integer n > 2?
int remains(int n)
{
int x = n;
for (i=(n-1);i>1;i--) { x = x i;
}
return x;
}

Let G be an undirected graph. An Eulerian cycle of G is a cycle that traverses each edge of G exactly once. A Hamiltonian cycle of G is a cycle that traverses each vertex of G exactly once. Which of the following must be true?

The figure below describes the network of streets in a city where Motabhai sells pakoras from his cart. The number next to an edge is the time (in minutes) taken to traverse the corresponding street.

At present the cart is required to start at point s and, after visiting each street at least once, reach point t. For example, Motabhai can visit the streets in the following order
s − a − c − s − e − c − d − a − b − d − f − e − d − b − t − f − d − t
in order to go from s to t. Note that the streets b, d and d, f are both visited twice in this strategy. The total time taken for this trip is 440 minutes [which is, 380 (the sum of the traversal times of all streets in the network) + 60 (the sum of the traversal times of streets {b, d} and {d, f })].
Motabhai now wants the cart to return to s at the end of the trip. So the previous strategy is not valid, and he must find a new strategy. How many minutes will Motabhai now take if he uses an optimal strategy?
Hint: s, t, b and f are the only odd degree nodes in the figure above.

Consider a discrete-time system which in response to input sequence x[n] (n integer) outputs the sequence y[n] such that

Suppose |α| < 1. Is the system linear, time-invariant, bounded input bounded output (BIBO) stable?

Balls are drawn one after the other uniformly at random without replacement from a set of eight balls numbered 1, 2, . . . , 8 until all balls drawn. What is the expected number of balls whose value match their ordinality (i.e., their position in the order in which balls were drawn)?
Hint: what is the probability that the i-th ball is drawn at the i-th draw? Now can you use linearity of expectation to solve the problem?

Let f, g : R --> R be two functions that are continuous and differentiable. Consider the following statements:
1. min{f, g} is continuous
2. max{f, g} is continuous
3. max{f, g} is differentiable
Which of the following is TRUE?

For all values of r > 0, the area of the set of all points outside the unit square whose Euclidean distance to the unit square is less than r is:

Suppose that Dice 1 has five faces numbered 1 to 5, each of which is equally likely to occur once the dice is rolled. Dice 2 similarly has eight equally likely faces numbered 1 to 8. Suppose that the two dice are rolled, and the sum is equal to 8. Conditioned on this, what is the chance that the Dice 1 rolled a number less than or equal to 2?

Let A be an nXn matrix with the the property that A^m = 0 for some mεN. Consider the following statements:
1. At least one entry of A is zero
2. All eigenvalues of A are zero
3. All diagonal entries of A are zero
Which of the following is TRUE?

Consider two independent random variables (U1, U2) both are uniformly distributed between [0, 1]. The conditional expectation
E[(U1 + U2)| max(U1, U2) ≥ 0.5]
equals

Suppose that X is a real valued random variable and E[exp X] = 2. Then, which of the following must be TRUE?
Hint: (exp(x) + exp(y))/2 ≥ exp((x + y)/2).

Consider a unit disc D. Let a point x be chosen uniformly on D and let the random distance to x from the center of D be R. Which of the following is TRUE?

Alice and Bob have one coin each with probability of Heads p and q, respectively. In each round, both Alice and Bob independently toss their coin once, and the game stops if one of them gets a Heads and the other gets a Tails. If they both get either Heads or both get Tails in any round, the game continues. Let R be the expected number of rounds by which the game stops. Which of the following is TRUE?