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 SomeEarth
4
answers
1
GATE CSE 1996 | Question: 2.7
The probability that top and bottom cards of a randomly shuffled deck are both aces is $\frac{4}{52} \times \frac{4}{52}$ $\frac{4}{52} \times \frac{3}{52}$ $\frac{4}{52} \times \frac{3}{51}$ $\frac{4}{52} \times \frac{4}{51}$
The probability that top and bottom cards of a randomly shuffled deck are both aces is$\frac{4}{52} \times \frac{4}{52}$$\frac{4}{52} \times \frac{3}{52}$$\frac{4}{52} \t...
5.0k
views
commented
Feb 2, 2021
Probability
gate1996
probability
easy
+
–
3
answers
2
GATE CSE 1994 | Question: 13
Consider the following relational schema: COURSES (cno, cname) STUDENTS (rollno, sname, age, year) REGISTERED_FOR (cno, rollno) The underlined attributes indicate the primary keys for the relations. The year' attribute for the STUDENTS relation indicates the year in ... for cno $322.$ Write a SQL query to print the age and year of the youngest student in each year.
Consider the following relational schema:COURSES (cno, cname)STUDENTS (rollno, sname, age, year)REGISTERED_FOR (cno, rollno)The underlined attributes indicate the primary...
6.4k
views
commented
Jan 28, 2021
Databases
gate1994
databases
relational-algebra
sql
normal
descriptive
+
–
5
answers
3
GATE CSE 2012 | Question: 37
How many onto (or surjective) functions are there from an $n$-element $(n ≥ 2)$ set to a $2$-element set? $ 2^{n}$ $2^{n} – 1$ $2^{n} – 2$ $2(2^{n} – 2)$
How many onto (or surjective) functions are there from an $n$-element $(n ≥ 2)$ set to a $2$-element set?$ 2^{n}$$2^{n} – 1$$2^{n} – 2$$2(2^{n} – 2)$
9.4k
views
commented
Jan 19, 2021
Set Theory & Algebra
gatecse-2012
set-theory&algebra
functions
normal
+
–
10
answers
4
GATE CSE 2003 | Question: 38
Consider the set \(\{a, b, c\}\) with binary operators \(+\) and \(*\) defined as follows: ... $(x, y)$ that satisfy the equations) is $0$ $1$ $2$ $3$
Consider the set \(\{a, b, c\}\) with binary operators \(+\) and \(*\) defined as follows:$$\begin{array}{|c|c|c|c|} \hline \textbf{+} & \textbf{a}& \textbf{b} &\textbf{c...
7.1k
views
answered
Jan 16, 2021
Set Theory & Algebra
gatecse-2003
set-theory&algebra
normal
binary-operation
+
–
1
answer
5
GATE IT 2008 | Question: 79
$A$ CFG $G$ is given with the following productions where $S$ is the start symbol, $A$ is a non-terminal and a and b are terminals. $S → aS \mid A$ $A → aAb \mid bAa \mid \epsilon$ For the string "$aabbaab$" how many steps are required to derive the string and how many parse trees are there? $6$ and $1$ $6$ and $2$ $7$ and $2$ $4$ and $2$
$A$ CFG $G$ is given with the following productions where $S$ is the start symbol, $A$ is a non-terminal and a and b are terminals.$S → aS \mid A$$A → aAb \mid bAa \m...
8.5k
views
commented
Jan 15, 2021
Compiler Design
gateit-2008
compiler-design
context-free-grammar
parsing
normal
+
–
7
answers
6
GATE CSE 2014 Set 3 | Question: 11
The minimum number of arithmetic operations required to evaluate the polynomial $P(X) = X^5+4X^3+6X+5$ for a given value of $X$, using only one temporary variable is ______.
The minimum number of arithmetic operations required to evaluate the polynomial $P(X) = X^5+4X^3+6X+5$ for a given value of $X$, using only one temporary variable is ____...
19.3k
views
commented
Jan 13, 2021
Compiler Design
gatecse-2014-set3
compiler-design
numerical-answers
normal
code-optimization
+
–
2
answers
7
GATE CSE 2008 | Question: 25
A point on a curve is said to be an extremum if it is a local minimum or a local maximum. The number of distinct extrema for the curve $3x^4-16x^3+24x^2+37$ is $0$ $1$ $2$ $3$
A point on a curve is said to be an extremum if it is a local minimum or a local maximum. The number of distinct extrema for the curve $3x^4-16x^3+24x^2+37$ is$0$$1$$2$$3...
8.5k
views
commented
Jan 9, 2021
Calculus
gatecse-2008
calculus
maxima-minima
easy
+
–
2
answers
8
GATE IT 2008 | Question: 33
Consider the following languages. $L_1 = \{a^i b^j c^k \mid i = j, k \geq 1\}$ $L_2 = \{a^i b^j \mid j = 2i, i \geq 0\}$ Which of the following is true? $L_1$ is not a CFL but $L_2$ is $L_1 \cap L_2 = \varnothing $ and $L_1$ is non-regular $L_1 \cup L_2$ is not a CFL but $L_2$ is There is a $4$-state PDA that accepts $L_1$, but there is no DPDA that accepts $L_2$.
Consider the following languages.$L_1 = \{a^i b^j c^k \mid i = j, k \geq 1\}$$L_2 = \{a^i b^j \mid j = 2i, i \geq 0\}$Which of the following is true?$L_1$ is not a CFL bu...
6.0k
views
commented
Jan 6, 2021
Theory of Computation
gateit-2008
theory-of-computation
normal
identify-class-language
+
–
3
answers
9
GATE CSE 2015 Set 2 | Question: 5
The larger of the two eigenvalues of the matrix $\begin{bmatrix} 4 & 5 \\ 2 & 1 \end{bmatrix}$ is _______.
The larger of the two eigenvalues of the matrix $\begin{bmatrix} 4 & 5 \\ 2 & 1 \end{bmatrix}$ is _______.
7.6k
views
commented
Jan 1, 2021
Linear Algebra
gatecse-2015-set2
linear-algebra
eigen-value
easy
numerical-answers
+
–
7
answers
10
GATE CSE 2012 | Question: 46
Consider the set of strings on $\{0,1\}$ in which, every substring of $3$ symbols has at most two zeros. For example, $001110$ and $011001$ are in the language, but $100010$ is not. All strings of length less than $3$ are also in the language. A partially ...
Consider the set of strings on $\{0,1\}$ in which, every substring of $3$ symbols has at most two zeros. For example, $001110$ and $011001$ are in the language, but $1000...
14.3k
views
commented
Dec 17, 2020
Theory of Computation
gatecse-2012
theory-of-computation
finite-automata
normal
+
–
4
answers
11
GATE CSE 2020 | Question: GA-9
Two straight lines are drawn perpendicular to each other in $X-Y$ plane. If $\alpha$ and $\beta$ are the acute angles the straight lines make with the $\text{X-}$ axis, then $\alpha + \beta$ is ________. $60^{\circ}$ $90^{\circ}$ $120^{\circ}$ $180^{\circ}$
Two straight lines are drawn perpendicular to each other in $X-Y$ plane. If $\alpha$ and $\beta$ are the acute angles the straight lines make with the $\text{X-}$ axis, t...
8.1k
views
answered
Feb 12, 2020
Quantitative Aptitude
gatecse-2020
quantitative-aptitude
geometry
cartesian-coordinates
2-marks
+
–
3
answers
12
GATE CSE 2020 | Question: 7
Which one of the following regular expressions represents the set of all binary strings with an odd number of $1’$s? $((0+1)^*1(0+1)^*1)^*10^*$ $(0^*10^*10^*)^*0^*1$ $10^*(0^*10^*10^*)^*$ $(0^*10^*10^*)^*10^*$
Which one of the following regular expressions represents the set of all binary strings with an odd number of $1’$s?$((0+1)^*1(0+1)^*1)^*10^*$$(0^*10^*10^*)^*0^*1$$10^*...
23.7k
views
commented
Feb 12, 2020
Theory of Computation
gatecse-2020
regular-expression
normal
theory-of-computation
1-mark
+
–
2
answers
13
GATE CSE 2020 | Question: GA-8
The figure below shows an annular ring with outer and inner as $b$ and $a$, respectively. The annular space has been painted in the form of blue colour circles touching the outer and inner periphery of annular space. If maximum $n$ number of circles can be painted, then the unpainted area available in ... $\pi [(b^{2}-a^{2})+n(b-a)^{2}]$
The figure below shows an annular ring with outer and inner as $b$ and $a$, respectively. The annular space has been painted in the form of blue colour circles touching t...
5.6k
views
answered
Feb 12, 2020
Quantitative Aptitude
gatecse-2020
quantitative-aptitude
geometry
circle
area
2-marks
+
–
3
answers
14
GATE CSE 2006 | Question: 27
Consider the following propositional statements: $P_1: ((A ∧ B) → C)) ≡ ((A → C) ∧ (B → C))$ $P_2: ((A ∨ B) → C)) ≡ ((A → C) ∨ (B → C))$ Which one of the following is true? $P_1$ is a tautology, but not $P_2$ $P_2$ is a tautology, but not $P_1$ $P_1$ and $P_2$ are both tautologies Both $P_1$ and $P_2$ are not tautologies
Consider the following propositional statements:$P_1: ((A ∧ B) → C)) ≡ ((A → C) ∧ (B → C))$$P_2: ((A ∨ B) → C)) ≡ ((A → C) ∨ (B → C))$Which one of...
8.6k
views
commented
Aug 23, 2019
Mathematical Logic
gatecse-2006
mathematical-logic
normal
propositional-logic
+
–
4
answers
15
GATE CSE 1992 | Question: 02,xvi
Which of the following is/are a tautology? $a \vee b \to b \wedge c$ $a \wedge b \to b \vee c$ $a \vee b \to \left(b \to c \right)$ $a \to b \to \left(b \to c \right)$
Which of the following is/are a tautology?$a \vee b \to b \wedge c$$a \wedge b \to b \vee c$$a \vee b \to \left(b \to c \right)$$a \to b \to \left(b \to c \right)$
10.9k
views
commented
Aug 20, 2019
Mathematical Logic
gate1992
mathematical-logic
easy
propositional-logic
multiple-selects
+
–
3
answers
16
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...
2.1k
views
commented
Aug 19, 2019
Mathematical Logic
tifr2011
mathematical-logic
propositional-logic
+
–
12
answers
17
GATE CSE 2015 Set 3 | Question: 24
In a room there are only two types of people, namely $\text{Type 1}$ and $\text{Type 2}$. $\text{Type 1}$ people always tell the truth and $\text{Type 2}$ people always lie. You give a fair coin to a person in that room, without knowing which type ... person is of $\text{Type 2}$, then the result is tail If the person is of $\text{Type 1}$, then the result is tail
In a room there are only two types of people, namely $\text{Type 1}$ and $\text{Type 2}$. $\text{Type 1}$ people always tell the truth and $\text{Type 2}$ people always l...
17.9k
views
commented
Aug 19, 2019
Mathematical Logic
gatecse-2015-set3
mathematical-logic
difficult
logical-reasoning
+
–
7
answers
18
GATE IT 2006 | Question: 21
Consider the following first order logic formula in which $R$ is a binary relation symbol. $∀x∀y (R(x, y) \implies R(y, x))$ The formula is satisfiable and valid satisfiable and so is its negation unsatisfiable but its negation is valid satisfiable but its negation is unsatisfiable
Consider the following first order logic formula in which $R$ is a binary relation symbol.$∀x∀y (R(x, y) \implies R(y, x))$The formula issatisfiable and validsatisfia...
13.4k
views
commented
Aug 11, 2019
Mathematical Logic
gateit-2006
mathematical-logic
normal
first-order-logic
+
–
2
answers
19
Kenneth Rosen Edition 7 Exercise 2.3 Question 69 (Page No. 155)
Find the inverse function of $f(x) = x^3 +1.$
Find the inverse function of $f(x) = x^3 +1.$
303
views
answered
Apr 11, 2019
Set Theory & Algebra
kenneth-rosen
discrete-mathematics
set-theory&algebra
+
–
7
answers
20
GATE CSE 2019 | Question: 40
Consider the following statements: The smallest element in a max-heap is always at a leaf node The second largest element in a max-heap is always a child of a root node A max-heap can be constructed from a binary search tree in $\Theta(n)$ time A binary search tree ... time Which of the above statements are TRUE? I, II and III I, II and IV I, III and IV II, III and IV
Consider the following statements:The smallest element in a max-heap is always at a leaf nodeThe second largest element in a max-heap is always a child of a root nodeA ma...
20.7k
views
commented
Feb 9, 2019
DS
gatecse-2019
data-structures
binary-heap
2-marks
+
–
4
answers
21
GATE CSE 2019 | Question: GA-3
Two cars at the same time from the same location and go in the same direction. The speed of the first car is $50$ km/h and the speed of the second car is $60$ km/h. The number of hours it takes for the distance between the two cars to be $20$ km is _____. $1$ $2$ $3$ $6$
Two cars at the same time from the same location and go in the same direction. The speed of the first car is $50$ km/h and the speed of the second car is $60$ km/h. The n...
7.3k
views
answer edited
Feb 8, 2019
Quantitative Aptitude
gatecse-2019
general-aptitude
quantitative-aptitude
speed-time-distance
1-mark
+
–
3
answers
22
GATE CSE 2019 | Question: 19
Consider the grammar given below: $S \rightarrow Aa$ $A \rightarrow BD$ $B \rightarrow b \mid \epsilon $ $D \rightarrow d \mid \epsilon $ Let $a,b,d$ and $\$ be indexed as follows:$\begin{array}{|l|l|l|l|} \hline a & b & d & \$ \ ... $)$ , then the answer should be $3210$)
Consider the grammar given below:$S \rightarrow Aa$$A \rightarrow BD$$B \rightarrow b \mid \epsilon $$D \rightarrow d \mid \epsilon $Let $a,b,d$ and $\$$ be indexed as fo...
20.2k
views
answer edited
Feb 8, 2019
Compiler Design
gatecse-2019
numerical-answers
compiler-design
parsing
1-mark
+
–
18
answers
23
GATE CSE 2019 | Question: 21
The value of $3^{51} \text{ mod } 5$ is _____
The value of $3^{51} \text{ mod } 5$ is _____
18.3k
views
commented
Feb 7, 2019
Combinatory
gatecse-2019
numerical-answers
combinatory
modular-arithmetic
1-mark
+
–
7
answers
24
GATE CSE 2019 | Question: 13
Compute $\displaystyle \lim_{x \rightarrow 3} \frac{x^4-81}{2x^2-5x-3}$ $1$ $53/12$ $108/7$ Limit does not exist
Compute $\displaystyle \lim_{x \rightarrow 3} \frac{x^4-81}{2x^2-5x-3}$$1$$53/12$$108/7$Limit does not exist
6.4k
views
answered
Feb 7, 2019
Calculus
gatecse-2019
engineering-mathematics
calculus
limits
1-mark
+
–
4
answers
25
GATE IT 2006 | Question: 2
For the set $N$ of natural numbers and a binary operation $f : N \times N \to N,$ an element $z \in N$ is called an identity for $f,$ if $f (a, z) = a = f(z, a),$ for all $a \in N.$ Which of the following binary operations have an identity? $f (x, y) = x + y - 3$ $f (x, y) = \max(x, y)$ $f (x, y) = x^y$ I and II only II and III only I and III only None of these
For the set $N$ of natural numbers and a binary operation $f : N \times N \to N,$ an element $z \in N$ is called an identity for $f,$ if $f (a, z) = a = f(z, a),$ for all...
9.7k
views
commented
Jan 29, 2019
Set Theory & Algebra
gateit-2006
set-theory&algebra
easy
binary-operation
+
–
8
answers
26
GATE CSE 2007 | Question: 84
Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to move either one unit up or one unit right, i.e., if it is at $(i,j)$ then it can move to either $(i + 1, j)$ or $(i,j + 1)$. How many distinct paths are there for the ... $(10,10)$ starting from the initial position $(0,0)$? $^{20}\mathrm{C}_{10}$ $2^{20}$ $2^{10}$ None of the above
Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to move either one unit up or one unit right, i.e., if it is at $(i,j)$ then it can move...
12.6k
views
commented
Jan 28, 2019
Combinatory
gatecse-2007
combinatory
+
–
6
answers
27
GATE CSE 2010 | Question: 45
The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$ ... $P0$ print '$0$'? At least twice Exactly twice Exactly thrice Exactly once
The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$$$\begin{array}{|l|l|}\hli...
26.3k
views
commented
Jan 19, 2019
Operating System
gatecse-2010
operating-system
process-synchronization
normal
+
–
3
answers
28
GATE CSE 2017 Set 2 | Question: 51
Consider the set of process with arrival time (in milliseonds), CPU burst time (in millisecods) and priority ($0$ ... The average waiting time (in milli seconds) of all the process using premtive priority scheduling algorithm is ______
Consider the set of process with arrival time (in milliseonds), CPU burst time (in millisecods) and priority ($0$ is the highest priority) shown below. None of the proce...
13.1k
views
commented
Jan 17, 2019
Operating System
gatecse-2017-set2
operating-system
process-scheduling
numerical-answers
+
–
6
answers
29
GATE CSE 2003 | Question: 87
Consider three data items $D1, D2,$ and $D3,$ and the following execution schedule of transactions $T1, T2,$ and $T3.$ In the diagram, $R(D)$ and $W(D)$ denote the actions reading and writing the data item $D$ ... $T2; T1; T3$ The schedule is serializable as $T3; T2; T1$ The schedule is not serializable
Consider three data items $D1, D2,$ and $D3,$ and the following execution schedule of transactions $T1, T2,$ and $T3.$ In the diagram, $R(D)$ and $W(D)$ denote the action...
11.3k
views
commented
Jan 16, 2019
Databases
gatecse-2003
databases
transaction-and-concurrency
normal
+
–
6
answers
30
GATE CSE 2007 | Question: 60
Consider the relation employee(name, sex, supervisorName) with name as the key, supervisorName gives the name of the supervisor of the employee under consideration. What does the following Tuple Relational Calculus query produce? ... immediate male subordinates. Names of employees with no immediate female subordinates. Names of employees with a female supervisor.
Consider the relation employee(name, sex, supervisorName) with name as the key, supervisorName gives the name of the supervisor of the employee under consideration. What ...
23.7k
views
commented
Jan 14, 2019
Databases
gatecse-2007
databases
relational-calculus
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register