Register
Filter

Recent activity by junk_mayavi

3 answers
1
Why L = { w x w ∣ w , x ∈ ( a + b ) + } is not regular?
We can say there are four types of strings in the language so the regex will be: a(a+b)+a + b(a+b)+b + a(a+b)+b + b(a+b)+a Please expleain where I am wrong
We can say there are four types of strings in the language so the regex will be: a(a+b)+a + b(a+b)+b + a(a+b)+b + b(a+b)+a Please expleain where I am wrong
1 answer
3
Dearrangements
Anyone give a solution for this.....
Anyone give a solution for this.....
1 answer
4
test series
What will be the output of the following C program? #include<stdio.h> int main() { char c = 'A'; int x=5, y=10, res1, res2; res1=c++ || x++ ||--y; res2 = ++x && --c && ++y; printf("%d %d %d %c", res1, res2, x+y , c); return 0; } What is the output?
What will be the output of the following C program?#include<stdio.h int main() { char c = 'A'; int x=5, y=10, res1, res2; res1=c++ || x++ || y; res2 = ++x && c && ++y; p...
3 answers
5
GATE CSE 1995 | Question: 1.11
What are $x$ and $y$ in the following macro definition? macro Add x, y Load y Mul x Store y end macro Variables Identifiers Actual parameters Formal parameters
What are $x$ and $y$ in the following macro definition?macro Add x, y Load y Mul x Store y end macroVariablesIdentifiersActual parametersFormal parameters
1 answer
6
solve by generating function along with approach thanks advance
In how many ways 2 alike apple, 3 alike orange and 4 alike mango can be given to 3 children if each child can have 1 or more than 1 fruits.
In how many ways 2 alike apple, 3 alike orange and 4 alike mango can be given to 3 children if each child can have 1 or more than 1 fruits.
0 answers
8
Static Single Assignment
x = 7 if b { x = 8 } print(x) Convert the following code in Static single assignment form.
x = 7if b { x = 8}print(x)Convert the following code in Static single assignment form.
0 answers
9
Hashing-MadeEasy
Please explain primary and secondary clustering in brief. I tend to forget their difference because their definitions seem quite similar to me. And also, which one is true? According to me it was S1 and S3 but given is S3 only.
Please explain primary and secondary clustering in brief. I tend to forget their difference because their definitions seem quite similar to me. And also, which one is tru...
0 answers
12
Test series
Consider the following grammar S→S#S | S&S | id The above grammar with the given production rules is fed to a yacc tool (which is an LALR (1) parser generator) for parsing and evaluating arithmetic expressions. Which one of the following is true about the action of yacc for the given grammar?
Consider the following grammar S→S#S | S&S | idThe above grammar with the given production rules is fed to a yacc tool (which is an LALR (1) parser generator) for parsi...
0 answers
13
given language is DCFL?
$L=\{0^l1^{2l}0^{l+n}|l\geq{0},n\geq{0}\}$
$L=\{0^l1^{2l}0^{l+n}|l\geq{0},n\geq{0}\}$
0 answers
16
Weighted undirected graph
Consider a Weighted undirected graph connected with 'V' vertices and 'E' edges.What is the worst case time complexity to check if 2 particular vertices 'x' and 'y' are present in the graph, if present then calculate the minimum distance between them?
Consider a Weighted undirected graph connected with 'V' vertices and 'E' edges.What is the worst case time complexity to check if 2 particular vertices 'x' and 'y' are p...
1 answer
18
Theads
True/False : 1)Several threads can share same physical address space. 2)Several threads can share same virtual address space.
True/False :1)Several threads can share same physical address space.2)Several threads can share same virtual address space.
2 answers
21
number of spanning tree
Consider a complete bipartite graph with ‘m’ and ‘n’ vertices. If m = 4, n = 4, then the number of spanning trees of graph are ________.
Consider a complete bipartite graph with ‘m’ and ‘n’ vertices. If m = 4, n = 4, then the number of spanning trees of graph are ________.
0 answers
22
minimal dfa
Consider the following grammar: $S\rightarrow aA|bB$ $A\rightarrow aA|bB$ $B\rightarrow bB|ϵ$ Then the number of states in a minimal D.F.A of the above grammar is ______________ ?
Consider the following grammar:$S\rightarrow aA|bB$$A\rightarrow aA|bB$$B\rightarrow bB|ϵ$Then the number of states in a minimal D.F.A of the above grammar is __________...