Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by himgta
0
votes
3
answers
121
#NFA and DFA
Which of the following statement(s) are true about NFA & DFA? (i) NFA is more powerful than DFA but DFA is more efficient than NFA. (ii) NFA will respond for only valid inputs and no need to respond for invalid inputs. (iii) There is no concept of dead states and complement in ... (b) only (ii) & (iii) are true (c) only (iii), (iv) & (i) are true (d) All statements are true
Which of the following statement(s) are true about NFA & DFA?(i) NFA is more powerful than DFA but DFA is more efficient than NFA.(ii) NFA will respond for only valid inp...
1.3k
views
asked
Jul 8, 2018
2
votes
1
answer
122
#Test series
Statement I: Li be regular language i = 1, 2, . . ., ∞ Language ⋂ ∞=1is regular i.e. Infinite intersection. Statement II: L = {wx | w ∈ Ʃ*, x ∈ Ʃ*, |w| = |x|} is regular. (a) Both are True (b) Both are False (c) S1 → True, S2 → False (d) S1 → False, S2 → True
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...
767
views
asked
Jul 8, 2018
2
votes
1
answer
123
#Regular Expression
Which one of the Regular Expression given defines the same language as defined by R = (a + b)* (aa + bb) (a + b)* ? (a) (a (ba)* + b (ab)*) (a + b)* (b) (a (ba)* + b (ab)*)* (a + b)* (c) (a (ba)* (a + bb) + b (ab)* (b + aa)) (a + b)* (d) (a (ba)* (a + bb) + b (ab)* (b + aa)) (a + b)+
Which one of the Regular Expression given defines the same language as defined by R = (a + b)* (aa + bb) (a + b)* ?(a) (a (ba)* + b (ab)*) (a + b)*(b) (a (ba)* + b (ab)*)...
1.9k
views
asked
Jul 8, 2018
Theory of Computation
regular-expression
+
–
0
votes
2
answers
124
#Test Series
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 | × | L2 | Relation? (a) Both are F (b) Both are T (c) S1 → T, S2 → F (d) S1 → F, S2 → T
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 ...
960
views
asked
Jul 6, 2018
0
votes
2
answers
125
#Test series
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) Both are Context-Free (c) L1 is regular, L2 is Context Free (d) L1 is CF, L2 is Regular
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...
610
views
asked
Jul 4, 2018
1
votes
2
answers
126
#REGULAR LANGUAGE
481
views
asked
Jul 4, 2018
1
votes
1
answer
127
#CAREER ADVICE
I am a 2018 batch passout from a government college, In the 4 years of engineering I haven't learn a single programming language bcoz of lack of opportunity in the college but somehow it was my fault, appeared for GATE-2018 with some preparation and scored 36 ... in India? What are the various resources for exploring this field? How can I get a job in this field? Please help me.
I am a 2018 batch passout from a government college, In the 4 years of engineering I haven't learn a single programming language bcoz of lack of opportunity in the colleg...
543
views
asked
Jun 17, 2018
Job Queries
gate2018-admissions
career-advice
+
–
0
votes
1
answer
128
#Hashing vs Indexing
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
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
714
views
asked
Jun 1, 2018
0
votes
0
answers
129
#Test_Series
Consider the below given C code: Void main() { int x=5,y=2; int *p; p=&x; y=*p; x=*y; printf("y is %d x is %d\n",y,x); } Choose the correct option: A) The following program has 1 lexical error, 1 syntax error. B) The following program has 1 lexical error only. C) The following program has 1 lexical error, 1 semantic error. D) No error
Consider the below given C code:Void main(){int x=5,y=2;int *p;p=&x;y=*p;x=*y;printf("y is %d x is %d\n",y,x);}Choose the correct option:A) The following program has 1 le...
413
views
asked
Apr 30, 2018
2
votes
2
answers
130
#Test_Series
Consider implementation of stack using queue by following algorithm. Let $x$ be an element to be pushed in the stack push(q1,x) { EQ(q1,x) while(q1 does not contain 1 element) { k=DQ(q1) EQ(q1,k) } } pop(q1) { DQ(q1) } How many enqueue and dequeue operations required to push $2$ and pop $2$ elements in the empty stack?
Consider implementation of stack using queue by following algorithm.Let $x$ be an element to be pushed in the stackpush(q1,x) { EQ(q1,x) while(q1 does not contain 1 eleme...
878
views
asked
Apr 30, 2018
DS
data-structures
stack
queue
+
–
2
votes
1
answer
131
#test_series
Find the output of the c program below, assume base address of the array is 1500. The size of int is 4 bytes
Find the output of the c program below, assume base address of the array is 1500. The size of int is 4 bytes
331
views
asked
Apr 21, 2018
0
votes
0
answers
132
#Test-series
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 questions in the simple way?
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...
301
views
asked
Apr 13, 2018
1
votes
1
answer
133
#Test series
what is the output?
what is the output?
339
views
asked
Apr 13, 2018
0
votes
1
answer
134
#Recurrence_Relation
How to solve this in the simplest way? $T(n) = T(n/4) + T(3n/4) +n$
How to solve this in the simplest way?$T(n) = T(n/4) + T(3n/4) +n$
427
views
asked
Apr 12, 2018
Algorithms
recurrence-relation
master-theorem
+
–
1
votes
1
answer
135
#test series
267
views
asked
Apr 1, 2018
Mathematical Logic
mathematical-logic
+
–
1
votes
0
answers
136
#Admission CUCET
Are colleges associated with CUCET are good for taking admissions in Mtech CSE?
Are colleges associated with CUCET are good for taking admissions in Mtech CSE?
256
views
asked
Mar 27, 2018
0
votes
0
answers
137
#Admission Doubt
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 me .....i am pretty confused
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 ...
341
views
asked
Mar 19, 2018
1
votes
2
answers
138
ME test series
Consider the following program segment int main() { char *str = "GATECS"; printf("%d",madeeasy(str)); return 0; } int madeeasy(int *p1) { int *p2=p1; while(*++p1); return(p1-p2); } The output of the above program will be _____ . Assume that the object of data type $int$ occupies $2$ bytes.
Consider the following program segmentint main() { char *str = "GATECS"; printf("%d",madeeasy(str)); return 0; } int madeeasy(int *p1) { int *p2=p1; while(*++p1); return(...
1.2k
views
asked
Mar 10, 2018
Programming in C
programming-in-c
+
–
0
votes
1
answer
139
test series
613
views
asked
Mar 10, 2018
6
votes
1
answer
140
why completeness problem in case of DCFL is decidable, & it is undecidable in case of CFL?
2.8k
views
asked
Feb 15, 2018
Page:
« prev
1
2
3
4
5
6
7
8
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register