The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by smsubham
User smsubham
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User smsubham
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
answers
1
ISRO202030
Consider the following page reference string. $1\ 2\ 3\ 4\ 2\ 1\ 5\ 6\ 2\ 1\ 2\ 3\ 7\ 6\ 3\ 2\ 1\ 2\ 3\ 6\ $ What are the minimum number of frames required to get a single page fault for the above sequence assuming LRU replacement strategy? $7$ $4$ $6$ $5$
commented
3 days
ago
in
Operating System

131
views
isro2020
operatingsystem
memorymanagement
pagereplacement
pagefault
normal
2
answers
2
ISRO202038
Which of the following is true? Every subset of a regular set is regular Every finite subset of nonregular set is regular The union of two non regular set is not regular Infinite union of finite set is regular
answered
3 days
ago
in
Theory of Computation

88
views
isro2020
theoryofcomputation
regularlanguages
easy
4
answers
3
GATE2006IT47
Consider the depthfirstsearch of an undirected graph with $3$ vertices $P$, $Q$, and $R$. Let discovery time $d(u)$ represent the time instant when the vertex $u$ is first visited, and finish time $f(u)$ represent the time instant when the vertex ... There are two connected components, and $Q$ and $R$ are connected There are two connected components, and $P$ and $Q$ are connected
comment edited
Jan 8
in
Algorithms

2.7k
views
gate2006it
algorithms
graphalgorithms
normal
6
answers
4
GATE2014143
Consider a $6$stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycletime overhead of pipelining. When an application is executing on this $6$stage pipeline, the speedup achieved with respect to nonpipelined execution if $25$% of the instructions incur $2$ pipeline stall cycles is ____________
commented
Jan 7
in
CO and Architecture

6.1k
views
gate20141
coandarchitecture
pipelining
numericalanswers
normal
0
answers
5
lattice
In (D110 ,R) lattice where aRb if a is divisor of b, the complement for 22 is ?
commented
Dec 28, 2019
in
Set Theory & Algebra

125
views
lattice
settheory&algebra
discretemathematics
0
answers
6
Kenneth Rosen Edition 6th Exercise 7.6 Question 54 (Page No. 525)
Determine whether each of these posets is wellordered. (Q ∩[0, 1], ≤) (the set of rational numbers between 0 and 1 inclusive) The answer is not well ordered because as it doesn't have any unique least element as 0 can ... /23,0/234). All are representing zero but there is no unique among them. Is this the reason here? Please confirm
commented
Dec 28, 2019
in
Set Theory & Algebra

43
views
kennethrosen
discretemathematics
lattice
relations
0
answers
7
Lattice
Ans. C
commented
Dec 28, 2019
in
Mathematical Logic

128
views
lattice
discretemathematics
0
answers
8
Boolean Algebra Lattice Discrete Mathematics
Boolean algebra is a bounded distributed complemented lattice, also lattice is a poset thus it satisfies reflexive , antisymmetric and transitive properties. Does Boolean Algebra satisfy commutative law?
commented
Dec 28, 2019
in
Mathematical Logic

148
views
booleanalgebra
discretemathematics
lattice
0
answers
9
Dual of a lattice
What is dual of a lattice? Also give an example
commented
Dec 28, 2019
in
Set Theory & Algebra

116
views
discretemathematics
lattice
0
answers
10
Bounded lattice
Can a countable infinite lattice be bounded?
commented
Dec 28, 2019
in
Set Theory & Algebra

68
views
lattice
0
answers
11
GATE19882iv
Give one property of the field of real numbers which no longer holds when we compute using finiteprecision floating point numbers.
commented
Dec 28, 2019
in
Set Theory & Algebra

116
views
gate1988
descriptive
settheory&algebra
fields
nongate
0
answers
12
Michael Sipser Edition 3 Exercise 4 Question 8 (Page No. 211)
Let $T = \{(i, j, k)\mid i, j, k \in N \}$. Show that $T$ is countable.
commented
Dec 28, 2019
in
Theory of Computation

7
views
michaelsipser
theoryofcomputation
turingmachine
countableuncountableset
proof
3
answers
13
doubt
How to check any set is countable or not
commented
Dec 28, 2019
in
Theory of Computation

55
views
countableuncountableset
5
answers
14
GATE201827
Let $N$ be the set of natural numbers. Consider the following sets, $P:$ Set of Rational numbers (positive and negative) $Q:$ Set of functions from $\{0,1\}$ to $N$ $R:$ Set of functions from $N$ to $\{0, 1\}$ $S:$ Set of finite subsets of $N$ Which of the above sets are countable? $Q$ and $S$ only $P$ and $S$ only $P$ and $R$ only $P, Q$ and $S$ only
commented
Dec 28, 2019
in
Set Theory & Algebra

5.4k
views
gate2018
settheory&algebra
countableuncountableset
normal
0
answers
15
MadeEasy Test Series 2018: Theory Of Computation  Countable Set
comment edited
Dec 28, 2019
in
Theory of Computation

