Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by rahuldb
0
votes
3
answers
1
LR(0) Parsing Table
Please anyone create a $LR(0)$ Parsing table on this grammar and show the working of each step: $S' \rightarrow S$ $S \rightarrow S$;$A \mid A$ $A \rightarrow E \mid id := E$ $E \rightarrow E+id \mid id$ Non-Terminals: $S'$ $S$ $A$ $E$ Terminals$: ; := + id$ Please take a screenshot of copy and show in the answer the whole working.
Please anyone create a $LR(0)$ Parsing table on this grammar and show the working of each step:$S' \rightarrow S$$S \rightarrow S$;$A \mid A$$A \rightarrow E \mid id := ...
3.4k
views
asked
Mar 17, 2018
Compiler Design
compiler-design
lr-parser
parsing
grammar
+
–
3
votes
2
answers
2
Quick sort algorithm selects (n/5)th element as the smallest element
Please show the working
Please show the working
2.6k
views
asked
May 10, 2017
Algorithms
algorithms
sorting
time-complexity
test-series
+
–
1
votes
1
answer
3
Each row and column of a matrix is sorted find the position of any given element
please show the working
please show the working
640
views
asked
May 10, 2017
Algorithms
algorithms
algorithm-design
+
–
1
votes
1
answer
4
Derive the best and worst case complexity of insertion sort?
Derive the best and worst case complexity of insertion sort algorithm?
Derive the best and worst case complexity of insertion sort algorithm?
12.3k
views
asked
May 7, 2017
Algorithms
time-complexity
algorithms
+
–
2
votes
2
answers
5
State and explain master theorem
State and explain master theorem. Can Master’s method be applied to recurrence , $T(n) = 4T(n/2) + n^2logn$ ? Why or why not ?
State and explain master theorem.Can Master’s method be applied to recurrence , $T(n) = 4T(n/2) + n^2logn$ ?Why or why not ?
2.0k
views
asked
May 5, 2017
Algorithms
algorithms
master-theorem
time-complexity
+
–
0
votes
2
answers
6
Prove or disprove the following
790
views
asked
May 5, 2017
Algorithms
algorithms
time-complexity
+
–
2
votes
1
answer
7
Remove Left recursion from context free grammer
1.9k
views
asked
Jan 31, 2017
Compiler Design
compiler-design
grammar
left-recursion
recurrence-relation
test-series
+
–
0
votes
1
answer
8
Construct LL(1) Parsing table for the following grammar
5.0k
views
asked
Jan 31, 2017
Compiler Design
compiler-design
parsing
grammar
ll-parser
theory-of-computation
test-series
+
–
0
votes
0
answers
9
Consider the regular expression 1(1+0)*0.
Consider the regular expression 1(1+0)*0. Contruct the NFA for the given regular expression using Thomson’s construction algorithm and then apply subset construction algorithm to construct the equivalent DFA of the constructed NFA.Finally minimize the DFA. Please answer with working:)
Consider the regular expression 1(1+0)*0.Contruct the NFA for the given regular expression using Thomson’s construction algorithm and then apply subset construction alg...
408
views
asked
Dec 19, 2016
Compiler Design
compiler-design
+
–
1
votes
0
answers
10
The reflection along the line y=x is equivalent to reflection along the X-axis followed by counter clockwise rotation
The reflection along the line y=x is equivalent to reflection along the X-axis followed by counter clockwise rotation by theta degrees.Find the value of theta
4.2k
views
asked
Nov 30, 2016
Computer Graphics
non-gate
computer-graphics
+
–
–7
votes
0
answers
11
Show that the composition of two rotations is additive by concatenating the matrix
Show that the composition of two rotations is additive by concatenating the matrix representations for R(theta 1) and R(theta 2) to obtain R(theta 1) x R(theta 2) = R(theta 1 + theta 2)
Show that the composition of two rotations is additive by concatenating the matrix representations for R(theta 1) and R(theta 2)to obtainR(theta 1) x R(theta 2) = R(theta...
5.3k
views
asked
Nov 30, 2016
Computer Graphics
non-gate
computer-graphics
+
–
–6
votes
0
answers
12
Scan convert an Eclipse with given Eclipse parameters : Rx = 6 and Ry = 4
Scan convert an Eclipse with given Eclipse parameters : Rx = 6 and Ry = 4 Please show the working.
Scan convert an Eclipse with given Eclipse parameters : Rx = 6 and Ry = 4Please show the working.
408
views
asked
Nov 30, 2016
Computer Graphics
non-gate
computer-graphics
+
–
–3
votes
0
answers
13
Scan convert a circle with radius 9.5 and centerd at origin using Mid Point Circle Algorithm
Scan convert a circle with radius 9.5 and centerd at origin using Mid Point Circle Algorithm Please show working.
Scan convert a circle with radius 9.5 and centerd at origin using Mid Point Circle AlgorithmPlease show working.
543
views
asked
Nov 30, 2016
Computer Graphics
non-gate
computer-graphics
+
–
1
votes
0
answers
14
A polygon has 4 vertices located a A(25, 10),B(50, 10),C(60, 30),D(20 ,30)....
A polygon has 4 vertices located a A(25, 10),B(50, 10),C(60, 30),D(20 ,30).Specify the transformation matrix required to double the size of the polygon with point A located at the same position.
A polygon has 4 vertices located a A(25, 10),B(50, 10),C(60, 30),D(20 ,30).Specify the transformation matrix required to double the size of the polygon with point A locat...
3.2k
views
asked
Nov 30, 2016
Computer Graphics
non-gate
computer-graphics
+
–
0
votes
1
answer
15
How long it would take to load a 512 x 480 frame buffer with 12 bits per pixel....
How long it would take to load a 512 x 480 frame buffer with 12 bits per pixel,if 1000 bits can be transferred per second?
How long it would take to load a 512 x 480 frame buffer with 12 bits per pixel,if 1000 bits can be transferred per second?
2.6k
views
asked
Nov 29, 2016
Computer Graphics
computer-graphics
non-gate
+
–
–2
votes
0
answers
16
3sin(200rt) is amplitude modulated with 600
3sin(200rt) is amplitude modulated with 600s(6000rt) Find the spectral response and expression of the AM signal generated
3sin(200rt) is amplitude modulated with 600s(6000rt)Find the spectral response and expression of the AM signal generated
325
views
asked
Nov 28, 2016
Digital Signal Processing
non-gate
+
–
1
votes
1
answer
17
Execute the following instructions where R0 is of 8 bits and its content is 11001011.
Execute the following instructions where R0 is of 8 bits and its content is 11001011. i)LshiftL #2,R0 ii)AshiftR #1,R0
Execute the following instructions where R0 is of 8 bits and its content is 11001011.i)LshiftL #2,R0ii)AshiftR #1,R0
1.2k
views
asked
Nov 17, 2016
CO and Architecture
co-and-architecture
+
–
4
votes
2
answers
18
A computer has 64 bit instruction and 12 bit address.....how many 1-address instruction is possible?
A computer has 64 bit instruction and 12 bit address.If there are 250 3-address instruction and 525 2-address instruction,how many 1-address instruction is possible?
7.9k
views
asked
Nov 17, 2016
CO and Architecture
co-and-architecture
+
–
0
votes
1
answer
19
How many external connections are required to design 32m X 32 memory chip?
Please show the working
Please show the working
3.8k
views
asked
Nov 17, 2016
CO and Architecture
co-and-architecture
non-gate
+
–
0
votes
1
answer
20
Design 4m X 32 memory using 512 X 8 memory chip
Please show working
Please show working
16.1k
views
asked
Nov 17, 2016
CO and Architecture
co-and-architecture
non-gate
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register