Register
Filter

Questions by santhoshdevulapally

0 votes
0 answers
2
CSL AND CFL
1)L={W$W^{R}WW^{R}/ W\epsilon (0+1)^{+}$ } IS THIS CSL OR CFL. 2)L={$a^{m}b^{n}c^{p}/(m=n) or (n=p)}$ } IS THIS DCFL OR CFL. Please construct PDA for 2nd language. --------------------------------------------------------------------------------- I think 1st is CSL and 2nd is CFL
1)L={W$W^{R}WW^{R}/ W\epsilon (0+1)^{+}$ } IS THIS CSL OR CFL.2)L={$a^{m}b^{n}c^{p}/(m=n) or (n=p)}$ } IS THIS DCFL OR CFL.Please construct PDA for 2nd language. -...
0 votes
0 answers
4
Scheduling
In optimal non preemptive scheduling algorithm. ----------------------------------------------------------- My approach --Process the requests according to minimal burst time of all pocess.is it correct???
In optimal non preemptive scheduling algorithm. -My approach Process the requests according to minimal burst time of all pocess.is it correct???
1 votes
1 answer
5
APTITUDE
Let A can finish the task in 8 days and B can finish the same task in 10 days. How many days are required to finish the task if both are working alternate days.?? --------------------------------------------------------- Ans ;;$8\frac{4}{5}$ days.
Let A can finish the task in 8 days and B can finish the same task in 10 days.How many days are required to finish the task if both are working alternate days.?? -...
0 votes
0 answers
8
SHIFT REGISTER
any one explain the circuit diagram,what modifications done by AND gate to the i/p??
any one explain the circuit diagram,what modifications done by AND gate to the i/p??
2 votes
0 answers
9
No of symmetric relations
No of Symmetric relations containg set with A={1,2,3,4,5,6,7} which contain exactly four ordered pairs.
No of Symmetric relations containg set with A={1,2,3,4,5,6,7} which contain exactly four ordered pairs.
1 votes
1 answer
10
Live variable
What is live variable and dead code elimination. please explain with example each
What is live variable and dead code elimination.please explain with example each
1 votes
0 answers
11
SDT Actions
E->number {E.val=number} E->E+E {E.val=E1.val+E2.val} E->E*E {E.val=E1.val*E2.val} How it detects S/R conflict and resolves the conflict infavour of shift over reduce action.
E->number {E.val=number}E->E+E {E.val=E1.val+E2.val}E->E*E {E.val=E1.val*E2.val}How it detects S/R conflict and resolves the conflict infavour of shift over reduce actio...
1 votes
1 answer
12
AUTOMATA
In the exam for a given finite automata Find the minimum no of states means consider DFA or NFA.
In the exam for a given finite automataFind the minimum no of states means consider DFA or NFA.
0 votes
0 answers
13
PDA-ACCEPTANCE
// pda accept the string in 2 -ways.either by final state or empty stack. my doubt is in the diagram at state q1 is for every 'a' it pops one 'b'.when no of 'b' are equall it accept or not. and what is the language accepted by above PDA?
// pda accept the string in 2 -ways.either by final state or empty stack.my doubt is in the diagram at state q1 is for every 'a' it pops one 'b'.when no of 'b' are equal...
2 votes
1 answer
14
MATCHING NUMBER
what is the matching number of $K_{2,3}$ graph.and also explain matching number of $K_{m,n}$(simplification).
what is the matching number of $K_{2,3}$ graph.and also explain matching number of $K_{m,n}$(simplification).
0 votes
0 answers
15
WHY WE CANNOT HANDLE L-ATTRIBUTE SDD'S ON LR GRAMMARS.
1 votes
3 answers
16
SPACE COMPLEXITY
1 votes
0 answers
17
ACE TEST SERIES
1 votes
1 answer
18
No of multiplications
0 votes
0 answers
19
Direct mapping
0 votes
1 answer
20
NOTATIONS(BIG O,BIG OMEGA,THETA)
Page: