Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User yuyutsu
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by yuyutsu
3
answers
1
TIFR CSE 2013 | Part A | Question: 13
Doctors $A$ and $B$ perform surgery on patients in stages $III$ and $IV$ of a disease. Doctor $A$ has performed a $100$ surgeries (on $80$ stage $III$ and $20$ stage $IV$ patients) and $80$ out of her $100$ patients ... she appears to be more successful There is not enough data since the choice depends on the stage of the disease the patient is suffering from.
commented
in
Probability
Jan 21
1.4k
views
tifr2013
probability
5
answers
2
TIFR CSE 2012 | Part A | Question: 20
There are $1000$ balls in a bag, of which $900$ are black and $100$ are white. I randomly draw $100$ balls from the bag. What is the probability that the $101$st ball will be black? $9/10$ More than $9/10$ but less than $1$. Less than $9/10$ but more than $0$. $0$ $1$
commented
in
Probability
Jan 21
2.9k
views
tifr2012
probability
conditional-probability
5
answers
3
GATE CSE 2014 Set 1 | Question: 48
Four fair six-sided dice are rolled. The probability that the sum of the results being $22$ is $\dfrac{X}{1296}$. The value of $X$ is _______
commented
in
Probability
Jan 20
8.8k
views
gatecse-2014-set1
probability
numerical-answers
normal
5
answers
4
GATE CSE 2002 | Question: 2.16
Four fair coins are tossed simultaneously. The probability that at least one head and one tail turn up is $\frac{1}{16}$ $\frac{1}{8}$ $\frac{7}{8}$ $\frac{15}{16}$
commented
in
Probability
Jan 19
10.5k
views
gatecse-2002
probability
easy
binomial-distribution
3
answers
5
GATE CSE 2000 | Question: 2.2
$E_{1}$ and $E_{2}$ are events in a probability space satisfying the following constraints: $Pr$\left ( E_{1} \right )$ = $Pr$\left ( E_{2} \right )$ $Pr$\left ( E_{1}\cup E_{2} \right )$ = $1$ $E_{1}$ and $E_{2}$ are independent The value of $Pr$\left ( E_{1} \right )$, the probability of the event $E_{1}$, is $0$ $\dfrac{1}{4}$ $\dfrac{1}{2}$ $1$
commented
in
Probability
Jan 19
5.2k
views
gatecse-2000
probability
easy
independent-events
5
answers
6
TIFR CSE 2015 | Part A | Question: 6
Ram has a fair coin, i.e., a toss of the coin results in either head or tail and each event happens with probability exactly half $(1/2)$. He repeatedly tosses the coin until he gets heads in two consecutive tosses. The expected number of coin tosses that Ram does is. $2$ $4$ $6$ $8$ None of the above
commented
in
Probability
Jan 19
5.0k
views
tifr2015
expectation
7
answers
7
GATE CSE 2011 | Question: 18
If the difference between the expectation of the square of a random variable $\left(E\left[X^2\right]\right)$ and the square of the expectation of the random variable $\left(E\left[X\right]\right)^2$ is denoted by $R$, then $R=0$ $R<0$ $R\geq 0$ $R > 0$
answered
in
Probability
Jan 18
8.8k
views
gatecse-2011
probability
random-variable
expectation
normal
7
answers
8
GATE CSE 2004 | Question: 84
The recurrence equation $ T(1) = 1$ $T(n) = 2T(n-1) + n, n \geq 2$ evaluates to $2^{n+1} - n - 2$ $2^n - n$ $2^{n+1} - 2n - 2$ $2^n + n $
commented
in
Algorithms
Jan 15
17.5k
views
gatecse-2004
algorithms
recurrence-relation
normal
7
answers
9
GATE CSE 1999 | Question: 2.2
Two girls have picked $10$ roses, $15$ sunflowers and $15$ daffodils. What is the number of ways they can divide the flowers among themselves? $1638$ $2100$ $2640$ None of the above
answer edited
in
Combinatory
Jan 9
12.1k
views
gate1999
combinatory
normal
1
answer
10
Generating Functions
answered
in
Mathematical Logic
Jan 8
225
views
discrete-mathematics
kenneth-rosen
generating-functions
7
answers
11
TIFR CSE 2010 | Part A | Question: 12
The coefficient of $x^{3}$ in the expansion of $(1 + x)^{3} (2 + x^{2})^{10}$ is. $2^{14}$ $31$ $\left ( \frac{3}{3} \right ) + \left ( \frac{10}{1} \right )$ $\left ( \frac{3}{3} \right ) + 2\left ( \frac{10}{1} \right )$ $\left ( \frac{3}{3} \right ) \left ( \frac{10}{1} \right ) 2^{9}$
commented
in
Combinatory
Jan 8
3.3k
views
tifr2010
generating-functions
9
answers
12
GATE CSE 1991 | Question: 03,xii
If $F_1$, $F_2$ and $F_3$ are propositional formulae such that $F_1 \land F_2 \rightarrow F_3$ and $F_1 \land F_2 \rightarrow \sim F_3$ are both tautologies, then which of the following is true: Both $F_1$ and $F_2$ are tautologies The conjunction $F_1 \land F_2$ is not satisfiable Neither is tautologous Neither is satisfiable None of the above
answered
in
Mathematical Logic
Dec 28, 2023
8.8k
views
gate1991
mathematical-logic
normal
propositional-logic
multiple-selects
8
answers
13
GATE CSE 2020 | Question: 42
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.
commented
in
Combinatory
Nov 23, 2023
16.4k
views
gatecse-2020
numerical-answers
combinatory
2-marks
3
answers
14
Finding the second element neither minimum nor maximum
How many comparisons are there for finding any second element that is neither minimum or maximum. 10 5 50 70 80 2 3
answered
in
Algorithms
Oct 9, 2023
1.2k
views
algorithms
time-complexity
sorting
4
answers
15
GATE CSE 1987 | Question: 1-xiv
An operator precedence parser is a Bottom-up parser. Top-down parser. Back tracking parser. None of the above.
commented
in
Compiler Design
Aug 23, 2023
3.6k
views
gate1987
compiler-design
parsing
4
answers
16
GATE CSE 2013 | Question: 40
Consider the following two sets of $\textsf{LR(1)}$ items of an $\textsf{LR(1)}$ grammar.$\begin{array}{l|l} X \rightarrow c.X, c∕d &X → c.X, \$\\ X \rightarrow .cX, c∕ d& X → .cX, \$\\ X \rightarrow .d, c∕ d & X → .d, \$ ... $\textsf{goto}$ on $c$ will lead to two different sets. $1$ only $2$ only $1$ and $4$ only $\text{1, 2, 3}$ and $4$
commented
in
Compiler Design
Aug 23, 2023
13.2k
views
gatecse-2013
compiler-design
parsing
normal
4
answers
17
GATE CSE 1997 | Question: 75
An operating system handles requests to resources as follows. A process (which asks for some resources, uses them for some time and then exits the system) is assigned a unique timestamp are when it starts. The timestamps are monotonically increasing with time. Let us denote ... , show how. If not prove it. Can a process P ever starve? If yes, show how. If not prove it.
commented
in
Operating System
Jun 1, 2023
7.6k
views
gate1997
operating-system
resource-allocation
normal
descriptive
4
answers
18
GATE CSE 2016 Set 1 | Question: 51
Consider the following two phase locking protocol. Suppose a transaction $T$ accesses (for read or write operations), a certain set of objects $\{O_1,\ldots,O_k \}$. This is done in the following ... freedom guarantee neither serializability nor deadlock-freedom guarantee serializability but not deadlock-freedom guarantee deadlock-freedom but not serializability.
commented
in
Databases
Jun 1, 2023
21.4k
views
gatecse-2016-set1
databases
transaction-and-concurrency
normal
0
answers
19
Clrs ex 5.2-2 chapter5 page133 4thedition
Hiring assistant. Initially assistant is NULL We have n candidates who hv come to interview for the position of assistant. Each candidate has distinct scores or level of qualifications. Now initially we have no assistant(stated earlier), so the first ... to solve this sum, and my answer is The best candidate comes in at kth position. Am I right? Thankyou.
edited
in
Combinatory
May 4, 2023
204
views
4
answers
20
GATE CSE 2005 | Question: 14
The grammar $A \rightarrow AA \mid (A) \mid \epsilon$ is not suitable for predictive-parsing because the grammar is: ambiguous left-recursive right-recursive an operator-grammar
commented
in
Compiler Design
Nov 7, 2022
23.3k
views
gatecse-2005
compiler-design
parsing
grammar
easy
2
answers
21
GATE CSE 2016 Set 2 | Question: 06
Suppose that the eigenvalues of matrix $A$ are $1, 2, 4$. The determinant of $\left(A^{-1}\right)^{T}$ is _________.
commented
in
Linear Algebra
Aug 30, 2022
11.5k
views
gatecse-2016-set2
linear-algebra
eigen-value
normal
numerical-answers
4
answers
22
GATE CSE 2014 Set 1 | Question: 5
The value of the dot product of the eigenvectors corresponding to any pair of different eigenvalues of a $4-by-4$ symmetric positive definite matrix is ___________
commented
in
Linear Algebra
Aug 29, 2022
14.4k
views
gatecse-2014-set1
linear-algebra
eigen-value
numerical-answers
normal
3
answers
23
GATE CSE 1997 | Question: 21
Given that $L$ is a language accepted by a finite state machine, show that $L^P$ and $L^R$ are also accepted by some finite state machines, where $L^P = \left\{s \mid ss' \in L \text{ some string }s'\right\}$ $L^R = \left\{s \mid s \text{ obtained by reversing some string in }L\right\}$
comment edited
in
Theory of Computation
Aug 26, 2022
5.3k
views
gate1997
theory-of-computation
finite-automata
proof
7
answers
24
GATE CSE 2003 | Question: 50
Consider the following deterministic finite state automaton $M$. Let $S$ denote the set of seven bit binary strings in which the first, the fourth, and the last bits are $1$. The number of strings in $S$ that are accepted by $M$ is $1$ $5$ $7$ $8$
commented
in
Theory of Computation
Aug 25, 2022
14.9k
views
gatecse-2003
theory-of-computation
finite-automata
normal
1
answer
25
GATE CSE 1996 | Question: 12
Given below are the transition diagrams for two finite state machines $M_1$ and $M_2$ recognizing languages $L_1$ and $L_2$ respectively. Display the transition diagram for a machine that recognizes $L_1.L_2$, obtained from transition diagrams for $M_1$ ... $\varepsilon$ transitions and no new states. (Final states are enclosed in double circles).
commented
in
Theory of Computation
Aug 25, 2022
8.5k
views
gate1996
theory-of-computation
finite-automata
normal
descriptive
9
answers
26
GATE CSE 1991 | Question: 17,b
Let $L$ be the language of all binary strings in which the third symbol from the right is a $1$. Give a non-deterministic finite automaton that recognizes $L$. How many states does the minimized equivalent deterministic finite automaton have? Justify your answer briefly?
answered
in
Theory of Computation
Aug 24, 2022
13.6k
views
gate1991
theory-of-computation
finite-automata
normal
descriptive
2
answers
27
GATE CSE 1988 | Question: 15
Consider the DFA $M$ and NFA $M_{2}$ as defined below. Let the language accepted by machine $M$ be $L$. What language machine $M_{2}$ accepts, if $F2=A?$ $F2=B?$ $F2=C?$ $F2=D?$ $M=(Q, \Sigma, \delta, q_0, F)$ $M_{2}=(Q2, \Sigma, \delta_2, q_{00}, F2)$ ... $D=\{\langle p, q, r \rangle \mid p,q \in Q; r \in F\}$
commented
in
Theory of Computation
Aug 24, 2022
2.9k
views
gate1988
descriptive
theory-of-computation
finite-automata
difficult
1
answer
28
Engineering Mathematics
why 4^10 is done. solution: Please explain the last portion why 4^ 10 is done.
commented
in
Set Theory & Algebra
Aug 23, 2022
536
views
engineering-mathematics
ace-test-series
set-theory
0
answers
29
Engineering Mathematics
Please verify the solution(the differentiation part ),
commented
in
Calculus
Aug 23, 2022
580
views
calculus
ace-test-series
3
answers
30
GATE CSE 1997 | Question: 13
Let $F$ be the set of one-to-one functions from the set $\{1, 2, \dots, n\}$ to the set $\{1, 2,\dots, m\}$ where $m\geq n\geq1$. How many functions are members of $F$? How many functions $f$ in $F$ satisfy the property $f(i)=1$ for some $i, 1\leq i \leq n$? How many functions $f$ in $F$ satisfy the property $f(i)<f(j)$ for all $i,j \ \ 1\leq i \leq j \leq n$?
commented
in
Set Theory & Algebra
Aug 23, 2022
6.5k
views
gate1997
set-theory&algebra
functions
normal
descriptive
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...