75
views
madeeasytestseries
theoryofcomputation
countableuncountableset
1
answer
16
Countable and recursive language relation
Is every countable language recursive enumerable?
answered
Dec 28, 2019
in
Theory of Computation

78
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
countableuncountableset
7
answers
17
GATE200473
The inclusion of which of the following sets into $S = \left\{ \left\{1, 2\right\}, \left\{1, 2, 3\right\}, \left\{1, 3, 5\right\}, \left\{1, 2, 4\right\}, \left\{1, 2, 3, 4, 5\right\} \right\} $ is necessary and sufficient to make $S$ a complete lattice under the partial order defined by set containment ... $\{1\}, \{1, 3\}$ $\{1\}, \{1, 3\}, \{1, 2, 3, 4\}, \{1, 2, 3, 5\}$
commented
Dec 28, 2019
in
Set Theory & Algebra

3.1k
views
gate2004
settheory&algebra
partialorder
normal
2
answers
18
GATE19952.8
If the cube roots of unity are $1, \omega$ and $\omega^2$, then the roots of the following equation are $(x1)^3 +8 =0$ $1, 1 + 2\omega, 1 + 2\omega^2$ $1, 1  2\omega, 1  2\omega^2$ $1, 1  2\omega, 1  2\omega^2$ $1, 1 + 2\omega, 1 + 2\omega^2$
commented
Dec 27, 2019
in
Set Theory & Algebra

784
views
gate1995
settheory&algebra
normal
polynomials
3
answers
19
GATE19974.4
A polynomial $p(x)$ is such that $p(0) = 5, p(1) = 4, p(2) = 9$ and $p(3) = 20$. The minimum degree it should have is $1$ $2$ $3$ $4$
commented
Dec 27, 2019
in
Set Theory & Algebra

2.1k
views
gate1997
settheory&algebra
normal
polynomials
4
answers
20
GATE20002.4
A polynomial $p(x)$ satisfies the following: $p(1) = p(3) = p(5) = 1$ $p(2) = p(4) = 1$ The minimum degree of such a polynomial is $1$ $2$ $3$ $4$
commented
Dec 27, 2019
in
Set Theory & Algebra

2.3k
views
gate2000
settheory&algebra
normal
polynomials
4
answers
21
TIFR2010A18
Let $X$ be a set of size $n$. How many pairs of sets (A, B) are there that satisfy the condition $A\subseteq B \subseteq X$ ? $2^{n+1}$ $2^{2n}$ $3^{n}$ $2^{n} + 1$ $3^{n + 1}$
commented
Dec 27, 2019
in
Set Theory & Algebra

911
views
tifr2010
sets
5
answers
22
GATE2014250
Consider the following relation on subsets of the set $S$ of integers between 1 and 2014. For two distinct subsets $U$ and $V$ of $S$ we say $U\:<\:V$ if the minimum element in the symmetric difference of the two sets is in $U$. Consider the following two statements: $S1$ ... $S2$ are true $S1$ is true and $S2$ is false $S2$ is true and $S1$ is false Neither $S1$ nor $S2$ is true
commented
Dec 27, 2019
in
Set Theory & Algebra

4.8k
views
gate20142
settheory&algebra
normal
sets
5
answers
23
GATE20002.6
Let $P(S)$ denotes the power set of set $S.$ Which of the following is always true? $P(P(S)) = P(S)$ $P(S) ∩ P(P(S)) = \{ Ø \}$ $P(S) ∩ S = P(S)$ $S ∉ P(S)$
commented
Dec 27, 2019
in
Set Theory & Algebra

4.2k
views
gate2000
settheory&algebra
easy
sets
1
answer
24
Set theory
What will be Cardinality of Cartesian product of a non empty set with a set containing element phi? A={1,2,3} and B={Phi} Than A*B will be 0.
commented
Dec 26, 2019
in
Mathematical Logic

49
views
discretemathematics
settheory&algebra
sets
2
answers
25
ISI2016MMA13
Which one of the following statements is correct regarding the elements and subsets of the set $\{1, 2, \{1, 2, 3\}\}$? $\{1, 2\} \in \{1, 2, \{1, 2, 3\} \}$ $\{1, 2\} \subseteq \{1, 2, \{1, 2, 3\} \}$ $\{1, 2, 3\} \subseteq \{1, 2, \{1, 2, 3\} \}$ $3 \in \{1, 2, \{1, 2, 3\} \}$
answered
Dec 26, 2019
in
Set Theory & Algebra

23
views
isi2016mmamma
sets
subsets
1
answer
26
Set Theory
A relation R on a set of positive integers is defined by (a,b) belongs to R iff a and b are relatively prime. Which of the following is true about R? a. Symmetric and Reflexive b. Symmetric and irreflexive c.Symmetric and transitive d. Symmetric and not transitive The Ans is given as (d) but I think (b) is true. Any thoughts?
commented
Dec 26, 2019
in
Set Theory & Algebra

93
views
discretemathematics
settheory&algebra
sets
engineeringmathematics
1
answer
27
#relation
The Number of Relations, Which are both Reflexive and Symmetric but not AntiSymmetric, on a set with 6 elements, are ____________?
commented
Dec 26, 2019
in
Set Theory & Algebra

