Recent activity by Antaroop / GATE Overflow for GATE CSE

4 answers

1

GATE CSE 2021 Set 2 | Question: 13
In the context of compilers, which of the following is/are $\text{NOT}$ an intermediate representation of the source program? Three address code Abstract Syntax Tree $\text{(AST)}$ Control Flow Graph $\text{(CFG)}$ Symbol table

In the context of compilers, which of the following is/are $\text{NOT}$ an intermediate representation of the source program?Three address codeAbstract Syntax Tree $\text...

6.8k views

commented Feb 21, 2021

1 answer

2

SELF DOUBT OS MADEEASY TEST SERIES
CONSIDER A SYSTEM USING PAGING AND SEGMENTATION .THE VIRTUAL ADDRESS SPACE CONSIST OF UP TO 8 SEGMENTS AND EACH SEGMENT IS 229 BYTE long the hardware pages each segment into 28 B pages Q: HOW MANY BITS IN THE VIRTUAL ADDRESS SPECIFY THE PAGE NUMBER? A)4 bits b)5 bits c)16 bits d)21 bits

CONSIDER A SYSTEM USING PAGING AND SEGMENTATION .THE VIRTUAL ADDRESS SPACE CONSIST OF UP TO 8 SEGMENTS AND EACH SEGMENT IS 229 BYTE longthe hardware p...

2.1k views

answered May 10, 2020

1 answer

3

How many conflict serializable schedules are possible ?
The transactions $T1$ and $T2$ are given as follows: $T1$: $R1(A)$ $W1(A)$ $R1(B)$ $W1(B)$ $T2$ : $R2(B)$ $W2(B)$ $R2(C)$ $W2(C)$ The total number of conflicts serializable that can be formed by $T1$ and $T2$ are Answer :20 (incorrect) The correct answer is 14

The transactions $T1$ and $T2$ are given as follows:$T1$: $R1(A)$ $W1(A)$ $R1(B)$ $W1(B)$$T2$ : $R2(B)$ $W2(B)$ $R2(C)$ $W2(C)$The total number of conflicts serializable ...

3.0k views

answered Jan 26, 2020

0 answers

4

Zeal Test Series 2019: Set Theory & Algebra - Lattice
My doubt is in second hasse diagram for (I,g) lub should be I and j so it is not lattice please correct me if i amwrong

My doubt is in second hasse diagram for (I,g) lub should be I and j so it is not lattice please correct me if i amwrong

698 views

commented Jan 25, 2020

1 answer

5

MadeEasy Subject Test 2019: Compiler Design - Parsing
Consider the following grammar: S-->XX X-->b X-->aX Which of the following can be the viable prefixes? baab aab aaabab bbbaX

Consider the following grammar:S >XXX >bX >aXWhich of the following can be the viable prefixes?baabaabaaababbbbaX

2.4k views

comment edited Jan 20, 2020

1 answer

6

MadeEasy Subject Test 2019: Compiler Design - Parsing
Which of the Statements are True : S1: LR(1) grammar can be LR(0) but not LL(1). S2 : Every regular language is LL(1) S3 : Three address code is linear representation of Syntax Tree.

Which of the Statements are True :S1: LR(1) grammar can be LR(0) but not LL(1).S2 : Every regular language is LL(1)S3 : Three address code is linear representation of Syn...

793 views

commented Jan 20, 2020

3 answers

7

MadeEasy Subject Test 2019: Compiler Design - Parsing

773 views

commented Jan 20, 2020

8 answers

8

#of variables in SSA
Consider the following code segment: c=b+a e=c-a f=c*e h=c+a i=h+f The minimum number of $\color{blue} {total}$ and $\color{blue} {temporary }$ variable required to convert the above code segment to static single assignment form are ________

Consider the following code segment:c=b+ae=c-af=c*eh=c+ai=h+f The minimum number of $\color{blue} {total}$ and $\color{blue} {temporary }$ variable required to convert t...

1.9k views

commented Jan 20, 2020

3 answers

9

ISRO2020-20
The minimum height of an AVL tree with $n$ nodes is $\text{Ceil } (\log_2(n+1))$ $1.44\ \log_2n$ $\text{Floor } (\log_2(n+1))$ $1.64\ \log_2n$

The minimum height of an AVL tree with $n$ nodes is$\text{Ceil } (\log_2(n+1))$$1.44\ \log_2n$$\text{Floor } (\log_2(n+1))$$1.64\ \log_2n$

5.9k views

commented Jan 14, 2020

2 answers

10

MadeEasy Test Series 2018: Digital Logic - Min No Gates

675 views

answered Jan 14, 2020

4 answers

11

GATE CSE 2012 | Question: 22
Which of the following transport layer protocols is used to support electronic mail? $\textsf{SMTP}$ $\textsf{IP}$ $\textsf{TCP}$ $\textsf{UDP}$

