Recent questions tagged tifr2019

8 8 votes
6 answers 6 answers
4.7k
4.7k views
Let $X$ be a set with $n$ elements. How many subsets of $X$ have odd cardinality?$n$ $2^n$$2^{n/2}$$2^{n-1}$Can not be determined w...
7 7 votes
2 answers 2 answers
2.7k
2.7k views
How many proper divisors (that is, divisors other than $1$ or $7200$) does $7200$ have ?$18$$20$$52$$54$$60$
9 9 votes
3 answers 3 answers
5.7k
5.7k views
$A$ is $n \times n$ square matrix for which the entries in every row sum to $1$. Consider the following statements:The column vector $[1,1,\ldots,1]^T$ is an eigen vector...
8 8 votes
1 1 answer
2.5k
2.5k views
What is the probability that a point $P=(\alpha,\beta)$ picked uniformly at random from the disk $x^2 +y^2 \leq 1$ satisfies $\alpha + \beta \leq 1$?$\frac{1}{\pi}$$\frac...
11 11 votes
6 6 answers
7.7k
7.7k views
Asha and Lata play a game in which Lata first thinks of a natural number between $1$ and $1000$. Asha must find out that number by asking Lata questions, but Lata can onl...
3 3 votes
2 2 answers
1.6k
1.6k views
A function $f: \mathbb{R} \rightarrow \mathbb{R}$ is said to be $\textit{convex}$ if for all $x,y \in \mathbb{R}$ and $\lambda$ such that $0 \leq \lambda \leq1,$ $f(...
17 17 votes
2 answers 2 answers
2.7k
2.7k views
What are the last two digits of $1! + 2! + \dots +100!$?$00$$13$$30$$33$$73$
1 1 vote
1 answers 1 answer
2.3k
2.3k views
Consider the following toy model of traffic on a straight , single lane, highway. We think of cars as points, which move at the maximum speed $v$ that satisfies the follo...
3 3 votes
2 answers 2 answers
1.6k
1.6k views
Let $A$ and $B$ be two containers. Container $A$ contains $50$ litres of liquid $X$ and container $B$ contains $100$ litres of liquid $Y$. Liquids $X$ and $Y$ are solub...
3 3 votes
1 1 answer
2.2k
2.2k views
Avni and Badal alternately choose numbers from the set $\{1,2,3,4,5,6,7,8,9\}$ without replacement (starting with Avni). The first person to choose numbers of which any ...
7 7 votes
5 5 answers
4.2k
4.2k views
Suppose there are $n$ guests at a party (and no hosts). As the night progresses, the guests meet each other and shake hands. The same pair of guests might shake hands mul...
3 3 votes
1 1 answer
2.6k
2.6k views
Let $f$ be a function with both input and output in the set $\{0,1,2, \dots ,9\}$, and let the function $g$ be defined as $g(x) = f(9-x)$. The function $f$ is non-decreas...
7 7 votes
2 answers 2 answers
5.0k
5.0k views
Consider the integral$$\int^{1}_{0} \frac{x^{300}}{1+x^2+x^3} dx$$What is the value of this integral correct up to two decimal places?$0.00$$0.02$$0.10$$0.33$$1.00$
9 9 votes
1 answers 1 answer
3.7k
3.7k views
A drawer contains $9$ pens, of which $3$ are red, $3$ are blue, and $3$ are green. The nine pens are drawn from the drawer one at at time (without replacement) such that ...
8 8 votes
5 5 answers
5.3k
5.3k views
Consider the matrix$$A = \begin{bmatrix} \frac{1}{2} &\frac{1}{2} & 0\\ 0& \frac{3}{4} & \frac{1}{4}\\ 0& \frac{1}{4} & \frac{3}{4} \end{bmatrix}$$What is $\displaystyle ...
5 5 votes
2 answers 2 answers
5.7k
5.7k views
Which of the following decimal numbers can be exactly represented in binary notation with a finite number of bits ?$0.1$$0.2$$0.4$$0.5$All the above
11 11 votes
5 answers 5 answers
8.9k
8.9k views
How many distinct minimum weight spanning trees does the following undirected, weighted graph have ?$8$$16$$32$$64$None of the above
7 7 votes
2 answers 2 answers
2.3k
2.3k views
A graph is $d$ – regular if every vertex has degree $d$. For a $d$ – regular graph on $n$ vertices, which of the following must be TRUE?$d$ divides $n$Both $d$ and $n$ ar...
9 9 votes
2 2 answers
2.3k
2.3k views
Let $\varphi$ be a propositional formula on a set of variables $A$ and $\psi$ be a propositional formula on a set of variables $B$ , such that $\varphi \Rightarrow \p...
11 11 votes
3 3 answers
5.9k
5.9k views
Stirling’s approximation for $n!$ states for some constants $c_1,c_2$$$c_1 n^{n+\frac{1}{2}}e^{-n} \leq n! \leq c_2 n^{n+\frac{1}{2}}e^{-n}.$$What are the tightest asympt...
12 12 votes
3 answers 3 answers
3.5k
3.5k views
Given the following pseudocode for function $\text{printx()}$ below, how many times is $x$ printed if we execute $\text{printx(5)}?$void printx(int n) { if(n==0){ printf...
3 3 votes
1 1 answer
1.5k
1.5k views
A formula is said to be a $3$-CF-formula if it is a conjunction (i.e., an AND) of clauses, and each clause has at most $3$ literals. Analogously, a formula is said to be ...
6 6 votes
2 answers 2 answers
2.7k
2.7k views
Consider the following program fragment:var a,b : integer; procedure G(c,d: integer); begin c:=c-d; d:=c+d; c:=d-c end; a:=2; b:=3; G(a,b);If both parameters to $G$ are p...
13 13 votes
2 answers 2 answers
6.3k
6.3k views
Consider the following program fragment:var x, y: integer; x := 1; y := 0; while y < x do begin x := 2*x; y := y+1 end;For the above fragment , which of the following is ...
11 11 votes
2 answers 2 answers
2.9k
2.9k views
Let the language $D$ be defined in the binary alphabet $\{0,1\}$ as follows:$D:= \{ w \in \{0,1\}^* \mid \text{ substrings 01 and 10 occur an equal number of times in w}...
11 11 votes
3 answers 3 answers
3.2k
3.2k views
Consider the following non-deterministic automaton,where $s_1$ is the start state and $s_4$ is the final (accepting) state. The alphabet is $\{a,b\}$. A transition with l...
6 6 votes
1 1 answer
3.9k
3.9k views
Let $G=(V,E)$ be a directed graph with $n(\geq 2)$ vertices, including a special vertex $r$. Each edge $e \in E$ has a strictly positive edge weight $w(e)$. An arborescen...
21 21 votes
7 answers 7 answers
9.8k
9.8k views
A row of $10$ houses has to be painted using the colours red, blue, and green so that each house is a single colour, and any house that is immediately to the right of a r...
4 4 votes
2 2 answers
2.6k
2.6k views
Let $m$ and $n$ be two positive integers. Which of the following is NOT always true?If $m$ and $n$ are co-prime, there exist integers $a$ and $b$ such that $am + bn=1$$m^...
10 10 votes
2 answers 2 answers
3.4k
3.4k views
Consider directed graphs on $n$ labelled vertices $\{1,2, \dots ,n\}$, where each vertex has exactly one edge coming in and exactly one edge going out. We allow self-loo...
To see more, click for the full list of questions or popular tags.