Register
Filter

Questions by akankshadewangan24

3 votes
1 answer
41
compiier design
Synthesized attribute can be easily simulated by a (A) LL grammar (B) Ambiguous grammar (C) LR grammar (D) None of the above Answer: C
Synthesized attribute can be easily simulated by a(A) LL grammar (B) Ambiguous grammar(C) LR grammar (D) None of the aboveAnswer: C
0 votes
1 answer
42
aptitude
let X be the airthmetic mean and Y,Z be the two geomatric mean between any two positive numbers .The vlue of (X^3 +Z^3)/XYZ
let X be the airthmetic mean and Y,Z be the two geomatric mean between any two positive numbers .The vlue of (X^3 +Z^3)/XYZ
0 votes
1 answer
43
aptitude
let a1,a2,a3...........a10 be integers such that 0<a1<a2<a3................<a10 if S=a1+a2+a3 +........+a10 then 110<= S<= 55 110<=S 55<=S 55<=S<=110
let a1,a2,a3...........a10 be integers such that 0<a1<a2<a3................<a10 if S=a1+a2+a3 +........+a10 then110<= S<= 55110<=S55<=S55<=S<=110
0 votes
1 answer
44
aptitude
if a-b/2 ,b/2 . c-b/2 are in GP then a,b,b are in ............. GP HP AP none explain plz
if a-b/2 ,b/2 . c-b/2 are in GP then a,b,b are in .............GPHPAPnone explain plz
0 votes
1 answer
45
compiler design
the G is S-> while(E)S/a E-> a for nested while statement a.is not LR(1) b.is not SLR(1) c.is not LALR(1) d.is LR(0)
the G isS- while(E)S/aE- afor nested while statementa.is not LR(1)b.is not SLR(1)c.is not LALR(1)d.is LR(0)
0 votes
1 answer
46
aptitude
there are x no. of junior players in football club if you divide them into teams of seven players each 3 are left out and if you divide them into teams of 11 each 2 are left out. how many possible values X can be taken if X is less than 1000?
there are x no. of junior players in football club if you divide them into teams of seven players each 3 are left out and if you divide them into teams of 11 each 2 are ...
0 votes
0 answers
47
aptitude
There are n books in a shelf.If you divide the books into groups of 9 two books are left out and if groups of 11 , 7 are left.Find the capacity of the shelf is 1000 How many different values can N take ?!
There are n books in a shelf.If you divide the books into groups of 9 two books are left out and if groups of 11 , 7 are left.Find the capacity of the shelf is 1000 How m...
1 votes
1 answer
48
aptitude
In how many different ways can 105 be written as the sum of two or more consecutive positive integers?
In how many different ways can 105 be written as the sum of two or more consecutive positive integers?
2 votes
2 answers
49
factorial
in how many ways can 10! be written as the product of two natural number?
in how many ways can 10! be written as the product of two natural number?
2 votes
1 answer
50
factors
how many numbers less than 1000 will have exactly 3 factor?
how many numbers less than 1000 will have exactly 3 factor?
2 votes
1 answer
51
factors
how many two digit odd numbers are there with 8 factors?
how many two digit odd numbers are there with 8 factors?
1 votes
1 answer
52
decoder
The following switching functions are to be implemented using a decoder f1 = ∑m (1, 2, 4, 8, 10, 14) f2 = ∑m (2, 5, 9, 15) f3 = ∑m (2, 4, 5, 6, 7) The minimum configuration of decoder is A. 2 to 4 line B. 3 to 8 line C. 4 to 16 line D. 5 to 32 line
The following switching functions are to be implemented using a decoderf1 = ∑m (1, 2, 4, 8, 10, 14)f2 = ∑m (2, 5, 9, 15)f3 = ∑m (2, 4, 5, 6, 7) The minimum configur...
1 votes
1 answer
53
queue
The initial configuration of queue is a, b, c, d. ‘a’ is at the front. To get the configuration d, c, b, a how many deletions and additions required: (A) 2 deletions, 3 additions (B) 3 deletions, 2 additions (C) 3 deletions, 4 additions (D) 3 deletions, 3 additions
The initial configuration of queue is a, b, c, d. ‘a’ is at the front. To get the configuration d, c, b, a how many deletions and additions required:(A) 2 deletions, ...
1 votes
0 answers
54
turing machine
any TM with m symbol and n states can be simulated by another TM with just 2 symbols and less than ans 8 mn states how?
any TM with m symbol and n states can be simulated by another TM with just 2 symbols and less thanans 8 mn states how?
1 votes
1 answer
55
turing machine
the number of state are neccessary to simulate a Turing machine with just 2 variable and less than a. m+m b.8mn + 4 m c.mn d.4mn+m
the number of state are neccessary to simulate a Turing machine with just 2 variable and less thana. m+mb.8mn + 4 mc.mnd.4mn+m
1 votes
1 answer
56
melay machine
a melay machine has no terminal state means?
a melay machine has no terminal state means?
2 votes
1 answer
57
Minimization
what is bounded minization technique? generating recursive function? these terms are in descrete mathematics right?
what is bounded minization technique? generating recursive function?these terms are in descrete mathematics right?
1 votes
1 answer
58
FSM machine
DFSM with 1 stack has same power as NDFSM with 1 stack is False .Why? DFSM with 2 stack has same power as NDFSM with 2 stack is TRUE .Why? these confusing. help me
DFSM with 1 stack has same power as NDFSM with 1 stack is False .Why?DFSM with 2 stack has same power as NDFSM with 2 stack is TRUE .Why?these confusing. help me
1 votes
1 answer
59
NPDM and DPDM
what are the examples of NPDM and DPDM?
what are the examples of NPDM and DPDM?
1 votes
2 answers
60
mathematics
Consider the set H of all 3 × 3 matrices of the type where a, b, c, d, e and f are real numbers and abc ≠ 0. Under the matrix multiplication operation, the set H is a group a monoid but not a group C a semigroup but not a monoid D neither a group nor a semigroup
Consider the set H of all 3 × 3 matrices of the type where a, b, c, d, e and f are real numbers and abc ≠ 0. Under the matrix multiplication operation, the set H is a...
Page: