Register
Filter

Answers by pradeepchaudhary

1 votes
31
self doubt
is L a regular lang. or CFL ? L={XWWR |w$\epsilon$(0+1)+ ,x$\epsilon$(0+1)+} explain how?
is L a regular lang. or CFL ?L={XWWR |w$\epsilon$(0+1)+ ,x$\epsilon$(0+1)+}explain how?
0 votes
32
C programming
What is the output of this program? int main(void) { int a = 10, b = 20, c = 30; printf(" %d..%d..%d ", a+b+c, (b = b*2), (c = c*2)); return 0; } (A) 60..40..60 (B) 110..40..60 (C) 110..20..30 (D) 60..20..30 does sequence point comes into picture here?
What is the output of this program?int main(void){int a = 10, b = 20, c = 30;printf(" %d..%d..%d ", a+b+c, (b = b*2), (c = c*2));return 0;}(A) 60..40..60(B) 110..40..60(C...
0 votes
33
minimal DFA
Let L be the set of all binary strings whose last two symbols are the same. The number states of the minimal DFA for L has a)2 b)5 c)8 d)3 explain!!
Let L be the set of all binary strings whose last two symbols are the same. The number states of the minimal DFA for L hasa)2b)5c)8d)3 explain!!
0 votes
34
please solve my doubt
1) C,C++,JAVA are finite language or not 2) Every finite language are regular .it is true 3) All regular language are Finite
1) C,C++,JAVA are finite language or not 2) Every finite language are regular .it is true 3) All regular language are Finite
0 votes
35
MadeEasy Test Series: Theory Of Computation - Finite Automata
The difference between the number of states in minimal DFA and minimal NFA, which accepts all strings end with 3rd bit as b is _____. [ Assume $\sum$ = {a,b} ]
The difference between the number of states in minimal DFA and minimal NFA, which accepts all strings end with 3rd bit as b is _____. [ Assume $\sum$ = {a,b} ]
0 votes
36
Deterministic Finite Automata ( DFA)
Construct a DFA over Σ=(a,b) so that it accepts all strings where 1) 2nd symbol from the right is 'a' 2) 3rd symbol from the right is 'a'
Construct a DFA over Σ=(a,b) so that it accepts all strings where 1) 2nd symbol from the right is 'a'2) 3rd symbol from the right is 'a'
0 votes
37
Aptitude Doubt
(1-1/3) (1-1/4) (1-1/5)...(1-1/n)=x then the value of x is : a)1/n b)2/n c)2(n-1)/n d)2/n(n+1)
(1-1/3) (1-1/4) (1-1/5)...(1-1/n)=x then the value of x is :a)1/n b)2/n c)2(n-1)/n d)2/n(n+1)
3 votes
38
time complexity
If both of the algorithms A and B need O(nlogn) time then they both are equally efficient and finish in same amount of time. TRUE OR FALSE
If both of the algorithms A and B need O(nlogn) time then theyboth are equally efficient and finish in same amount of time.TRUE OR FALSE
0 votes
39
C output
void main() { char*s[]={"iceland","Greenland","Ireland","Switzerland"}; char **ptr[]={s+3,s+2,s+1,s}; char ***p=ptr; printf(\%s ",**++p); printf(\%s ",*(*++p+3); printf(\%s ",*p[-2]+3); printf(\%s ",p[-1][-1]+1); }
void main() { char*s[]={"iceland","Greenland","Ireland","Switzerland"}; char ptr[]={s+3,s+2,s+1,s}; char *p=ptr; printf(\%s ", ++p); printf(\%s ",*(*++p+3); printf(\%s ...
4 votes
40
MIT assignment
Find the complexity of the following code fragment: int i = 1; for(; i <= n logn; i++) { for(i++; i <= n; i++) { printf("1") } }
Find the complexity of the following code fragment:int i = 1; for(; i <= n logn; i++) { for(i++; i <= n; i++) { printf("1") } }
1 votes
41
Uttrakhand Asst. Professor Exam-51
Which of the following operation of relational algebra, selects certain columns from the table and discards the other columns? SELECT PROJECT DIVISION None of the above
Which of the following operation of relational algebra, selects certain columns from the table and discards the other columns?SELECTPROJECTDIVISIONNone of the above
2 votes
42
Number of tables
What is minimum number of tables requires, to represent above ER diagram? (Does total participation and partial participation will take a role in this question)?
What is minimum number of tables requires, to represent above ER diagram?(Does total participation and partial participation will take a role in this question)?
0 votes
43
Normalization
0 votes
44
BCNF
Every BCNF decomposition is A)Dependency preserving B)not a dependency preserving C)Need not be dependency preserving D)None of the above
Every BCNF decomposition is A)Dependency preservingB)not a dependency preservingC)Need not be dependency preservingD)None of the above
0 votes
45
DBMS Relational Algebra
Which of the following Queries is more Efficient on the given data? 1. In terms of Space. 2. In terms of Calculation. also, How many calculations are necessary for Each?
Which of the following Queries is more Efficient on the given data?1. In terms of Space.2. In terms of Calculation. also, How many calculations are necessary for Each?
Page: