1 votes
0 answers
42
1 votes
0 answers
43
3 votes
1 answer
44
The minimum number of states needed for DFA of langauge L is ________.
1 votes
0 answers
45
explain why L1 and L3 are not cfl
1 votes
0 answers
46
Consider the following CFG : s->0s0|1s1|0|1|epsilon For the above CFG, the total number of strings generated whose length is less than or equal to 7 [exclude the empty st...
1 votes
0 answers
47
second one is regular how first one is regular
1 votes
0 answers
48
1 votes
0 answers
49
Consider the following statements:S1: For any two sets A and B, if A is uncountably infinite and B is countably infinite, then A ∩ B iscountably infinite.S2: For any tw...
2 votes
1 answer
51
1 votes
0 answers
52
Merge sort using a linked list is efficient compared to array in terms of space complexity.plz explain
1 votes
0 answers
53
Consider a sorted array of integers, we have to implement the function Max( ) with input ‘x’, which find the maximum element present in array which is smaller than or...
1 votes
0 answers
55
How many enqueue and dequeue operations are required to perform a pop operation if Q1 contains n elements initially?
1 votes
0 answers
57
Cthe number of additions performed by above code?A 8000B 4000C 4020D 28420
2 votes
0 answers
58
1 votes
1 answer
59
2 votes
1 answer
60
A 4-ary i.e., either has 0 children or has 4 children tree has 20 leaf nodes. Then the total number of nodes in the tree are ________.