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
Answers by JAINchiNMay
0
votes
1
unacademy test series
A shopkeeper claims to sell rice at cost price. He uses a false weight with the intention of selling rice at 20% profit. After selling rice to the customer, he realises that the customer has paid 15% less than what he should have paid. What is the actual profit percentage made by the shopkeeper? a)2%gain b)12%gain c)4% gain d)5% gain
A shopkeeper claims to sell rice at cost price. He uses a false weight with the intention of selling rice at 20% profit. After selling rice to the customer, he realises t...
1.0k
views
answered
Aug 25, 2022
Quantitative Aptitude
general-aptitude
quantitative-aptitude
profit-loss
test-series
+
–
2
votes
2
Gate@Zeal 2023 Test Series
Please explain
Please explain
552
views
answered
Aug 6, 2022
Digital Logic
sequential-circuit
+
–
0
votes
3
I have a confusion as to which colleges to choose from the list below for Mtech in CSE. My rank is 1694, Gate Score is 578, Category- General:- DTU, BITS Goa/Hyd, NIT Allahabad, NIT Rourkela, NIT Calicut?
DTU better than NIT Calicut, Rourkela and Allahabad as well as BITS Goa/Hyderabad for Mtech CSE?
804
views
answered
Jun 25, 2022
Other Colleges
nit
bits
+
–
0
votes
4
NIELIT 2016
a tuple in relation DBMS is a equivalent to (a) Record (b) Field (c) File (d) Database
a tuple in relation DBMS is a equivalent to(a) Record(b) Field(c) File(d) Database
326
views
answered
Jun 25, 2022
Databases
databases
relational-algebra
+
–
0
votes
5
TNPSC 2017
___________ operator is used to retain the unmatched rows of relations when they joined. (a) Outer Join (b) Inner Join (c) Natural Join (d) Self Join
___________ operator is used to retain the unmatched rows of relations when they joined.(a) Outer Join(b) Inner Join(c) Natural Join(d) Self Join
219
views
answered
Jun 25, 2022
Databases
databases
relational-algebra
+
–
0
votes
6
CIL
which of the following is a unary operation? (a) intersection (b) projection (c) join (d) cartesian Product
which of the following is a unary operation?(a) intersection(b) projection(c) join(d) cartesian Product
287
views
answered
Jun 25, 2022
Databases
databases
relational-algebra
+
–
0
votes
7
Test by Bikram | Digital Logic | Test 2 | Question: 2
The inputs of a NAND gate are connected together. The resulting circuit is ______. an OR gate an AND gate a NOT gate None of the above
The inputs of a NAND gate are connected together. The resulting circuit is ______.an OR gatean AND gatea NOT gateNone of the above
424
views
answered
Jun 11, 2022
Digital Logic
tbb-digital-logic-2
+
–
0
votes
8
Test by Bikram | Programming | Test 2 | Question: 27
What is the output of the following program? int fun (int z) { if( z==0 || z==1 ) return 1; else return fun(z-1) ; } int main() { int y; y=fun(8); printf(“%d”, y) ; } $1$ $36$ $8$ $40$
What is the output of the following program? int fun (int z) { if( z==0 || z==1 ) return 1; else return fun(z-1) ; } int main() { int y; y=fun(8); printf(“%d”...
222
views
answered
Jun 14, 2021
Programming in C
tbb-programming-2
+
–
1
votes
9
Test by Bikram | Programming | Test 2 | Question: 28
#include<stdio.h> int K = 10; int main() { foo(); foo(); return 0; } int foo() { static int k= 1; printf("%d ",k); k++; return 0; } What is the output of the above code snippet? $2,3$ $1,2$ $1,3$ $2,4$
#include<stdio.h int K = 10; int main() { foo(); foo(); return 0; } int foo() { static int k= 1; printf("%d ",k); k++; return 0; }What is the output of the above code sni...
226
views
answered
Jun 14, 2021
Programming in C
tbb-programming-2
+
–
2
votes
10
NIELIT 2016 MAR Scientist C - Section B: 16
Evaluate the sum $S=1+1+\dfrac{3}{2^{2}}+\dfrac{3}{2^{3}}+\dfrac{5}{2^{4}}+\dots$ $1$ $2$ $3$ $4$
Evaluate the sum $S=1+1+\dfrac{3}{2^{2}}+\dfrac{3}{2^{3}}+\dfrac{5}{2^{4}}+\dots$$1$$2$$3$$4$
459
views
answered
Apr 23, 2021
Quantitative Aptitude
nielit2016mar-scientistc
sequence-series
+
–
0
votes
11
Peter Linz Edition 4 Exercise 7.2 Question 9 (Page No. 195)
Find an npda with two states for the language $L =$ {$a^nb^{n+1} : n ≥ 0$}.
Find an npda with two states for the language $L =$ {$a^nb^{n+1} : n ≥ 0$}.
1.4k
views
answered
Nov 12, 2020
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
pushdown-automata
npda
+
–
0
votes
12
Peter Linz Edition 4 Exercise 7.2 Question 4 (Page No. 195)
Construct an npda that accepts the language generated by the grammar $S → aSSS|ab$.
Construct an npda that accepts the language generated by the grammar $S → aSSS|ab$.
307
views
answered
Nov 12, 2020
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
pushdown-automata
npda
+
–
0
votes
13
Peter Linz Edition 4 Exercise 6.1 Question 6 (Page No. 161)
Eliminate useless productions from $S\rightarrow a|aA|B|C,$ $A\rightarrow aB|\lambda,$ $B\rightarrow Aa,$ $C\rightarrow cCD,$ $D\rightarrow ddd.$
Eliminate useless productions from$S\rightarrow a|aA|B|C,$$A\rightarrow aB|\lambda,$$B\rightarrow Aa,$$C\rightarrow cCD,$$D\rightarrow ddd.$
507
views
answered
Oct 13, 2020
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
context-free-grammar
+
–
1
votes
14
Peter Linz Edition 4 Exercise 6.1 Question 5 (Page No. 161)
Eliminate all useless productions from the grammar $S\rightarrow aS|AB,$ $A\rightarrow bA,$ $B\rightarrow AA.$ What language does this grammar generate?
Eliminate all useless productions from the grammar$S\rightarrow aS|AB,$$A\rightarrow bA,$$B\rightarrow AA.$What language does this grammar generate?
380
views
answered
Oct 13, 2020
Theory of Computation
peter-linz
peter-linz-edition4
context-free-grammar
context-free-language
+
–
0
votes
15
Peter Linz Edition 4 Exercise 5.2 Question 17 (Page No. 145)
Use the exhaustive search parsing method to parse the string $abbbbbb$ with the grammar with productions $S\rightarrow aAB,$ $A\rightarrow bBb,$ $B\rightarrow A|\lambda.$ In general, how many rounds will be needed to parse any string $w$ in this language?
Use the exhaustive search parsing method to parse the string $abbbbbb$ with the grammar with productions$S\rightarrow aAB,$$A\rightarrow bBb,$$B\rightarrow A|\lambda.$In ...
408
views
answered
Oct 12, 2020
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
context-free-grammar
parsing
+
–
0
votes
16
Peter Linz Edition 4 Exercise 5.2 Question 20 (Page No. 145)
Find a grammar equivalent to $S\rightarrow aAB, A\rightarrow bBb, B\rightarrow A|\lambda$ that satisfies the conditions of Theorem 5.2. Theorem 5.2 Suppose that $G = (V, T, S, P)$ is a context-free grammar that does not have ... algorithm which, for any $w ∈ Σ^*,$ either produces a parsing of $w$ or tells us that no parsing is possible.
Find a grammar equivalent to $S\rightarrow aAB, A\rightarrow bBb, B\rightarrow A|\lambda$ that satisfies the conditions of Theorem 5.2.Theorem 5.2Suppose that $G = (V, T,...
370
views
answered
Oct 12, 2020
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
context-free-grammar
+
–
0
votes
17
Peter Linz Edition 4 Exercise 5.2 Question 18 (Page No. 145)
Is the string $aabbababb$ in the language generated by the grammar $S → aSS|b$? Show that the grammar with productions $S\rightarrow aAb|\lambda,$ $A\rightarrow aAb|\lambda$ is unambiguous.
Is the string $aabbababb$ in the language generated by the grammar $S → aSS|b$?Show that the grammar with productions$S\rightarrow aAb|\lambda,$$A\rightarrow aAb|\lambd...
334
views
answered
Oct 12, 2020
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
context-free-grammar
ambiguous
+
–
0
votes
18
Peter Linz Edition 4 Exercise 5.2 Question 15 (Page No. 145)
Show that the grammar with productions $S\rightarrow SS,$ $S\rightarrow \lambda,$ $S\rightarrow aSb,$ $S\rightarrow bSa.$ is ambiguous.
Show that the grammar with productions$S\rightarrow SS,$$S\rightarrow \lambda,$$S\rightarrow aSb,$$S\rightarrow bSa.$is ambiguous.
338
views
answered
Oct 12, 2020
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
grammar
ambiguous
+
–
0
votes
19
Peter Linz Edition 4 Exercise 5.2 Question 14 (Page No. 145)
Show that the grammar $S\rightarrow aSb|SS|\lambda$ is ambiguous, but that the language denoted by it is not.
Show that the grammar $S\rightarrow aSb|SS|\lambda$ is ambiguous, but that the language denoted by it is not.
284
views
answered
Oct 12, 2020
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
grammar
ambiguous
+
–
0
votes
20
Peter Linz Edition 4 Exercise 5.2 Question 13 (Page No. 145)
Show that the following grammar is ambiguous. $S\rightarrow aSbS|bSaS|\lambda$
Show that the following grammar is ambiguous. $S\rightarrow aSbS|bSaS|\lambda$
224
views
answered
Oct 12, 2020
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
grammar
ambiguous
+
–
0
votes
21
grammer
S -> S is a context-free grammar or not?
S - Sis a context-free grammar or not?
405
views
answered
Oct 11, 2020
Theory of Computation
theory-of-computation
context-free-grammar
descriptive
+
–
0
votes
22
Theory of computation - Grammer
here answer is given is A won''t it be B? as with A we cannot get 100 string,but with B we can
here answer is given is A won''t it be B?as with A we cannot get 100 string,but with B we can
368
views
answered
Oct 11, 2020
Theory of Computation
theory-of-computation
grammar
+
–
0
votes
23
Peter Linz Edition 4 Exercise 5.2 Question 7 (Page No. 145)
Construct an unambiguous grammar equivalent to the grammar in Exercise 6.
Construct an unambiguous grammar equivalent to the grammar in Exercise 6.
234
views
answered
Oct 11, 2020
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
grammar
ambiguous
+
–
0
votes
24
Peter Linz Edition 4 Exercise 5.2 Question 6 (Page No. 145)
Show that the following grammar is ambiguous. $S\rightarrow AB|aaB,$ $A\rightarrow a|Aa,$ $B\rightarrow b.$
Show that the following grammar is ambiguous.$S\rightarrow AB|aaB,$$A\rightarrow a|Aa,$$B\rightarrow b.$
216
views
answered
Oct 11, 2020
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
grammar
ambiguous
+
–
0
votes
25
Peter Linz Edition 4 Exercise 5.2 Question 3 (Page No. 144)
Find an s-grammar for $L =$ {$a^nb^{n+1} : n ≥ 2$}.
Find an s-grammar for $L =$ {$a^nb^{n+1} : n ≥ 2$}.
383
views
answered
Oct 11, 2020
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
grammar
+
–
0
votes
26
Peter Linz Edition 4 Exercise 5.2 Question 2 (Page No. 144)
Find an s-grammar for $L =$ {$a^nb^n : n ≥ 1$}.
Find an s-grammar for $L =$ {$a^nb^n : n ≥ 1$}.
481
views
answered
Oct 11, 2020
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
grammar
+
–
0
votes
27
Peter Linz Edition 4 Exercise 5.2 Question 1 (Page No. 144)
Find an s-grammar for $L (aaa^*b + b)$.
Find an s-grammar for $L (aaa^*b + b)$.
381
views
answered
Oct 11, 2020
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
grammar
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register