156
views
sets
2
answers
28
Michael Sipser Edition 3 Exercise 0 Question 5 (Page No. 26)
If C is a set with c elements, how many elements are in the power set of C? Explain your answer.
answered
Dec 26, 2019
in
Theory of Computation

40
views
michaelsipser
theoryofcomputation
sets
easy
3
answers
29
GATE199711
Consider the grammar $S \rightarrow bSe$ $S \rightarrow PQR$ $P \rightarrow bPc$ $P \rightarrow \varepsilon$ $Q \rightarrow cQd$ $Q \rightarrow \varepsilon$ $R \rightarrow dRe$ $R \rightarrow \varepsilon$ where $S, P, Q, R$ are nonterminal symbols with $S$ being the ... $i, j, k, m$? Find the smallest string that has two parse trees.
answered
Dec 25, 2019
in
Compiler Design

1.2k
views
gate1997
compilerdesign
grammar
normal
theoryofcomputation
3
answers
30
GATE19959
Translate the arithmetic expression $a^*(b+c)$ into syntax tree. A grammar is said to have cycles if it is the case that $A \Rightarrow^+ A$ Show that no grammar that has cycles can be LL(1).
comment edited
Dec 25, 2019
in
Compiler Design

1.6k
views
gate1995
compilerdesign
grammar
normal
2
answers
31
GATE199110a
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) Is the grammar unambiguous? Is so, what is the relative precedence between $$ and $/$? If not, give an unambiguous grammar that gives $/$ precedence over $$.
commented
Dec 25, 2019
in
Compiler Design

1.3k
views
gate1991
grammar
compilerdesign
normal
descriptive
2
answers
32
GATE201014
Which languages necessarily need heap allocation in the runtime environment? Those that support recursion. Those that use dynamic scoping. Those that allow dynamic data structure. Those that use global variables.
commented
Dec 25, 2019
in
Compiler Design

2.3k
views
gate2010
compilerdesign
easy
runtimeenvironments
1
answer
33
Doubt in access link and control link in activation record?
Can anybody explain me access link and control link in activation record?I am confused what is different between them IF POSSIBLE GIVE EXAMPLE ALSO THANKS A LOT
answered
Dec 25, 2019
in
Compiler Design

997
views
compilerdesign
runtimeenvironments
3
answers
34
MadeEasy Test Series 2018: Compiler Design  Runtime Environments
Match the following with respect to activation record fields: A 1 → A, D; 2 → B, C B 1 → A, C; 2 → B, D C 1 → B, C; 2 → A, D D 1 → B, D; 2 → A, C Doubt: Control link points to caller activation record.Can some one confirm?
answered
Dec 25, 2019
in
Compiler Design

188
views
compilerdesign
runtimeenvironments
madeeasytestseries
3
answers
35
Compiler Design Activation Record
As actual parameters are stored in the Actual parameter field in case of Activation record then where does formal parameters will be stored? f(a,b) { a(e,f) } Here e,f are actual parameters that will be stored in actual parameter field,but where does formal parameters a,b will be stored for f activation record?
answered
Dec 25, 2019
in
Compiler Design

304
views
compilerdesign
runtimeenvironments
activationrecords
3
answers
36
GATE2014318
Which of the following statements are CORRECT? Static allocation of all data areas by a compiler makes it impossible to implement recursion. Automatic garbage collection is essential to implement recursion. Dynamic allocation of activation records is essential to implement recursion. Both heap and stack are ... $1$ and $2$ only $2$ and $3$ only $3$ and $4$ only $1$ and $3$ only
commented
Dec 25, 2019
in
Compiler Design

3.3k
views
gate20143
compilerdesign
runtimeenvironments
normal
3
answers
37
[Test Series] Counting Number of tokens
I am getting 40 as answer,but correct answer given was 41. I have counted >>= as one token but ,in solution it was counted two.
commented
Dec 25, 2019
in
Compiler Design

2.2k
views
compilerdesign
tokens
lexeme
1
answer
38
MadeEasy Subject Test: Compiler Design  Lexical Analysis
in c programming which of the following is not used as a token seprator during lexical analysis? a)white space b)comment c)semicolon d)none of these token seprator means??
commented
Dec 24, 2019
in
Compiler Design

119
views
madeeasytestseries
compilerdesign
lexicalanalysis
2
answers
39
GATE19951.11
What are $x$ and $y$ in the following macro definition? macro Add x, y Load y Mul x Store y end macro Variables Identifiers Actual parameters Formal parameters
commented
Dec 24, 2019
in
Compiler Design

1.2k
views
gate1995
compilerdesign
macros
easy
2
answers
40
GATE20022.19
To evaluate an expression without any embedded function calls One stack is enough Two stacks are needed As many stacks as the height of the expression tree are needed A Turing machine is needed in the general case
commented
Dec 24, 2019
in
Compiler Design

2.3k
views
gate2002
compilerdesign
expressionevaluation
easy
50,741
questions
57,234
answers
197,994
comments
104,580
users