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
Recent activity by N
5
answers
1
GATE CSE 2011 | Question: 37
Which of the given options provides the increasing order of asymptotic complexity of functions $f_1, f_2, f_3$ and $f_4$? $f_1(n) = 2^n$ $f_2(n) = n^{3/2}$ $f_3(n) = n \log_2 n$ $f_4(n) = n^{\log_2 n}$ $f_3, f_2, f_4, f_1$ $f_3, f_2, f_1, f_4$ $f_2, f_3, f_1, f_4$ $f_2, f_3, f_4, f_1$
Which of the given options provides the increasing order of asymptotic complexity of functions $f_1, f_2, f_3$ and $f_4$?$f_1(n) = 2^n$$f_2(n) = n^{3/2}$$f_3(n) = n \log_...
18.0k
views
commented
Jan 15, 2021
Algorithms
gatecse-2011
algorithms
asymptotic-notation
normal
+
–
0
answers
2
PhD admission
I have the below GATE 522 score CSE(open category) B.Tech 7.9 CGPA 2 years work experience JEST rank 65(part a) I know i don’t have much, but do I have any chance of PhD/direct PhD in IITs? It would very helpful for me to recieve a kind suggestion, thankyou.
I have the belowGATE 522 score CSE(open category)B.Tech 7.9 CGPA2 years work experienceJEST rank 65(part a)I know i don’t have much, but do I have any chance of PhD/dir...
518
views
commented
Mar 12, 2020
9
answers
3
GATE CSE 2003 | Question: 34
$m$ identical balls are to be placed in $n$ distinct bags. You are given that $m \geq kn$, where $k$ is a natural number $\geq 1$. In how many ways can the balls be placed in the bags if each bag must contain at least $k$ ... $\left( \begin{array}{c} m - kn + n + k - 2 \\ n - k \end{array} \right)$
$m$ identical balls are to be placed in $n$ distinct bags. You are given that $m \geq kn$, where $k$ is a natural number $\geq 1$. In how many ways can the balls be place...
11.2k
views
commented
Feb 15, 2020
Combinatory
gatecse-2003
combinatory
balls-in-bins
normal
+
–
8
answers
4
GATE IT 2005 | Question: 32
An unbiased coin is tossed repeatedly until the outcome of two successive tosses is the same. Assuming that the trials are independent, the expected number of tosses is $3$ $4$ $5$ $6$
An unbiased coin is tossed repeatedly until the outcome of two successive tosses is the same. Assuming that the trials are independent, the expected number of tosses is$3...
33.0k
views
commented
Feb 14, 2020
Probability
gateit-2005
probability
binomial-distribution
expectation
normal
+
–
11
answers
5
GATE CSE 2014 Set 1 | Question: 12
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is $O(n^a\log^bn)$. Then the value of $a+10b$ is __________.
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is...
24.6k
views
commented
Jan 24, 2020
DS
gatecse-2014-set1
data-structures
binary-tree
numerical-answers
normal
+
–
1
answer
6
class test question
1) View Serializability is necessary but not sufficient condition for Serializability. 2) Conflict Serializability is necessary and sufficient condition for Serializability. state true or false with reason .
1) View Serializability is necessary but not sufficient condition for Serializability.2) Conflict Serializability is necessary and sufficient condition for Serializabilit...
1.5k
views
commented
Jan 20, 2020
3
answers
7
Self Doubt: Permutations & Combinations
How many solutions are there to the equation $x+y+z=17$ in positive integers? $120$ $171$ $180$ $121$
How many solutions are there to the equation $x+y+z=17$ in positive integers?$120$$171$$180$$121$
3.4k
views
commented
Jun 30, 2019
Combinatory
self-doubt
combinatory
+
–
3
answers
8
GATE CSE 1998 | Question: 1.7
Let $R_1$ and $R_2$ be two equivalence relations on a set. Consider the following assertions: $R_1 \cup R_2$ is an equivalence relation $R_1 \cap R_2$ is an equivalence relation Which of the following is correct? Both assertions are true Assertions (i) is true ... (ii) is not true Assertions (ii) is true but assertions (i) is not true Neither (i) nor (ii) is true
Let $R_1$ and $R_2$ be two equivalence relations on a set. Consider the following assertions:$R_1 \cup R_2$ is an equivalence relation$R_1 \cap R_2$ is an equivalence rel...
12.5k
views
commented
Jun 29, 2019
Set Theory & Algebra
gate1998
set-theory&algebra
relations
normal
+
–
5
answers
9
GATE CSE 2008 | Question: 30
Let $\text{fsa}$ and $\text{pda}$ be two predicates such that $\text{fsa}(x)$ means $x$ is a finite state automaton and $\text{pda}(y)$ means that $y$ is a pushdown automaton. Let $\text{equivalent}$ ...
Let $\text{fsa}$ and $\text{pda}$ be two predicates such that $\text{fsa}(x)$ means $x$ is a finite state automaton and $\text{pda}(y)$ means that $y$ is a pushdown autom...
14.1k
views
commented
Jun 28, 2019
Mathematical Logic
gatecse-2008
easy
mathematical-logic
first-order-logic
+
–
7
answers
10
GATE CSE 2004 | Question: 23, ISRO2007-32
Identify the correct translation into logical notation of the following assertion. Some boys in the class are taller than all the girls Note: $\text{taller} (x, y)$ is true if $x$ is taller than $y$ ... $(\exists x) (\text{boy}(x) \land (\forall y) (\text{girl}(y) \rightarrow \text{taller}(x, y)))$
Identify the correct translation into logical notation of the following assertion.Some boys in the class are taller than all the girlsNote: $\text{taller} (x, y)$ is true...
131k
views
commented
Jun 28, 2019
Mathematical Logic
gatecse-2004
mathematical-logic
easy
isro2007
first-order-logic
+
–
6
answers
11
GATE CSE 1992 | Question: 92,xv
Which of the following predicate calculus statements is/are valid? $(\forall (x)) P(x) \vee (\forall(x))Q(x) \implies (\forall (x)) (P(x) \vee Q(x))$ $(\exists (x)) P(x) \wedge (\exists (x))Q(x) \implies (\exists (x)) (P(x) \wedge Q(x))$ ... $(\exists (x)) (P(x) \vee Q(x)) \implies \sim (\forall (x)) P(x) \vee (\exists (x)) Q(x)$
Which of the following predicate calculus statements is/are valid?$(\forall (x)) P(x) \vee (\forall(x))Q(x) \implies (\forall (x)) (P(x) \vee Q(x))$$(\exists (x)) P(x) \w...
16.5k
views
commented
Jun 27, 2019
Mathematical Logic
gate1992
mathematical-logic
normal
first-order-logic
+
–
3
answers
12
GATE CSE 2018 | Question: 28
Consider the first-order logic sentence $\varphi \equiv \exists \: s \: \exists \: t \: \exists \: u \: \forall \: v \: \forall \: w \forall \: x \: \forall \: y \: \psi(s, t, u, v, w, x, y)$ ... or equal to $3$ There exists no model of $\varphi$ with universe size of greater than $7$ Every model of $\varphi$ has a universe of size equal to $7$
Consider the first-order logic sentence$$\varphi \equiv \exists \: s \: \exists \: t \: \exists \: u \: \forall \: v \: \forall \: w \forall \: x \: \forall \: y \: \psi(...
22.4k
views
commented
Jun 27, 2019
Mathematical Logic
gatecse-2018
mathematical-logic
normal
first-order-logic
2-marks
+
–
6
answers
13
GATE CSE 2015 Set 1 | Question: 16
For a set $A$, the power set of $A$ is denoted by $2^{A}$. If $A = \left\{5,\left\{6\right\}, \left\{7\right\}\right\}$, which of the following options are TRUE? $\varnothing \in 2^{A}$ $\varnothing \subseteq 2^{A}$ ... I and III only II and III only I, II and III only I, II and IV only
For a set $A$, the power set of $A$ is denoted by $2^{A}$. If $A = \left\{5,\left\{6\right\}, \left\{7\right\}\right\}$, which of the following options are TRUE?$\varnoth...
15.5k
views
commented
Jun 26, 2019
Set Theory & Algebra
gatecse-2015-set1
set-theory&algebra
set-theory
normal
+
–
2
answers
14
ISI 2018 PCB C4
Let the valid moves along a staircase be U (one step up) and D (one step down). For example, the string s = UUDU represents the sequence of moves as two steps up, then one step down, and then again one step up. Suppose a person is initially at the base ... base of the staircase after the final step. (a) Show that L is not regular. (b) Write a context free grammar for accepting L.
Let the valid moves along a staircase be U (one step up) and D (one step down). For example, the string s = UUDU represents the sequence of moves as two steps up, then on...
904
views
commented
May 2, 2019
Theory of Computation
theory-of-computation
userisi2018
usermod
+
–
1
answer
15
ISI 2018 PCB C5
Consider a max-heap of n distinct integers, n ≥ 4, stored in an array A[1 . . . n]. The second minimum of A is the integer that is less than all integers in A except the minimum of A. Find all possible array indices of A in which the second minimum can occur. Justify your answer.
Consider a max-heap of n distinct integers, n ≥ 4, stored in an array A[1 . . . n]. The second minimum of A is the integer that is less than all integers in A except th...
522
views
commented
May 1, 2019
Algorithms
userisi2018
usermod
algorithms
binary-heap
+
–
1
answer
16
IIIT H 2018
Assume that an integer and a pointer each takes 4 bytes. Also assume there is no alignment in objects. Predict the output #include <iostream> using namespace std; class Test{ static int x; int *ptr; int y; }; int main() { // your code goes here Test t; int a; cout<<sizeof(t)<<"\n"; cout<<sizeof(Test *); return 0; }
Assume that an integer and a pointer each takes 4 bytes. Also assume there is no alignment in objects. Predict the output #include <iostream using namespace std; class Te...
1.7k
views
answer selected
Apr 24, 2019
Programming in C
iiith-pgee
+
–
1
answer
17
JEST Cut Off for CDS CSA
What is the cut off rank in JEST called for Mtech Research in CSA and CDS in general category and EWS category?
What is the cut off rank in JEST called for Mtech Research in CSA and CDS in general category and EWS category?
1.1k
views
asked
Apr 18, 2019
IISc/IITs
jest
iisc
cutoffs
mtech
admission
cse
+
–
1
answer
18
ISI2017-MMA-1
The area lying in the first quadrant and bounded by the circle $x^2+y^2=4$ and lines $x=0 \text{ and } x=1$ is given by $\frac{\pi}{3}+\frac{\sqrt{3}}{2}$ $\frac{\pi}{6}+\frac{\sqrt{3}}{4}$ $\frac{\pi}{3}-\frac{\sqrt{3}}{2}$ $\frac{\pi}{6}+\frac{\sqrt{3}}{2}$
The area lying in the first quadrant and bounded by the circle $x^2+y^2=4$ and lines $x=0 \text{ and } x=1$ is given by$\frac{\pi}{3}+\frac{\sqrt{3}}{2}$$\frac{\pi}{6}+\f...
328
views
answered
Apr 11, 2019
Geometry
isi2017-mmamma
circle
area
non-gate
descriptive
+
–
1
answer
19
ISI2017-MMA-7
Let $n \geq 3$ be an integer. Then the statement $(n!)^{1/n} \leq \dfrac{n+1}{2}$ is true for every $n \geq 3$ true if and only if $n \geq 5$ not true for $n \geq 10$ true for even integers $n \geq 6$, not true for odd $n \geq 5$
Let $n \geq 3$ be an integer. Then the statement $(n!)^{1/n} \leq \dfrac{n+1}{2}$ istrue for every $n \geq 3$true if and only if $n \geq 5$not true for $n \geq 10$true fo...
317
views
answered
Apr 11, 2019
Quantitative Aptitude
isi2017-mmamma
quantitative-aptitude
factorial
inequality
+
–
0
answers
20
IISC DESE Admissions Interview
Please guide me if i should consider DESE course in IISC Bangalore, instead of going for IIT Kanpur CSE. (since the interview dates are clashing). I'm from CSE background. I would also like to know the type of questions asked in the DESE written and interview from CSE students.
Please guide me if i should consider DESE course in IISC Bangalore, instead of going for IIT Kanpur CSE. (since the interview dates are clashing). I'm from CSE background...
892
views
commented
Mar 18, 2019
Written Exam
interview
+
–
7
answers
21
TIFR CSE 2019 | Part B | Question: 13
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 red or a blue house must be green. How many ways are there to paint the houses? $199$ $683$ $1365$ $3^{10}-2^{10}$ $3^{10}$
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...
5.0k
views
commented
Dec 9, 2018
Combinatory
tifr2019
combinatory
counting
+
–
2
answers
22
TIFR CSE 2018 | Part A | Question: 10
Let $C$ be a biased coin such that the probability of a head turning up is $p.$ Let $p_n$ denote the probability that an odd number of heads occurs after $n$ tosses for $n \in \{0,1,2,\ldots \},$ ... $p_{n}=1 \text{ if } n \text{ is odd and } 0 \text{ otherwise}.$
Let $C$ be a biased coin such that the probability of a head turning up is $p.$ Let $p_n$ denote the probability that an odd number of heads occurs after $n$ tosses for $...
2.1k
views
commented
Oct 19, 2018
Probability
tifr2018
probability
binomial-distribution
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register