4 votes
2 answers
41
6 votes
1 answer
42
I want to know whether the following Regular Expressions are Equal ?(a+b) * = (a* + b*)* = (a* + b)* = (a + b*)* = (a* b*)* = (b* a*)* = a*(ba*)* ...
3 votes
1 answer
43
Cosider the code snippetCODE 1float a= 10.25; if(a==10.25) ptint " A " else print "B" print "C"CODE 2float a =10.25; n=15.25; while(n!=10.25) { print "*"; n ; } Number of...
2 votes
1 answer
45
" Lazy and Smart People Are Dangerous "What I think is that $\forall(x) (\text{Lazy}(x) \wedge\text{Smart}(x) \rightarrow Dangerous(s) )$Is it correct ?If YEShttps://gate...
5 votes
1 answer
46
Given R with n tuples S with m tuples n<m then How many minimum and maximum tuples in follwing relations . Please Justify with Reason / ExamplesR-SS-RR Left Join SR Nat...
2 votes
1 answer
48
Can someone explain stars and bar problme using suitable example and imagesProblem : https://en.wikipedia.org/wiki/Stars_and_bars_%28combinatorics%29#Proofs_via_the_metho...
0 votes
0 answers
49
" Time Complexity of Dequeue will be $ \leq $Time complexity of Enqueue operations "Justify the above statement
3 votes
1 answer
50
Solve the Following Recurrence usingBack SubstitutionMaster Theorem$T(n)=T(\sqrt{n})+n+c$ Using Master TheoremUsing Master Theorem,put n = $2^{m}$$ T(n)=T(2^{m})= S(m)$ i...