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 arjuno
4
answers
1
GATE CSE 2015 Set 1 | Question: 27
Consider the following relation: ... P WHERE S.Roll_No= P.Roll_No GROUP BY S.STUDENT_Name The numbers of rows that will be returned by the SQL query is_________________.
Consider the following relation:$$\overset{\text{Student}}{\begin{array}{|c|c|}\hline\\\underline{\textbf{Roll_No}}& \textbf{Student_Name}\\\hline1& \text{Raj} \\...
17.3k
views
commented
Feb 5, 2020
Databases
gatecse-2015-set1
databases
sql
normal
numerical-answers
+
–
8
answers
2
GATE CSE 2016 Set 2 | Question: 26
A binary relation $R$ on $\mathbb{N} \times \mathbb{N}$ is defined as follows: $(a, b) R(c, d)$ if $a \leq c$ or $b \leq d$. Consider the following propositions: $P:$ $R$ is reflexive. $Q:$ $R$ is transitive. Which one of the following statements is TRUE? ... and $Q$ are true. $P$ is true and $Q$ is false. $P$ is false and $Q$ is true. Both $P$ and $Q$ are false.
A binary relation $R$ on $\mathbb{N} \times \mathbb{N}$ is defined as follows: $(a, b) R(c, d)$ if $a \leq c$ or $b \leq d$. Consider the following propositions:$P:$ $R$ ...
14.7k
views
answered
Jan 18, 2020
Set Theory & Algebra
gatecse-2016-set2
set-theory&algebra
relations
normal
+
–
5
answers
3
GATE IT 2008 | Question: 23
What is the probability that in a randomly chosen group of $r$ people at least three people have the same birthday? $1-\dfrac{365-364 \dots (365-r+1)}{365^{r}}$ ... $\dfrac{365 \cdot 364 \dots (365-r+1)}{365^{r}}$
What is the probability that in a randomly chosen group of $r$ people at least three people have the same birthday?$1-\dfrac{365-364 \dots (365-r+1)}{365^{r}}$$\dfrac{365...
8.7k
views
commented
Jan 14, 2020
Probability
gateit-2008
probability
normal
+
–
9
answers
4
GATE CSE 2019 | Question: 46
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at random. The expected value of the distance between $a$ and $b$ in $T$ (ie., the number of edges in the unique path between $a$ and $b$) is (rounded off to $2$ decimal places) _________.
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at ...
30.7k
views
commented
Jan 14, 2020
DS
gatecse-2019
numerical-answers
data-structures
binary-tree
2-marks
+
–
6
answers
5
GATE CSE 2015 Set 3 | Question: 37
Suppose $X_i$ for $i=1, 2, 3$ are independent and identically distributed random variables whose probability mass functions are $Pr[X_i = 0] = Pr[X_i = 1] = \frac{1} {2} \text{ for } i = 1, 2, 3$. Define another random variable $Y = X_1X_2 \oplus X_3$, where $\oplus$ denotes XOR. Then $Pr[Y=0 \mid X_3 = 0] =$______.
Suppose $X_i$ for $i=1, 2, 3$ are independent and identically distributed random variables whose probability mass functions are $Pr[X_i = 0] = Pr[X_i = 1] = \frac{1} {2} ...
18.4k
views
answered
Jan 12, 2020
Probability
gatecse-2015-set3
probability
random-variable
normal
numerical-answers
+
–
7
answers
6
GATE CSE 2011 | Question: 34
A deck of $5$ cards (each carrying a distinct number from $1$ to $5$) is shuffled thoroughly. Two cards are then removed one at a time from the deck. What is the probability that the two cards are selected with the number on the first card being one higher than the number ... $\left(\dfrac{4}{25}\right)$ $\left(\dfrac{1}{4}\right)$ $\left(\dfrac{2}{5}\right)$
A deck of $5$ cards (each carrying a distinct number from $1$ to $5$) is shuffled thoroughly. Two cards are then removed one at a time from the deck. What is the probabil...
18.2k
views
answered
Jan 11, 2020
Probability
gatecse-2011
probability
normal
+
–
8
answers
7
GATE CSE 2008 | Question: 27
Aishwarya studies either computer science or mathematics everyday. If she studies computer science on a day, then the probability that she studies mathematics the next day is $0.6$. If she studies mathematics on a day, then the probability that she studies computer ... what is the probability that she studies computer science on Wednesday? $0.24$ $0.36$ $0.4$ $0.6$
Aishwarya studies either computer science or mathematics everyday. If she studies computer science on a day, then the probability that she studies mathematics the next da...
7.7k
views
commented
Jan 11, 2020
Probability
gatecse-2008
probability
normal
conditional-probability
+
–
12
answers
8
GATE CSE 2007 | Question: 24
Suppose we uniformly and randomly select a permutation from the $20 !$ permutations of $1, 2, 3\ldots ,20.$ What is the probability that $2$ appears at an earlier position than any other even number in the selected permutation? $\left(\dfrac{1}{2} \right)$ $\left(\dfrac{1}{10}\right)$ $\left(\dfrac{9!}{20!}\right)$ None of these
Suppose we uniformly and randomly select a permutation from the $20 !$ permutations of $1, 2, 3\ldots ,20.$ What is the probability that $2$ appears at an earlier positio...
15.2k
views
answered
Jan 11, 2020
Probability
gatecse-2007
probability
easy
uniform-distribution
+
–
9
answers
9
GATE CSE 2017 Set 2 | Question: 47
If the ordinary generating function of a sequence $\left \{a_n\right \}_{n=0}^\infty$ is $\large \frac{1+z}{(1-z)^3}$, then $a_3-a_0$ is equal to ___________ .
If the ordinary generating function of a sequence $\left \{a_n\right \}_{n=0}^\infty$ is $\large \frac{1+z}{(1-z)^3}$, then $a_3-a_0$ is equal to ___________ .
17.7k
views
commented
Jan 10, 2020
Combinatory
gatecse-2017-set2
combinatory
generating-functions
numerical-answers
normal
+
–
8
answers
10
GATE CSE 2005 | Question: 50
Let $G(x) = \frac{1}{(1-x)^2} = \sum\limits_{i=0}^\infty g(i)x^i$, where $|x| < 1$. What is $g(i)$? $i$ $i+1$ $2i$ $2^i$
Let $G(x) = \frac{1}{(1-x)^2} = \sum\limits_{i=0}^\infty g(i)x^i$, where $|x| < 1$. What is $g(i)$?$i$$i+1$$2i$$2^i$
8.2k
views
answered
Jan 9, 2020
Combinatory
gatecse-2005
normal
generating-functions
+
–
7
answers
11
GATE IT 2005 | Question: 34
Let $n =$ $p^{2}q$, where $p$ and $q$ are distinct prime numbers. How many numbers m satisfy $1 ≤ m ≤ n$ and $gcd$ $(m, n) = 1?$ Note that $gcd$ $(m, n)$ is the greatest common divisor of $m$ and $n$. $p(q - 1)$ $pq$ $\left ( p^{2}-1 \right ) (q - 1)$ $p(p - 1) (q - 1)$
Let $n =$ $p^{2}q$, where $p$ and $q$ are distinct prime numbers. How many numbers m satisfy $1 ≤ m ≤ n$ and $gcd$ $(m, n) = 1?$ Note that $gcd$ $(m, n)$ is the great...
8.1k
views
answered
Jan 9, 2020
Set Theory & Algebra
gateit-2005
set-theory&algebra
normal
number-theory
+
–
9
answers
12
GATE CSE 2004 | Question: 75
Mala has the colouring book in which each English letter is drawn two times. She wants to paint each of these $52$ prints with one of $k$ colours, such that the colour pairs used to colour any two letters are different. Both prints of a letter can also be coloured with the same colour. What is the minimum value of $k$ that satisfies this requirement? $9$ $8$ $7$ $6$
Mala has the colouring book in which each English letter is drawn two times. She wants to paint each of these $52$ prints with one of $k$ colours, such that the colour pa...
16.7k
views
commented
Jan 9, 2020
Combinatory
gatecse-2004
combinatory
+
–
5
answers
13
GATE CSE 2003 | Question: 5
$n$ couples are invited to a party with the condition that every husband should be accompanied by his wife. However, a wife need not be accompanied by her husband. The number of different gatherings possible at the party is \(^{2n}\mathrm{C}_n\times 2^n\) \(3^n\) \(\frac{(2n)!}{2^n}\) \(^{2n}\mathrm{C}_n\)
$n$ couples are invited to a party with the condition that every husband should be accompanied by his wife. However, a wife need not be accompanied by her husband. The nu...
10.5k
views
answered
Jan 9, 2020
Combinatory
gatecse-2003
combinatory
normal
+
–
6
answers
14
GATE CSE 2008 | Question: 12
Some code optimizations are carried out on the intermediate code because They enhance the portability of the compiler to the target processor Program analysis is more accurate on intermediate code than on machine code The information from ... analysis cannot otherwise be used for optimization The information from the front end cannot otherwise be used for optimization
Some code optimizations are carried out on the intermediate code becauseThey enhance the portability of the compiler to the target processorProgram analysis is more accur...
15.2k
views
commented
Nov 24, 2019
Compiler Design
gatecse-2008
normal
code-optimization
compiler-design
+
–
5
answers
15
GATE CSE 2018 | Question: 24
Consider a system with $3$ processes that share $4$ instances of the same resource type. Each process can request a maximum of $K$ instances. Resources can be requested and releases only one at a time. The largest value of $K$ that will always avoid deadlock is ___
Consider a system with $3$ processes that share $4$ instances of the same resource type. Each process can request a maximum of $K$ instances. Resources can be requested a...
21.8k
views
answered
Oct 25, 2019
Operating System
gatecse-2018
operating-system
deadlock-prevention-avoidance-detection
easy
numerical-answers
1-mark
+
–
9
answers
16
GATE CSE 2003 | Question: 62
In a permutation $a_1\ldots a_n$, of $n$ distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i > a_j.$ What would be the worst case time complexity of the Insertion Sort algorithm, if the inputs are restricted to permutations of $1. . . n$ with at most $n$ inversions? $\Theta(n^2)$ $\Theta(n\log n)$ $\Theta(n^{1.5})$ $\Theta(n)$
In a permutation $a_1\ldots a_n$, of $n$ distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i a_j.$What would be the worst case time complex...
19.8k
views
answered
Oct 8, 2019
Algorithms
gatecse-2003
algorithms
sorting
normal
insertion-sort
+
–
12
answers
17
GATE CSE 2003 | Question: 64
Let S be a stack of size $n \geq1$. Starting with the empty stack, suppose we push the first n natural numbers in sequence, and then perform $n$ pop operations. Assume that Push and Pop operations take $X$ seconds each, and $Y$ seconds elapse between the end of one such ... S. The average stack-life of an element of this stack is $n(X+Y)$ $3Y+2X$ $n(X+Y)-X$ $Y+2X$
Let S be a stack of size $n \geq1$. Starting with the empty stack, suppose we push the first n natural numbers in sequence, and then perform $n$ pop operations. Assume th...
31.1k
views
answered
Sep 23, 2019
DS
gatecse-2003
data-structures
stack
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register