2 votes
1 answer
122
Statement I: Li be regular language i = 1, 2, . . ., ∞Language ⋂ ∞=1is regular i.e. Infinite intersection.Statement II: L = {wx | w ∈ Ʃ*, x ∈ Ʃ*, |w| = |x|} i...
2 votes
1 answer
123
0 votes
2 answers
124
3. Consider these 2 statements:S1: LR = L, if and only if L is the language of palindromes.where LR is obtained by reversing all the strings of L.S2: | L1∙ L2 | = | L1 ...
0 votes
2 answers
125
L1= Set of all strings having equal number of 00 and 11.L2= Set of all strings having equal number of 01 and 10.Which of the following is true?(a) Both are Regular (b) Bo...
1 votes
2 answers
126
0 votes
1 answer
128
When we should use hashing and when we should use indexing? what is the difference b/w these two tems ? Explain with taking a practical scenario
2 votes
1 answer
131
Find the output of the c program below, assume base address of the array is 1500. The size of int is 4 bytes
0 votes
0 answers
132
The number of binary search tree’s with 4 nodes (1, 2, 3, 4) possible where in every binary search tree ‘1’ is leaf node are .....How to solve such type of question...
1 votes
1 answer
133
what is the output?
0 votes
1 answer
134
How to solve this in the simplest way?$T(n) = T(n/4) + T(3n/4) +n$
1 votes
1 answer
135
1 votes
0 answers
136
Are colleges associated with CUCET are good for taking admissions in Mtech CSE?
0 votes
0 answers
137
I am getting 36.67 marks in general category.....what type of colleges i should apply for?I am not able to figure out from http://gatecselastrank.com/........please help ...
1 votes
2 answers
138
0 votes
1 answer
139