Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Most viewed questions
2
votes
1
answer
58801
GATE Overflow Test Series | Compiler Design | Test 1 | Question: 15
Consider the following grammar: $E \rightarrow TE'$ $E' \rightarrow +TE' \mid \epsilon$ $T \rightarrow FT'$ $T' \rightarrow \ast FT' \mid \epsilon$ $F \rightarrow (E) \mid id$ In the predictive ... $E \rightarrow id\:\text{and}\: T' \rightarrow \epsilon$
Consider the following grammar:$E \rightarrow TE'$$E' \rightarrow +TE' \mid \epsilon$$T \rightarrow FT'$$T' \rightarrow \ast FT' \mid \epsilon$$F \rightarrow (E) \mid id$...
gatecse
126
views
gatecse
asked
Dec 14, 2020
Compiler Design
go2025-cd-1
parsing
+
–
1
votes
1
answer
58802
GATE Overflow Test Series | Mixed Subjects | Test 4 | Question: 27
A desktop, a printer and a radio receptor are connected by a single wire to form a network capable of transmitting up to $4\;\text{KBps}.$ For a $5$ second period, all three devices were backlogged (i.e. had data to send). In these ... $F$ the fairness $(F)$ in the network during this period, the value of $U + F = $ _______
A desktop, a printer and a radio receptor are connected by a single wire to form a network capable of transmitting up to $4\;\text{KBps}.$ For a $5$ second period, all th...
gatecse
126
views
gatecse
asked
Nov 27, 2020
Computer Networks
go2025-mix-4
numerical-answers
medium-access-control
+
–
0
votes
0
answers
58803
TIFR-2013-Maths-D: 33
True/False Question : There exists a bijection between $\mathbb{R}^{2}$and the open interval $\left ( 0,1 \right ).$
True/False Question :There exists a bijection between $\mathbb{R}^{2}$and the open interval $\left ( 0,1 \right ).$
soujanyareddy13
126
views
soujanyareddy13
asked
Aug 30, 2020
TIFR
tifrmaths2013
true-false
+
–
0
votes
0
answers
58804
TIFR-2018-Maths-A: 10
True/False Question : Let $g$ be a continuous function on $\left [ 0,1 \right ]$ such that $g\left ( 1 \right )=0$. Then the sequence of functions $f_{n}\left ( x \right )=x^{n}g\left ( x \right )$ converges uniformly on $\left [ 0,1 \right ]$.
True/False Question :Let $g$ be a continuous function on $\left [ 0,1 \right ]$ such that $g\left ( 1 \right )=0$. Then the sequence of functions $f_{n}\left ( x \right )...
soujanyareddy13
126
views
soujanyareddy13
asked
Aug 29, 2020
TIFR
tifrmaths2018
true-false
+
–
0
votes
0
answers
58805
TIFR-2018-Maths-A: 16
True/False Question : Let $G$ be a finite group with a normal subgroup $H$ such that $G/H$ has order $7$. Then $G\cong H\times G/H$.
True/False Question :Let $G$ be a finite group with a normal subgroup $H$ such that $G/H$ has order $7$. Then $G\cong H\times G/H$.
soujanyareddy13
126
views
soujanyareddy13
asked
Aug 29, 2020
TIFR
tifrmaths2018
true-false
+
–
0
votes
0
answers
58806
TIFR-2020-Maths-B: 16
True/False Question : Let $G$ be an abelian group, with identity element $e$. If $\left \{ g \in G \mid g = e\:or\:g\:has\:infinite\:order \right \}$ is a subgroup of $G$, then either all elements of $G\setminus \left \{ e \right \}$ have infinite order, or all elements of $G$ have infinite order.
True/False Question :Let $G$ be an abelian group, with identity element $e$. If $$\left \{ g \in G \mid g = e\:or\:g\:has\:infinite\:order \right \}$$is a subgroup of $G$...
soujanyareddy13
126
views
soujanyareddy13
asked
Aug 28, 2020
TIFR
tifrmaths2020
true-false
+
–
0
votes
0
answers
58807
Peter Linz Edition 5 Exercise 10.4 Question 8 (Page No. 273)
Suppose that $S_1$ and $S_2$ are countable sets. Show that then $S_1\cup S_2$ and $S_1 \times S_2$ are also countable.
Suppose that $S_1$ and $S_2$ are countable sets. Show that then $S_1\cup S_2$ and $S_1 \times S_2$ are also countable.
Rishi yadav
126
views
Rishi yadav
asked
Apr 2, 2019
Theory of Computation
peter-linz
peter-linz-edition5
theory-of-computation
turing-machine
proof
+
–
0
votes
0
answers
58808
Galvin Edition 9 Exercise 2 Question 16 (Page No. 95)
What are the advantages and disadvantages of using the same system call interface for manipulating both files and devices?
What are the advantages and disadvantages of using the same system call interface for manipulating both files and devices?
akash.dinkar12
126
views
akash.dinkar12
asked
Mar 19, 2019
Operating System
galvin
operating-system
descriptive
+
–
0
votes
0
answers
58809
Conceptual Question
When we want to minimise a DFA,at first we partition the final and non-final states.Then we divide those states into several more partitions until all the states in each partition belong to the same equivalence class.Now my question is suppose we have a ... the dead state)?Also please tell me whether that dead state should be counted as one of the states in the minimised dfa?
When we want to minimise a DFA,at first we partition the final and non-final states.Then we divide those states into several more partitions until all the states in each ...
shgarg
126
views
shgarg
asked
Nov 14, 2018
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
0
answers
58810
Korth
How can serial schedule be subset of concurrent schedule ?? They should act as disjoint set . Plz explain somebody .
How can serial schedule be subset of concurrent schedule ??They should act as disjoint set .Plz explain somebody .
Shubham Agarwal 1
126
views
Shubham Agarwal 1
asked
Oct 29, 2018
0
votes
0
answers
58811
Probability - Gravner-50
Assume that you have an n-element set $U$ and that you select r independent random subsets A1,............Ar $\subset U$. All Ai are chosen so that all 2n choices are equally likely. Compute (in a simple closed form) the probability that the Ai are pairwise disjoint.
Assume that you have an n-element set $U$ and that you select r independent random subsets A1,............Ar $\subset U$. All Ai are chosen so that all 2n choices are equ...
Pooja Khatri
126
views
Pooja Khatri
asked
Sep 24, 2018
Probability
probability
gravner
engineering-mathematics
+
–
0
votes
0
answers
58812
OS self doubt
Is Hybrid thread (OS) in Gate 2019 syllabus ?
Is Hybrid thread (OS) in Gate 2019 syllabus ?
Priyansh Singh
126
views
Priyansh Singh
asked
Sep 14, 2018
0
votes
0
answers
58813
ISI-2014-21
jjayantamahata
126
views
jjayantamahata
asked
Mar 18, 2018
0
votes
0
answers
58814
cmi2017b
Let Σ = {a, b}. Given words u, v ∈ Σ ∗ , we say that v extends u if v is of the form xuy for some x, y ∈ Σ ∗ . Given a fixed word u, we are interested in identifying whether a finite state automaton accepts some word that extends u. Describe an algorithm that takes ... u ∈ Σ ∗ and reports Yes if some word in the language of A extends u and No if no word in the language of A extends u.
Let Σ = {a, b}. Given words u, v ∈ Σ ∗ , we say that v extends u if v is of the form xuy for some x, y ∈ Σ ∗ . Given a fixed word u, we are interested in ident...
Kaluti
126
views
Kaluti
asked
Mar 1, 2018
0
votes
0
answers
58815
Doubt!!
Anyone please tell me How maximum children would be 2B-1 For B=5 it would be maximum of 6 children not 8 children right??
Anyone please tell me How maximum children would be 2B-1For B=5 it would be maximum of 6 children not 8 children right??
utk0203
126
views
utk0203
asked
Oct 29, 2017
0
votes
0
answers
58816
virtual gate
Which of the following is correct? a) Top-down parser complexity is O(n4) b) Bottom-up parser complexity is O(n3) (A) True, False (B) False, True (C) True, True (D) False, False please give explanation..
Which of the following is correct?a) Top-down parser complexity is O(n4)b) Bottom-up parser complexity is O(n3)(A) True, False(B) False, True(C) True, True(D) False, Fals...
ADITYA CHAURASIYA 5
126
views
ADITYA CHAURASIYA 5
asked
Oct 4, 2017
0
votes
0
answers
58817
maths
Please explain question 16
Please explain question 16
nandini gupta
126
views
nandini gupta
asked
Feb 2, 2017
–2
votes
0
answers
58818
is there any better approach to check view seriabilizity ?
Wanted
126
views
Wanted
asked
Dec 26, 2016
1
votes
0
answers
58819
# Doubt-
Q matching 1. Data flow anaylysis A. Code generation 2. register allocation B. Code optimization
Q matching 1. Data flow anaylysis A. Code generation 2. register allocation B. Code optimization
Hradesh patel
126
views
Hradesh patel
asked
Nov 17, 2016
0
votes
0
answers
58820
TIFR CSE 2024 | Part A | Question: 13
Let $n \geq 100$ be a positive integer. Let $X_{1}, X_{2}, \ldots, X_{n}$ be independent random variables, each taking values in the set $\{0,1\}$ such that $\operatorname{Pr}\left[X_{i}=1\right]=\frac{2}{3}$ for each $1 \leq i \leq n$ ... with respect to $x$. $0$ $n$ $\frac{2 n}{3}$ $\frac{4 n^{2}+2 n}{9}$ $\frac{4 n^{2}-4 n}{9}$
Let $n \geq 100$ be a positive integer. Let $X_{1}, X_{2}, \ldots, X_{n}$ be independent random variables, each taking values in the set $\{0,1\}$ such that $\operatornam...
admin
125
views
admin
asked
Jan 12
Others
tifr2024
+
–
Page:
« prev
1
...
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
...
3226
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register