Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for tifr2011
39
votes
4
answers
1
TIFR CSE 2011 | Part B | Question: 31
Given a set of $n=2^{k}$ distinct numbers, we would like to determine the smallest and the second smallest using comparisons. Which of the following statements is TRUE? Both these elements can be determined using $2k$ comparisons. ... $nk$ comparisons are necessary to determine these two elements.
Given a set of $n=2^{k}$ distinct numbers, we would like to determine the smallest and the second smallest using comparisons. Which of the following statements is TRUE?Bo...
makhdoom ghaya
7.8k
views
makhdoom ghaya
asked
Oct 22, 2015
Algorithms
tifr2011
algorithms
sorting
+
–
25
votes
7
answers
2
TIFR CSE 2011 | Part A | Question: 19
Three dice are rolled independently. What is the probability that the highest and the lowest value differ by $4$? $\left(\dfrac{1}{3}\right)$ $\left(\dfrac{1}{6}\right)$ $\left(\dfrac{1}{9}\right)$ $\left(\dfrac{5}{18}\right)$ $\left(\dfrac{2}{9}\right)$
Three dice are rolled independently. What is the probability that the highest and the lowest value differ by $4$? $\left(\dfrac{1}{3}\right)$ $\left(\dfrac{1}{6}\righ...
Arjun
3.0k
views
Arjun
asked
Oct 19, 2015
Probability
tifr2011
probability
independent-events
+
–
12
votes
4
answers
3
TIFR CSE 2011 | Part A | Question: 14
The limit $\lim_{x \to 0} \frac{d}{dx}\,\frac{\sin^2 x}{x}$ is $0$ $2$ $1$ $\frac{1}{2}$ None of the above
The limit $$\lim_{x \to 0} \frac{d}{dx}\,\frac{\sin^2 x}{x}$$ is$0$$2$$1$$\frac{1}{2}$None of the above
makhdoom ghaya
2.3k
views
makhdoom ghaya
asked
Oct 19, 2015
Calculus
tifr2011
calculus
limits
+
–
19
votes
4
answers
4
TIFR CSE 2011 | Part A | Question: 6
Assume that you are flipping a fair coin, i.e. probability of heads or tails is equal. Then the expected number of coin flips required to obtain two consecutive heads for the first time is. $4$ $3$ $6$ $10$ $5$
Assume that you are flipping a fair coin, i.e. probability of heads or tails is equal. Then the expected number of coin flips required to obtain two consecutive heads for...
makhdoom ghaya
5.9k
views
makhdoom ghaya
asked
Oct 17, 2015
Probability
tifr2011
probability
expectation
+
–
21
votes
3
answers
5
TIFR CSE 2011 | Part A | Question: 12
The action for this problem takes place in an island of Knights and Knaves, where Knights always make true statements and Knaves always make false statements and everybody is either a Knight or a Knave. Two friends A and B lives in a house. The census ... a Knave. A is a Knave and B is a Knight. Both are Knaves. Both are Knights. No conclusion can be drawn.
The action for this problem takes place in an island of Knights and Knaves, where Knights always make true statements and Knaves always make false statements and everybod...
makhdoom ghaya
2.1k
views
makhdoom ghaya
asked
Oct 19, 2015
Mathematical Logic
tifr2011
mathematical-logic
propositional-logic
+
–
21
votes
5
answers
6
TIFR CSE 2011 | Part B | Question: 26
Consider the following two scenarios in the dining philosophers problem: First a philosopher has to enter a room with the table that restricts the number of philosophers to four. There is no restriction on the number of philosophers entering the room. Which ... . Starvation is possible in (i). Deadlock is not possible in (ii). Starvation is not possible in (ii)
Consider the following two scenarios in the dining philosophers problem:First a philosopher has to enter a room with the table that restricts the number of philosophers t...
makhdoom ghaya
6.5k
views
makhdoom ghaya
asked
Oct 22, 2015
Operating System
tifr2011
operating-system
process-synchronization
+
–
14
votes
4
answers
7
TIFR CSE 2011 | Part A | Question: 3
The probability of three consecutive heads in four tosses of a fair coin is $\left(\dfrac{1}{4}\right)$ $\left(\dfrac{1}{8}\right)$ $\left(\dfrac{1}{16}\right)$ $\left(\dfrac{3}{16}\right)$ None of the above
The probability of three consecutive heads in four tosses of a fair coin is$\left(\dfrac{1}{4}\right)$$\left(\dfrac{1}{8}\right)$$\left(\dfrac{1}{16}\right)$$\left(\dfrac...
makhdoom ghaya
2.7k
views
makhdoom ghaya
asked
Oct 17, 2015
Probability
tifr2011
probability
binomial-distribution
+
–
19
votes
5
answers
8
TIFR CSE 2011 | Part A | Question: 1
If either wages or prices are raised, there will be inflation. If there is inflation, then either the government must regulate it or the people will suffer. If the people suffer, the government will be unpopular. Government will not be ... raised Prices are not raised If the inflation is not regulated, then the prices are not raised Wages are not raised
If either wages or prices are raised, there will be inflation.If there is inflation, then either the government must regulate it or the people will suffer.If the people s...
Marv Patel
3.0k
views
Marv Patel
asked
Aug 31, 2014
Mathematical Logic
tifr2011
mathematical-logic
propositional-logic
normal
+
–
23
votes
3
answers
9
TIFR CSE 2011 | Part A | Question: 9
You have to play three games with opponents $A$ and $B$ in a specified sequence. You win the series if you win two consecutive games. $A$ is a stronger player than $B$. Which sequence maximizes your chance of winning the series? $AAB$ $ABA$ $BAB$ $BAA$ All are the same.
You have to play three games with opponents $A$ and $B$ in a specified sequence. You win the series if you win two consecutive games. $A$ is a stronger player than $B$. W...
makhdoom ghaya
2.1k
views
makhdoom ghaya
asked
Oct 17, 2015
Probability
tifr2011
probability
conditional-probability
+
–
31
votes
5
answers
10
TIFR CSE 2011 | Part B | Question: 27
Let $n$ be a large integer. Which of the following statements is TRUE? $n^\frac{1}{ \sqrt{\log_2 n}} < \sqrt{\log_2 n} < n^\frac{1}{100}$ $n^\frac{1}{100} < n^\frac{1} {\sqrt{\log_2 n}} < \sqrt{\log_2 n}$ ... $\sqrt{\log_2 n} < n^\frac{1}{100} < n^\frac{1}{\sqrt{\log_2 n}}$
Let $n$ be a large integer. Which of the following statements is TRUE?$n^\frac{1}{ \sqrt{\log_2 n}} < \sqrt{\log_2 n} < n^\frac{1}{100}$$n^\frac{1}{100} < n^\frac{1} {\sq...
makhdoom ghaya
4.2k
views
makhdoom ghaya
asked
Oct 22, 2015
Algorithms
tifr2011
asymptotic-notation
+
–
24
votes
2
answers
11
TIFR CSE 2011 | Part B | Question: 38
Consider the class of recursive and iterative programs. Which of the following is false? Recursive programs are more powerful than iterative programs. For every iterative program there is an equivalent recursive program. ... memory management. Recursive programs do not terminate sometimes. Iterative programs and recursive programs are equally expressive.
Consider the class of recursive and iterative programs. Which of the following is false?Recursive programs are more powerful than iterative programs.For every iterative p...
makhdoom ghaya
6.4k
views
makhdoom ghaya
asked
Oct 25, 2015
Programming in C
tifr2011
recursion
programming
+
–
3
votes
2
answers
12
TIFR CSE 2011 | Part A | Question: 5
Three distinct points $x, y, z$ lie on a unit circle of the complex plane and satisfy $x+y+z=0$. Then $x, y, z$ form the vertices of . An isosceles but not equilateral triangle. An equilateral triangle. A triangle of any shape. A triangle whose shape can't be determined. None of the above.
Three distinct points $x, y, z$ lie on a unit circle of the complex plane and satisfy $x+y+z=0$. Then $x, y, z$ form the vertices of .An isosceles but not equilateral tri...
makhdoom ghaya
715
views
makhdoom ghaya
asked
Oct 17, 2015
Quantitative Aptitude
tifr2011
quantitative-aptitude
geometry
complex-number
non-gate
+
–
21
votes
2
answers
13
TIFR CSE 2011 | Part B | Question: 25
Let $A_{TM}$ be defined as follows: $A_{TM}=\left \{ \left \langle M, w \right \rangle \mid \text{ The Turing machine $M$ accepts the word } w \right \}$ And let $L$ be some $\mathbf{NP}-$ complete language. Which of the following statements is ... Since $L$ is $\mathbf{NP}-$ complete, $A_{TM}$ is polynomial time reducible to $L$. $A_{TM} \notin \mathbf{NP}$.
Let $A_{TM}$ be defined as follows:$A_{TM}=\left \{ \left \langle M, w \right \rangle \mid \text{ The Turing machine $M$ accepts the word } w \right \}$And let $L$ be som...
makhdoom ghaya
2.2k
views
makhdoom ghaya
asked
Oct 20, 2015
Theory of Computation
tifr2011
theory-of-computation
decidability
+
–
12
votes
3
answers
14
TIFR CSE 2011 | Part A | Question: 15
The exponent of $3$ in the product $100!$ is $27$ $33$ $44$ $48$ None of the above
The exponent of $3$ in the product $100!$ is$27$$33$$44$$48$None of the above
makhdoom ghaya
1.5k
views
makhdoom ghaya
asked
Oct 19, 2015
Quantitative Aptitude
tifr2011
quantitative-aptitude
factors
tricky
+
–
7
votes
2
answers
15
TIFR CSE 2011 | Part A | Question: 20
Let $n>1$ be an odd integer. The number of zeros at the end of the number $99^{n}+1$ is $1$ $2$ $3$ $4$ None of the above
Let $n>1$ be an odd integer. The number of zeros at the end of the number $99^{n}+1$ is$1$$2$$3$$4$None of the above
makhdoom ghaya
1.2k
views
makhdoom ghaya
asked
Oct 19, 2015
Quantitative Aptitude
tifr2011
quantitative-aptitude
modular-arithmetic
+
–
15
votes
3
answers
16
TIFR CSE 2011 | Part B | Question: 35
Let $G$ be a connected simple graph (no self-loops or parallel edges) on $n\geq 3$ vertices, with distinct edge weights. Let $e_{1}, e_{2},...,e_{m}$ be an ordering of the edges in decreasing order of weight. Which of the ... spanning tree. The edge $e_{m}$ is never present in any maximum weight spanning tree. $G$ has a unique maximum weight spanning tree.
Let $G$ be a connected simple graph (no self-loops or parallel edges) on $n\geq 3$ vertices, with distinct edge weights. Let $e_{1}, e_{2},...,e_{m}$ be an ordering of th...
makhdoom ghaya
2.8k
views
makhdoom ghaya
asked
Oct 24, 2015
Algorithms
tifr2011
algorithms
graph-algorithms
minimum-spanning-tree
+
–
8
votes
4
answers
17
TIFR CSE 2011 | Part A | Question: 13
If $z=\dfrac{\sqrt{3}-i}{2}$ and $\large(z^{95}+ i^{67})^{97}= z^{n}$, then the smallest value of $n$ is $1$ $10$ $11$ $12$ None of the above
If $z=\dfrac{\sqrt{3}-i}{2}$ and $\large(z^{95}+ i^{67})^{97}= z^{n}$, then the smallest value of $n$ is$1$$10$$11$$12$None of the above
makhdoom ghaya
1.5k
views
makhdoom ghaya
asked
Oct 19, 2015
Quantitative Aptitude
tifr2011
quantitative-aptitude
complex-number
+
–
9
votes
2
answers
18
TIFR CSE 2011 | Part B | Question: 32
Various parameter passing mechanisms have been in used in different programming languages. Which of the following statements is true? Call by value result is used in language Ada. Call by value result is the same as call by name. Call by value is the most robust. Call by reference is the same as call by name. Call by name is the most efficient.
Various parameter passing mechanisms have been in used in different programming languages. Which of the following statements is true?Call by value result is used in langu...
makhdoom ghaya
1.7k
views
makhdoom ghaya
asked
Oct 22, 2015
Programming in C
tifr2011
programming
parameter-passing
+
–
5
votes
2
answers
19
TIFR CSE 2011 | Part B | Question: 40
Consider the class of object oriented languages. Which of the following is true? Pascal is an object oriented language. Object oriented languages require heap management. Object oriented languages cannot be implemented in ... languages are more powerful than declarative programming languages. Parallelism cannot be realized in object oriented languages.
Consider the class of object oriented languages. Which of the following is true?Pascal is an object oriented language.Object oriented languages require heap management.Ob...
makhdoom ghaya
1.2k
views
makhdoom ghaya
asked
Oct 26, 2015
Object Oriented Programming
tifr2011
programming
object-oriented-programming
non-gate
+
–
26
votes
5
answers
20
TIFR CSE 2011 | Part B | Question: 30
Consider an array $A[1...n]$. It consists of a permutation of numbers $1....n$. Now compute another array $B[1...n]$ as follows: $B[A[i]]:= i$ for all $i$. Which of the following is true? $B$ will be a sorted array. $B$ ... of array $A$. Doing the same transformation twice will not give the same array. $B$ is not a permutation of array $A$. None of the above.
Consider an array $A[1...n]$. It consists of a permutation of numbers $1....n$. Now compute another array $B[1...n]$ as follows: $B[A[i]]:= i$ for all $i$. Which of the f...
makhdoom ghaya
4.9k
views
makhdoom ghaya
asked
Oct 22, 2015
DS
tifr2011
data-structures
array
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register