Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
No answer
No selected answer
No upvoted answer
Previous GATE
Featured
Recent questions without answers
0
votes
0
answers
3811
ISI2016-DCG-59
If in a $\triangle ABC,\angle B=\dfrac{2\pi}{3},$ then $\cos A+\cos C$ lies in $\left[\:-\sqrt{3},\sqrt{3}\:\right]$ $\left(\:-\sqrt{3},\sqrt{3}\:\right]$ $\left(\:\frac{3}{2},\sqrt{3}\:\right)$ $\left(\:\frac{3}{2},\sqrt{3}\:\right]$
If in a $\triangle ABC,\angle B=\dfrac{2\pi}{3},$ then $\cos A+\cos C$ lies in$\left[\:-\sqrt{3},\sqrt{3}\:\right]$$\left(\:-\sqrt{3},\sqrt{3}\:\right]$$\left(\:\frac{3}{...
gatecse
347
views
gatecse
asked
Sep 18, 2019
Geometry
isi2016-dcg
geometry
triangles
trigonometry
non-gate
+
–
0
votes
0
answers
3812
ISI2016-DCG-60
Which of the following relations is true for the following figure? $b^{2}=c(c+a)$ $c^{2}=a(a+b)$ $a^{2}=b(b+c)$ All of these
Which of the following relations is true for the following figure?$b^{2}=c(c+a)$$c^{2}=a(a+b)$$a^{2}=b(b+c)$All of these
gatecse
381
views
gatecse
asked
Sep 18, 2019
Geometry
isi2016-dcg
triangles
non-gate
+
–
0
votes
0
answers
3813
ISI2016-DCG-62
The number of values of $x$ for which the equation $\cos x=\sqrt{\sin x}-\frac{1}{\sqrt{\sin x}}$ is satisfied is $1$ $2$ $3$ more than $3$
The number of values of $x$ for which the equation $\cos x=\sqrt{\sin x}-\frac{1}{\sqrt{\sin x}}$ is satisfied is $1$$2$$3$more than $3$
gatecse
189
views
gatecse
asked
Sep 18, 2019
Geometry
isi2016-dcg
trigonometry
non-gate
+
–
0
votes
0
answers
3814
ISI2017-DCG-24
The differential equation $x \frac{dy}{dx} -y=x^3$ with $y(0)=2$ has unique solution no solution infinite number of solutions none of these
The differential equation $x \frac{dy}{dx} -y=x^3$ with $y(0)=2$ hasunique solutionno solutioninfinite number of solutionsnone of these
gatecse
321
views
gatecse
asked
Sep 18, 2019
Others
isi2017-dcg
engineering-mathematics
calculus
non-gate
differential-equation
+
–
0
votes
0
answers
3815
ISI2017-DCG-27
The limit of the sequence $\sqrt{2}, \sqrt{2\sqrt{2}}, \sqrt{2\sqrt{2\sqrt{2}}}, \dots$ is $1$ $2$ $2\sqrt{2}$ $\infty$
The limit of the sequence $\sqrt{2}, \sqrt{2\sqrt{2}}, \sqrt{2\sqrt{2\sqrt{2}}}, \dots$ is$1$$2$$2\sqrt{2}$$\infty$
gatecse
353
views
gatecse
asked
Sep 18, 2019
Calculus
isi2017-dcg
calculus
limits
+
–
1
votes
0
answers
3816
ISI2018-DCG-11
The sum of $99^{th}$ power of all the roots of $x^7-1=0$ is equal to $1$ $2$ $-1$ $0$
The sum of $99^{th}$ power of all the roots of $x^7-1=0$ is equal to$1$$2$$-1$$0$
gatecse
407
views
gatecse
asked
Sep 18, 2019
Quantitative Aptitude
isi2018-dcg
quantitative-aptitude
polynomials
roots
+
–
0
votes
0
answers
3817
ISI2018-DCG-21
A box with a square base of length $x$ and height $y$ has an open top and its volume is $32$ cubic centimetres, as shown in the figure below. The values of $x$ and $y$ that minimize the surface area of the box are $x=4$ cm $\&$ $y=2 $ cm $x=3$ cm $\&$ $y=\frac{32}{9} $ cm $x=2$ cm $\&$ $y=8 $ cm none of these.
A box with a square base of length $x$ and height $y$ has an open top and its volume is $32$ cubic centimetres, as shown in the figure below. The values of $x$ and $y$ th...
gatecse
252
views
gatecse
asked
Sep 18, 2019
Geometry
isi2018-dcg
cubes
non-gate
+
–
0
votes
0
answers
3818
ISI2018-DCG-29
Let $f(x)=(x-1)(x-2)(x-3)g(x); \: x\in \mathbb{R}$ where $g$ is twice differentiable function. Then there exists $y\in(1,3)$ such that $f’’(y)=0.$ there exists $y\in(1,2)$ such that $f’’(y)=0.$ there exists $y\in(2,3)$ such that $f’’(y)=0.$ none of the above is true.
Let $f(x)=(x-1)(x-2)(x-3)g(x); \: x\in \mathbb{R}$ where $g$ is twice differentiable function. Thenthere exists $y\in(1,3)$ such that $f’’(y)=0.$there exists $y\in(1,...
gatecse
350
views
gatecse
asked
Sep 18, 2019
Calculus
isi2018-dcg
calculus
differentiation
+
–
1
votes
0
answers
3819
Ullman (Compiler Design) Edition 2 Exercise 6.5 Question 2 (Page No. 399)
As in Ada, suppose that each expression must have a unique type, but that from a subexpression, by itself, all we can deduce is a set of possible types. That is, the application of function ... of the overall expression is determined, proceeds top-down to determine attribute $unique$ for the type of each subexpression.
As in Ada, suppose that each expression must have a unique type, but that from a subexpression, by itself, all we can deduce is a set of possible types. That is, the app...
admin
1.0k
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
intermediate-code
three-address-code
descriptive
+
–
0
votes
0
answers
3820
Ullman (Compiler Design) Edition 2 Exercise 6.5 Question 1 (Page No. 398)
Assuming that function $widen$ in Fig. $6.26$ can handle any of the types in the hierarchy of Fig. $6.25(a)$, translate the expressions below. Assume that c and d are characters, $s$ and $t$ are short integers, $i$ and $j$ are integers, and $x$ is a float. $x=s+c$ $i=s+c$ $x=(s+c)\ast(t+d)$
Assuming that function $widen$ in Fig. $6.26$ can handle any of the types in the hierarchy of Fig. $6.25(a)$, translate the expressions below. Assume that c and d are cha...
admin
691
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
intermediate-code
three-address-code
descriptive
+
–
0
votes
0
answers
3821
Ullman (Compiler Design) Edition 2 Exercise 6.4 Question 9 (Page No. 386)
$A$ real array $A[i, j, k]$ has index $i$ ranging from $1$ to $4$, index $j$ ranging from $0$ to $4$, and index $k$ ranging from $5$ to $10$. Reals take $8$ bytes each. Suppose array $A$ is stored starting at byte $0$. Find the location of: $A[3,4,5]$ $A[1,2,7]$ $A[4,3,9]$ if $A$ is stored in column-major order.
$A$ real array $A[i, j, k]$ has index $i$ ranging from $1$ to $4$, index $j$ ranging from $0$ to $4$, and index $k$ ranging from $5$ to $10$. Reals take $8$ bytes each. ...
admin
534
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
intermediate-code
three-address-code
descriptive
+
–
0
votes
0
answers
3822
Ullman (Compiler Design) Edition 2 Exercise 6.4 Question 7 (Page No. 386)
An integer array $A[i, j]$ has index $i$ ranging from $1$ to $10$ and index $j$ ranging from $1$ to $20$. Integers take $4$ bytes each. Suppose array $A$ is stored starting at byte $0$. Find the location of: $A[4,5]$ $A[10,8]$ $A[3,17]$ if A is stored in column-major order.
An integer array $A[i, j]$ has index $i$ ranging from $1$ to $10$ and index $j$ ranging from $1$ to $20$. Integers take $4$ bytes each. Suppose array $A$ is stored starti...
admin
903
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
intermediate-code
three-address-code
descriptive
+
–
0
votes
0
answers
3823
Ullman (Compiler Design) Edition 2 Exercise 6.4 Question 5 (Page No. 385 - 386)
Generalize formula $(6.7)$ to multidimensional arrays, and indicate what values can be stored in the symbol table and used to compute offsets. Consider the following cases: An array $A$ of two dimensions, in row-major form. The first ... $h_{j}$.The same as $(c)$ but with the array stored in column-major form.
Generalize formula $(6.7)$ to multidimensional arrays, and indicate what values can be stored in the symbol table and used to compute offsets. Consider the following case...
admin
351
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
intermediate-code
three-address-code
descriptive
+
–
0
votes
0
answers
3824
Ullman (Compiler Design) Edition 2 Exercise 6.4 Question 4 (Page No. 385)
Revise the translation of Fig. $6.22$ for array references of the Fortran style, that is, $id[E_{1}, E_{2},\cdot\cdot\cdot,E_{n}]$ for an $n-$dimensional array.
Revise the translation of Fig. $6.22$ for array references of the Fortran style, that is, $id[E_{1}, E_{2},\cdot\cdot\cdot,E_{n}]$ for an $n-$dimensional array.
admin
378
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
intermediate-code
three-address-code
descriptive
+
–
0
votes
0
answers
3825
Ullman (Compiler Design) Edition 2 Exercise 6.4 Question 3 (Page No. 385)
Use the translation of Fig. $6.22$ to translate the following assignments: $x=a[i]+b[j]$ $x=a[i][j]+b[i][j]$ $x=a[b[i][j]][c[[k]]$
Use the translation of Fig. $6.22$ to translate the following assignments: $x=a[i]+b[j]$$x=a[i][j]+b[i][j]$$x=a[b[i][j]][c[[k]]$
admin
696
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
intermediate-code
three-address-code
descriptive
+
–
0
votes
0
answers
3826
Ullman (Compiler Design) Edition 2 Exercise 6.4 Question 2 (Page No. 384)
Add to the translation of Fig. $6.19$ rules for the following productions: $E\rightarrow E_{1}\ast E_{2}$ $E\rightarrow + E_{1}\:$(unary plus)
Add to the translation of Fig. $6.19$ rules for the following productions:$E\rightarrow E_{1}\ast E_{2}$$E\rightarrow + E_{1}\:$(unary plus)
admin
439
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
intermediate-code
three-address-code
descriptive
+
–
0
votes
0
answers
3827
Ullman (Compiler Design) Edition 2 Exercise 6.4 Question 1 (Page No. 384)
Add to the translation of Fig. $6.19$ rules for the following productions: $E\rightarrow E_{1}\ast E_{2}$ $E\rightarrow + E_{1}\:$(unary plus)
Add to the translation of Fig. $6.19$ rules for the following productions:$E\rightarrow E_{1}\ast E_{2}$$E\rightarrow + E_{1}\:$(unary plus)
admin
587
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
intermediate-code
three-address-code
descriptive
+
–
0
votes
0
answers
3828
Ullman (Compiler Design) Edition 2 Exercise 6.3 Question 2 (Page No. 378)
Extend the handling of field names in Fig. $6.18$ to classes and single-inheritance class hierarchies. Give an implementation of class $Enu$ that allows linked symbol tables, so that a subclass can ... inherited fields. Inherited fields must maintain the relative addresses they were assigned in the layout for the superclass.
Extend the handling of field names in Fig. $6.18$ to classes and single-inheritance class hierarchies. Give an implementation of class $Enu$ that allows linked symbol tab...
admin
481
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
three-address-code
intermediate-code
descriptive
+
–
0
votes
0
answers
3829
Ullman (Compiler Design) Edition 2 Exercise 6.3 Question 1 (Page No. 378)
Determine the types and relative addresses for the identifiers in the following sequence of declarations: float x; record { float x; float y; } p; record { int tag; float x; float y; } q;
Determine the types and relative addresses for the identifiers in the following sequence of declarations:float x; record { float x; float y; } p; record { int tag; float ...
admin
1.2k
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
three-address-code
intermediate-code
descriptive
+
–
0
votes
0
answers
3830
Ullman (Compiler Design) Edition 2 Exercise 5.4 Question 7 (Page No. 337)
Modify the SDD of Fig. $5.25$ to include superscripts denoted by operator sup between boxes. If box $B_{2}$ is a superscript of box $B_{1}$, then position the baseline of $B_{2}\:0.6$ times the point size of $B_{1}$ above the baseline of $B_{1}.\text{Add}$ the new production and rules to the SDT of Fig. $5.26$.
Modify the SDD of Fig. $5.25$ to include superscripts denoted by operator sup between boxes. If box $B_{2}$ is a superscript of box $B_{1}$, then position the baseline of...
admin
605
views
admin
asked
Sep 6, 2019
Compiler Design
ullman
compiler-design
syntax-directed-translation
grammar
descriptive
+
–
0
votes
0
answers
3831
Ullman (Compiler Design) Edition 2 Exercise 5.4 Question 6 (Page No. 337)
Modify the SDD of Fig. $5.25$ to include a synthesized attribute $B.le$, the length of a box. The length of the concatenation of two boxes is the sum of the lengths of each. Then add your new rules to the proper positions in the SDT of Fig. $5.26$.
Modify the SDD of Fig. $5.25$ to include a synthesized attribute $B.le$, the length of a box. The length of the concatenation of two boxes is the sum of the lengths of ea...
admin
635
views
admin
asked
Sep 6, 2019
Compiler Design
ullman
compiler-design
syntax-directed-translation
grammar
descriptive
+
–
0
votes
0
answers
3832
Ullman (Compiler Design) Edition 2 Exercise 5.4 Question 5 (Page No. 337)
Write L-attributed SDT's analogous to that of Example $5.19$ for the following productions, each of which represents a familiar flow-of-control construct, as in the programming language C. You may need to ... middle to the next statement, so it is not sufficient simply to generate code for each statement in order.
Write L-attributed SDT's analogous to that of Example $5.19$ for the following productions, each of which represents a familiar flow-of-control construct, as in the progr...
admin
482
views
admin
asked
Sep 6, 2019
Compiler Design
ullman
compiler-design
syntax-directed-translation
grammar
descriptive
+
–
0
votes
0
answers
3833
Ullman (Compiler Design) Edition 2 Exercise 5.4 Question 4 (Page No. 337)
Write L-attributed SDD's analogous to that of Example $5.19$ for the following productions, each of which represents a familiar flow-of-control construct, as in the programming language C. You may need to ... middle to the next statement, so it is not sufficient simply to generate code for each statement in order.
Write L-attributed SDD's analogous to that of Example $5.19$ for the following productions, each of which represents a familiar flow-of-control construct, as in the progr...
admin
450
views
admin
asked
Sep 6, 2019
Compiler Design
ullman
compiler-design
syntax-directed-translation
grammar
descriptive
+
–
0
votes
0
answers
3834
Ullman (Compiler Design) Edition 2 Exercise 5.4 Question 1 (Page No. 336)
We mentioned in Section $5.4.2$ that it is possible to deduce, from the LR state on the parsing stack, what grammar symbol is represented by the state. How would we discover this information?
We mentioned in Section $5.4.2$ that it is possible to deduce, from the LR state on the parsing stack, what grammar symbol is represented by the state. How would we disco...
admin
510
views
admin
asked
Sep 6, 2019
Compiler Design
ullman
compiler-design
syntax-directed-translation
grammar
descriptive
+
–
0
votes
0
answers
3835
Ullman (Compiler Design) Edition 2 Exercise 5.3 Question 3 (Page No. 323)
Give an SDD to differentiate expressions such as $x\ast(3\ast x + x\ast x)$ involving the operators $+$ and $\ast,$ the variable $x$, and constants. Assume that no simplification occurs, so that, for example, $3\ast x$ will be translated into $3\ast 1+0\ast x$.
Give an SDD to differentiate expressions such as $x\ast(3\ast x + x\ast x)$ involving the operators $+$ and $\ast,$ the variable $x$, and constants. Assume that no simpli...
admin
487
views
admin
asked
Sep 6, 2019
Compiler Design
ullman
compiler-design
syntax-directed-translation
+
–
0
votes
0
answers
3836
Ullman (Compiler Design) Edition 2 Exercise 5.3 Question 2 (Page No. 323)
Give an SDD to translate infix expressions with $+$ and $\ast$ into equivalent expressions without redundant parentheses. For example, since both operators associate from the left, and $\ast$ takes precedence over $+, ((a\ast(b+c))\ast(d))$ translates into $a\ast(b + c)\ast d$.
Give an SDD to translate infix expressions with $+$ and $\ast$ into equivalent expressions without redundant parentheses. For example, since both operators associate from...
admin
756
views
admin
asked
Sep 6, 2019
Compiler Design
ullman
compiler-design
syntax-directed-translation
infix-expressions
+
–
0
votes
0
answers
3837
Ullman (Compiler Design) Edition 2 Exercise 5.3 Question 1 (Page No. 323)
Below is a grammar for expressions involving operator $+$ and integer or floating-point operands. Floating-point numbers are distinguished by having a decimal point. $E\rightarrow E+T\mid T$ ... translate expressions into postfix notation.Use the unary operator intToFloat to turn an integer into an equivalent float.
Below is a grammar for expressions involving operator $+$ and integer or floating-point operands. Floating-point numbers are distinguished by having a decimal point.$E\ri...
admin
1.4k
views
admin
asked
Sep 6, 2019
Compiler Design
ullman
compiler-design
syntax-directed-translation
grammar
postfix-notation
+
–
0
votes
0
answers
3838
Ullman (Compiler Design) Edition 2 Exercise 5.2 Question 6 (Page No. 317)
Implement Algorithm $3.23$, which converts a regular expression into a nondeterministic finite automaton, by an L-attributed SDD on a top-down parsable grammar. Assume that there is a token char representing any ... never before returned by this function. Use any convenient notation to specify the transitions of the $NFA$.
Implement Algorithm $3.23$, which converts a regular expression into a nondeterministic finite automaton, by an L-attributed SDD on a top-down parsable grammar. Assume th...
admin
838
views
admin
asked
Sep 6, 2019
Compiler Design
ullman
compiler-design
syntax-directed-translation
regular-expression
finite-automata
parsing
+
–
0
votes
0
answers
3839
Ullman (Compiler Design) Edition 2 Exercise 5.2 Question 4 (Page No. 317)
This grammar generates binary numbers with a "decimal" point: $S\rightarrow L.L\mid L$ $L\rightarrow LB\mid B$ $B\rightarrow 0\mid 1$ Design an L-attributed SDD to compute $S.val$, the decimal-number value of ... $L.side$ that tells which side of the decimal point a bit is on.
This grammar generates binary numbers with a "decimal" point:$S\rightarrow L.L\mid L$$L\rightarrow LB\mid B$$B\rightarrow 0\mid 1$ Design an L-attributed SDD to compute $...
admin
1.6k
views
admin
asked
Sep 6, 2019
Compiler Design
ullman
compiler-design
syntax-directed-translation
grammar
parsing
+
–
0
votes
0
answers
3840
Ullman (Compiler Design) Edition 2 Exercise 5.2 Question 2 (Page No. 317)
For the SDD of Fig. $5.8$, give annotated parse trees for the following expressions: int a,b,c. float w,x,y,z.
For the SDD of Fig. $5.8$, give annotated parse trees for the following expressions:int a,b,c.float w,x,y,z.
admin
1.8k
views
admin
asked
Sep 6, 2019
Compiler Design
ullman
compiler-design
syntax-directed-translation
parsing
+
–
Page:
« prev
1
...
123
124
125
126
127
128
129
130
131
132
133
...
593
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register