Which of the following transport layer protocols is used to support electronic mail?$\textsf{SMTP}$$\textsf{IP}$$\textsf{TCP}$$\textsf{UDP}$

20.3k views

commented Jan 10, 2020

0 answers

12

Inversions
Is it always the case that in an unsorted array using comparison based sorting algorithm the minimum number of comparison required to convert it into sorted array is Equal to number of Inversions present in the Array. Am i saying the statement right ?

Is it always the case that in an unsorted array using comparison based sorting algorithm the minimum number of comparison required to convert it into sorted array is Equa...

908 views

commented Jan 9, 2020

5 answers

13

GATE IT 2004 | Question: 41
Let $M=(K, Σ, \sigma, s, F)$ be a finite state automaton, where $K = \{A, B\}, Σ = \{a, b\}, s = A, F = \{B\},$ $\sigma(A, a) = A, \sigma(A, b) = B, \sigma(B, a) = B \text{ and} \ \sigma(B, b) = A$ A grammar to generate the language accepted by $M$ can be ... $\{A → bB, A → aB, B → aA, B → bA, B → \epsilon)$ $\{A → aA, A → bA, B → aB, B → bA, A → \epsilon)$

Let $M=(K, Σ, \sigma, s, F)$ be a finite state automaton, where$K = \{A, B\}, Σ = \{a, b\}, s = A, F = \{B\},$$\sigma(A, a) = A, \sigma(A, b) = B, \sigma(B, a) = B \tex...

7.0k views

commented Dec 30, 2019

12 answers

14

GATE CSE 2003 | Question: 14
The regular expression $0^*(10^*)^*$ denotes the same set as $(1^*0)^*1^*$ $0+(0+10)^*$ $(0+1)^*10(0+1)^*$ None of the above

The regular expression $0^*(10^*)^*$ denotes the same set as$(1^*0)^*1^*$$0+(0+10)^*$$(0+1)^*10(0+1)^*$None of the above

19.3k views

commented Dec 30, 2019

5 answers

15

GATE CSE 2003 | Question: 53
A single tape Turing Machine $M$ has two states $q0$ and $q1$, of which $q0$ is the starting state. The tape alphabet of $M$ is $\{0, 1, B\}$ and its input alphabet is $\{0, 1\}$. The symbol $B$ is the blank symbol used to indicate end of an input ... halt on any string in $(00+1)^*$ $M$ halts on all strings ending in a $0$ $M$ halts on all strings ending in a $1$

A single tape Turing Machine $M$ has two states $q0$ and $q1$, of which $q0$ is the starting state. The tape alphabet of $M$ is $\{0, 1, B\}$ and its input alphabet is $\...

11.9k views

answered Dec 30, 2019

1 answer

16

MadeEasy Subject Test 2019: Algorithms - Time Complexity
O($n^2$) O(n) O(nlogn) O($n(logn)^2$

O($n^2$)O(n)O(nlogn)O($n(logn)^2$

1.2k views

commented Dec 21, 2019

16 answers

17

GATE CSE 2014 Set 1 | Question: 39
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________

The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________

54.1k views

commented Nov 30, 2019

8 answers

18

GATE CSE 2004 | Question: 79
How many graphs on $n$ labeled vertices exist which have at least $\frac{(n^2 - 3n)}{ 2}$ edges ? $^{\left(\frac{n^2-n}{2}\right)}C_{\left(\frac{n^2-3n} {2}\right)}$ $^{{\large\sum\limits_{k=0}^{\left (\frac{n^2-3n}{2} \right )}}.\left(n^2-n\right)}C_k$ $^{\left(\frac{n^2-n}{2}\right)}C_n$ $^{{\large\sum\limits_{k=0}^n}.\left(\frac{n^2-n}{2}\right)}C_k$

How many graphs on $n$ labeled vertices exist which have at least $\frac{(n^2 - 3n)}{ 2}$ edges ?$^{\left(\frac{n^2-n}{2}\right)}C_{\left(\frac{n^2-3n} {2}\right)}$$^{{\l...

14.5k views

commented Oct 24, 2019

7 answers

19

GATE CSE 2014 Set 1 | Question: 34
A canonical set of items is given below $S \to L .> R $ $Q \to R.$ On input symbol $<$ the set has a shift-reduce conflict and a reduce-reduce conflict. a shift-reduce conflict but not a reduce-reduce conflict. a reduce-reduce conflict but not a shift-reduce conflict. neither a shift-reduce nor a reduce-reduce conflict.

A canonical set of items is given below$S \to L . R $$Q \to R.$On input symbol $<$ the set hasa shift-reduce conflict and a reduce-reduce conflict.a shift-reduce conflict...

25.4k views

commented Dec 19, 2018

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