Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by venky.victory35
5
votes
1
TIFR CSE 2013 | Part B | Question: 10
Let $m, n$ be positive integers with $m$ a power of $2$. Let $s= 100 n^{2} \log m$. Suppose $S_{1}, S_{2},\dots ,S_{m}$ are subsets of ${1, 2, \dots, s}$ such that $ \mid S_{i} \mid= 10 n \log m$ and $ \mid S_{i} \cap S_{j} \mid \leq \log m$ ... $x ∉ T$. $1$ if $x \in T$ and at least $0.9$ if $x ∉ T$. At least $0.9$ if $x \in T$ and $1$ if $x ∉ T$.
Let $m, n$ be positive integers with $m$ a power of $2$. Let $s= 100 n^{2} \log m$. Suppose $S_{1}, S_{2},\dots ,S_{m}$ are subsets of ${1, 2, \dots, s}$ such that $ \mid...
833
views
answered
Nov 26, 2015
Probability
tifr2013
probability
conditional-probability
+
–
10
votes
2
TIFR CSE 2013 | Part B | Question: 11
Which of the following statements is FALSE? The intersection of a context free language with a regular language is context free. The intersection of two regular languages is regular. The intersection of two context free languages is context ... language is context free. The intersection of a regular language and the complement of a regular language is regular.
Which of the following statements is FALSE?The intersection of a context free language with a regular language is context free.The intersection of two regular languages i...
2.5k
views
answered
Nov 26, 2015
Theory of Computation
tifr2013
theory-of-computation
easy
closure-property
+
–
0
votes
3
symmetric difference
If A and B are subsets of set X={1,2,3........100} and A∆B denotes set of all elements of X which belong to exactly one of A or B.Then total no of subsets of X such that A∆B ={2,4,6.....100}is a)2^50 2)2^51 3)2^100 4)2^25
If A and B are subsets of set X={1,2,3........100} and A∆B denotes set of all elements of X which belong to exactly one of A or B.Then total no of subsets of X such t...
917
views
answered
Nov 26, 2015
14
votes
4
TIFR CSE 2013 | Part B | Question: 17
In a connected weighted graph with $n$ vertices, all the edges have distinct positive integer weights. Then, the maximum number of minimum weight spanning trees in the graph is $1$ $n$ equal to number of edges in the graph. equal to maximum weight of an edge of the graph. $n^{n-2}$
In a connected weighted graph with $n$ vertices, all the edges have distinct positive integer weights. Then, the maximum number of minimum weight spanning trees in the gr...
1.9k
views
answered
Nov 25, 2015
Algorithms
tifr2013
algorithms
minimum-spanning-tree
+
–
5
votes
5
TIFR CSE 2013 | Part B | Question: 20
Suppose $n$ processors are connected in a linear array as shown below. Each processor has a number. The processors need to exchange numbers so that the numbers eventually appear in ascending order (the processor $\rm P1$ should have the minimum value and the the ... $n^2$ steps $n$ steps $n^{1.5}$ steps The algorithm is not guaranteed to sort
Suppose $n$ processors are connected in a linear array as shown below. Each processor has a number. The processors need to exchange numbers so that the numbers eventually...
3.2k
views
answered
Nov 25, 2015
Algorithms
tifr2013
algorithms
sorting
+
–
18
votes
6
TIFR CSE 2013 | Part B | Question: 3
How many $4 \times 4$ matrices with entries from ${0, 1}$ have odd determinant? Hint: Use modulo $2$ arithmetic. $20160$ $32767$ $49152$ $57343$ $65520$
How many $4 \times 4$ matrices with entries from ${0, 1}$ have odd determinant?Hint: Use modulo $2$ arithmetic.$20160$$32767$$49152$$57343$$65520$
4.6k
views
answered
Nov 25, 2015
Linear Algebra
tifr2013
linear-algebra
matrix
+
–
28
votes
7
TIFR CSE 2014 | Part B | Question: 20
Consider the following game. There is a list of distinct numbers. At any round, a player arbitrarily chooses two numbers $a, b$ from the list and generates a new number $c$ by subtracting the smaller number from the larger one. The numbers $a$ and $b$ are put ... $273$. What is the score of the best player for this game? $40$ $16$ $33$ $91$ $123$
Consider the following game. There is a list of distinct numbers. At any round, a player arbitrarily chooses two numbers $a, b$ from the list and generates a new number $...
3.3k
views
answered
Nov 24, 2015
Algorithms
tifr2014
algorithms
identify-function
+
–
5
votes
8
TIFR CSE 2014 | Part B | Question: 19
Consider the following tree with $13$ nodes. Suppose the nodes of the tree are randomly assigned distinct labels from $\left\{1, 2,\ldots,13\right\}$, each permutation being equally likely. What is the probability that the labels form a min-heap (i.e., every node receives the ... $\frac{2}{13}$ $\frac{1}{2^{13}}$
Consider the following tree with $13$ nodes.Suppose the nodes of the tree are randomly assigned distinct labels from $\left\{1, 2,\ldots,13\right\}$, each permutation bei...
5.7k
views
answered
Nov 24, 2015
DS
tifr2014
binary-heap
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register