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 HitechGa
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by HitechGa
1
answer
1
GATE CSE 1989 | Question: 4-viii
$P_{n} (t)$ is the probability of $n$ events occurring during a time interval $t$. How will you express $P_{0} (t + h)$ in terms of $P_{0} (h)$, if $P_{0} (t)$ has stationary independent increments? (Note: $P_{t} (t)$is the probability density function).
commented
in
Probability
Sep 16, 2022
1.6k
views
gate1989
descriptive
probability
poisson-distribution
2
answers
2
GATE CSE 1999 | Question: 2.15
A grammar that is both left and right recursive for a non-terminal, is Ambiguous Unambiguous Information is not sufficient to decide whether it is ambiguous or unambiguous None of the above
commented
in
Compiler Design
Jul 12, 2022
9.6k
views
gate1999
compiler-design
grammar
normal
2
answers
3
GATE CSE 1995 | Question: 8
Construct the $\text{LL(1)}$ table for the following grammar. $Expr \rightarrow \_Expr$ $Expr \rightarrow (Expr)$ $Expr \rightarrow Var\; ExprTail$ $ExprTail \rightarrow \_Expr$ $Expr \rightarrow \lambda$ $Var \rightarrow Id\; VarTail$ $VarTail \rightarrow (Expr)$ $VarTail \rightarrow \lambda$ $Goal \rightarrow Expr$
commented
in
Compiler Design
Jul 11, 2022
2.5k
views
gate1995
compiler-design
parsing
normal
descriptive
2
answers
4
Interview: ISI mtech CS
Provide a synchronizing mechanism using semaphores such that a tiger and an elephant are not allowed to drink water from a pond simultaneously whereas more than one tiger or more than one elephant can.
commented
in
Operating System
Mar 6, 2022
2.0k
views
isi-interview
operating-system
process-synchronization
semaphore
2
answers
5
GATE CSE 2022 | Question: 47
Consider a network with three routers $\text{P, Q, R}$ shown in the figure below. All the links have cost of unity. The routers exchange distance vector routing information and have converged on the routing tables, after which the link $\text{Q-R}$ ... off to one decimal place) between $\text{P}$ and $\text{Q},$ leading to count-to-infinity problem, is _______________.
commented
in
Computer Networks
Feb 22, 2022
9.5k
views
gatecse-2022
numerical-answers
computer-networks
routing
distance-vector-routing
2-marks
3
answers
6
GATE CSE 2022 | Question: 39
Consider a simple undirected weighted graph $\textit{G},$ all of whose edge weights are distinct. Which of the following statements about the minimum spanning trees of $\textit{G}$ is/are $\text{TRUE}?$ The edge with the second smallest weight is ... always be part of any minimum spanning tree of $\textit{G}.$ $\textit{G}$ can have multiple minimum spanning trees.
commented
in
Algorithms
Feb 17, 2022
11.2k
views
gatecse-2022
algorithms
spanning-tree
minimum-spanning-tree
multiple-selects
2-marks
1
answer
7
GATE CSE 2021 Set 2 | Question: 36
Consider the following two statements about regular languages: $S_1$: Every infinite regular language contains an undecidable language as a subset. $S_2$: Every finite language is regular. Which one of the following choices is correct? Only $S_1$ is true Only $S_2$ is true Both $S_1$ and $S_2$ are true Neither $S_1$ nor $S_2$ is true
commented
in
Theory of Computation
Feb 2, 2022
11.9k
views
gatecse-2021-set2
theory-of-computation
regular-language
decidability
2-marks
5
answers
8
GATE CSE 2003 | Question: 60, ISRO2007-45
A program consists of two modules executed sequentially. Let $f_1(t)$ and $f_2(t)$ ... $\int_0^t f_1(x)f_2(t-x)dx$ $\max\{f_1(t),f_2(t)\}$
answer edited
in
Probability
Jan 26, 2022
9.1k
views
gatecse-2003
probability
normal
isro2007
probability-density-function
5
answers
9
GATE CSE 2006 | Question: 74
Consider two cache organizations. First one is $32 \; \textsf{KB}\;2\text{-way}$ set associative with $32 \; \text{byte}$ block size, the second is of same size but direct mapped. The size of an address is $32\; \text{bits}$ in both cases . A $2\text{-to-}1$ multiplexer has ... The value of $h_1$ is: $2.4 \text{ ns} $ $2.3 \text{ ns}$ $1.8 \text{ ns}$ $1.7 \text{ ns}$
commented
in
CO and Architecture
Jan 23, 2022
29.1k
views
gatecse-2006
co-and-architecture
cache-memory
normal
3
answers
10
GATE IT 2006 | Question: 38
When multiplicand $Y$ is multiplied by multiplier $X = x_{n - 1}x_{n-2} \dots x_0$ ... partial products for rows $5$ and $8$ are $2Y$ and $Y$ $-2Y$ and $2Y$ $-2Y$ and $0$ $0$ and $Y$
commented
in
Digital Logic
Jan 23, 2022
10.4k
views
gateit-2006
digital-logic
booths-algorithm
difficult
4
answers
11
GATE CSE 2016 Set 1 | Question: 29
Consider the following experiment. Step 1. Flip a fair coin twice. Step 2. If the outcomes are (TAILS, HEADS) then output $Y$ and stop. Step 3. If the outcomes are either (HEADS, HEADS) or (HEADS, TAILS), then output $N$ and stop. Step 4. If ... , TAILS), then go to Step $1.$ The probability that the output of the experiment is $Y$ is (up to two decimal places)
commented
in
Probability
Jan 18, 2022
11.7k
views
gatecse-2016-set1
probability
normal
numerical-answers
4
answers
12
GATE CSE 1998 | Question: 3a
Two friends agree to meet at a park with the following conditions. Each will reach the park between 4:00 pm and 5:00 pm and will see if the other has already arrived. If not, they will wait for 10 minutes or the end of the hour whichever is earlier and leave. What is the probability that the two will not meet?
commented
in
Probability
Jan 18, 2022
6.2k
views
gate1998
probability
normal
numerical-answers
uniform-distribution
1
answer
13
GATE IT 2004 | Question: 33
Let $X$ and $Y$ be two exponentially distributed and independent random variables with mean $α$ and $β$, respectively. If $Z$ = min $(X, Y)$, then the mean of $Z$ is given by $\left(\dfrac{1}{\alpha + \beta}\right)$ $\min (\alpha, \beta)$ $\left(\dfrac{\alpha\beta}{\alpha + \beta}\right)$ $\alpha + \beta$
commented
in
Probability
Jan 17, 2022
16.9k
views
gateit-2004
probability
exponential-distribution
random-variable
normal
6
answers
14
GATE CSE 2013 | Question: 24
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is $\dfrac{1}{2}.$ What is the expected number of unordered cycles of length three? $\dfrac {1}{8}$ $1$ $7$ $8$
answer edited
in
Probability
Jan 17, 2022
19.7k
views
gatecse-2013
probability
expectation
normal
2
answers
15
GATE CSE 2021 Set 1 | Question: 41
An $articulation$ $point$ in a connected graph is a vertex such that removing the vertex and its incident edges disconnects the graph into two or more connected components. Let $T$ be a $\text{DFS}$ tree obtained by doing $\text{DFS}$ ... is a descendent of $u$ in $T$, then all paths from $x$ to $y$ in $G$ must pass through $u$.
comment reshown
in
DS
Jan 17, 2022
13.9k
views
gatecse-2021-set1
multiple-selects
data-structures
tree
2-marks
2
answers
16
GATE CSE 2015 Set 1 | Question: 13
Which one of the following is TRUE at any valid state in shift-reduce parsing? Viable prefixes appear only at the bottom of the stack and not inside Viable prefixes appear only at the top of the stack and not inside The stack contains only a set of viable prefixes The stack never contains viable prefixes
commented
in
Compiler Design
Jan 17, 2022
18.9k
views
gatecse-2015-set1
compiler-design
parsing
normal
viable-prefix
10
answers
17
GATE CSE 2019 | Question: 35
Consider the first order predicate formula $\varphi$: $\forall x [ ( \forall z \: z | x \Rightarrow (( z=x) \vee (z=1))) \rightarrow \exists w ( w > x) \wedge (\forall z \: z | w \Rightarrow ((w=z) \vee (z=1)))]$ Here $a \mid b$ denotes ... of all integers Which of the above sets satisfy $\varphi$? $S_1$ and $S_2$ $S_1$ and $S_3$ $S_2$ and $S_3$ $S_1, S_2$ and $S_3$
commented
in
Mathematical Logic
Jan 15, 2022
20.0k
views
gatecse-2019
engineering-mathematics
discrete-mathematics
mathematical-logic
first-order-logic
2-marks
4
answers
18
GATE IT 2007 | Question: 76
Consider the sequence $\langle x_n \rangle , \: n \geq 0$ defined by the recurrence relation $x_{n+1} = c . x^2_n -2$, where $c > 0$. Suppose there exists a non-empty, open interval $(a, b)$ such that for all $x_0$ satisfying $a < x_0 < b$, the ... sequence converges to the value? $\frac{1+\sqrt{1+8c}}{2c}$ $\frac{1-\sqrt{1+8c}}{2c}$ $2$ $\frac{2}{2c-1}$
comment edited
in
Combinatory
Jan 15, 2022
5.5k
views
gateit-2007
combinatory
normal
recurrence-relation
9
answers
19
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$
commented
in
Combinatory
Jan 14, 2022
16.7k
views
gatecse-2004
combinatory
7
answers
20
GATE CSE 2010 | Question: 37
The program below uses six temporary variables $a, b, c, d, e, f$. a = 1 b = 10 c = 20 d = a + b e = c + d f = c + e b = c + e e = b + f d = 5 + e return d + f Assuming that all operations take their operands from registers, what is the minimum number of registers needed to execute this program without spilling? $2$ $3$ $4$ $6$
commented
in
Compiler Design
Jan 14, 2022
21.8k
views
gatecse-2010
compiler-design
target-code-generation
register-allocation
normal
1
answer
21
GATE CSE 1989 | Question: 8b
Indicate the result of the following program if the language uses (i) static scope rules and (ii) dynamic scope rules. var x, y:integer; procedure A (var z:integer); var x:integer; begin x:=1; B; z:= x end; procedure B; begin x:=x+1 end; begin x:=5; A(y); write (y) ...end.
commented
in
Compiler Design
Jan 14, 2022
1.6k
views
gate1989
descriptive
compiler-design
runtime-environment
2
answers
22
GATE CSE 2015 Set 3 | Question: 16
Among simple LR (SLR), canonical LR, and look-ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is the most powerful, in that order? SLR, LALR Canonical LR, LALR SLR, canonical LR LALR, canonical LR
commented
in
Compiler Design
Jan 13, 2022
8.4k
views
gatecse-2015-set3
compiler-design
parsing
normal
6
answers
23
GATE CSE 2006 | Question: 7
Consider the following grammar $S \rightarrow S * E$ $S \rightarrow E$ $E \rightarrow F + E$ $E \rightarrow F$ $F \rightarrow id$ Consider the following LR(0) items corresponding to the grammar above $S \rightarrow S *.E$ $E \rightarrow F. + E$ ... will appear in the same set in the canonical sets-of-items for the grammar? i and ii ii and iii i and iii None of the above
commented
in
Compiler Design
Jan 13, 2022
11.6k
views
gatecse-2006
compiler-design
parsing
normal
2
answers
24
GATE CSE 1993 | Question: 25
A simple Pascal like language has only three statements. assignment statement e.g. x:=expression loop construct e.g. for i:=expression to expression do statement sequencing e.g. begin statement ; ; statement end Write a context-free grammar (CFG) for statements in ... CFG. Show the parse tree for the following statements: for j:=2 to 10 do begin x:=expr1; y:=expr2; end
commented
in
Compiler Design
Jan 13, 2022
1.5k
views
gate1993
compiler-design
parsing
normal
descriptive
1
answer
25
GATE CSE 1988 | Question: 8i
Consider the procedure declaration: Procedure P (k: integer) where the parameter passing mechanism is call-by-value-result. Is it correct if the call, P (A[i]), where A is an array and i an integer, is implemented as below. create a new local variable, ... P using z for k; set A [i] to z; Explain your answer. If this is incorrect implementation, suggest a correct one.
commented
in
Compiler Design
Jan 13, 2022
1.7k
views
gate1988
descriptive
compiler-design
runtime-environment
parameter-passing
4
answers
26
GATE CSE 2019 | Question: 43
Consider the augmented grammar given below: $S’ \rightarrow S$ $S \rightarrow \langle L \rangle \mid id$ $L \rightarrow L, S \mid S$ Let $I_0 = \text{CLOSURE} (\{[S’ \rightarrow \cdot S ]\}).$ The number of items in the set $\text{GOTO} (I_0, \langle \: )$ is______
commented
in
Compiler Design
Jan 12, 2022
17.6k
views
gatecse-2019
numerical-answers
compiler-design
grammar
2-marks
2
answers
27
GATE CSE 1998 | Question: 6b
Consider the grammar S $\rightarrow Aa \mid b$ A $\rightarrow Ac \mid Sd \mid \epsilon$ Construct an equivalent grammar with no left recursion and with minimum number of production rules.
commented
in
Compiler Design
Jan 11, 2022
7.0k
views
gate1998
compiler-design
grammar
descriptive
3
answers
28
GATE CSE 1995 | Question: 1.10
Consider a grammar with the following productions $S \rightarrow a \alpha b \mid b \alpha c \mid aB$ $S \rightarrow \alpha S\mid b$ $S \rightarrow \alpha b b\mid ab$ $S \alpha \rightarrow bd b\mid b$ The above grammar is: Context free Regular Context sensitive $LR(k)$
commented
in
Compiler Design
Jan 11, 2022
18.2k
views
gate1995
compiler-design
grammar
normal
5
answers
29
GATE CSE 1991 | Question: 10b
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative $E \rightarrow E -T\mid T$ $T \rightarrow T/F\mid F$ $F \rightarrow (E) \mid id$ ($E$ is the start symbol ... with redundant parentheses. Do this with minimum number of changes to the given production rules and adding at most one more production rule.
comment edited
in
Compiler Design
Jan 11, 2022
4.1k
views
gate1991
grammar
compiler-design
normal
descriptive
2
answers
30
GATE CSE 2021 Set 2 | Question: 30
Consider the following $\text{ANSI C}$ code segment: z=x + 3 + y->f1 + y->f2; for (i = 0; i < 200; i = i + 2) { if (z > i) { p = p + x + 3; q = q + y->f1; } else { p = p + y->f2; q = q + x + 3; } ... $\textsf{y ->f2}$) in the optimized code, respectively, are: $403$ and $102$ $203$ and $2$ $303$ and $102$ $303$ and $2$
commented
in
Compiler Design
Jan 10, 2022
9.7k
views
gatecse-2021-set2
code-optimization
compiler-design
2-marks
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:...