2 votes
2
Consider the language given below:L={P!=w | P is prefix of w and w <-{0,1}*}Which is TRUE about L?A.L is CFLB.L is DCFLC.L is CSL CORRECT ANSWERD.L is regular
1 votes
4
CFG is not closed under complementation , but REC is?
1 votes
5
M is a Turing Machine and M is the only Turing Machine that accepts L(M) is decidable. TRUE/FALSE
5 votes
8
Could anyone please explain various tricks to find out wheather the given context free Grammar is ambiguous or not in an easier way?
3 votes
10
Consider the following programint find (int n) { int a = 1; for (i = 1; i < = n; i ++) for (j = 1; j < = i; j++) for (k = 1; k <= j, k++) a = a + 1; ...
3 votes
12
The minimum number of productions required to produce a language consisting of palindrome strings over ∑={a,b} with a single variable is______.
7 votes
13
How many ‘n’ state FA are possible with ‘m’ symbols with –(i) Designated initial state(ii) With designated initial and final state(iii) With no designated initi...
2 votes
17
Which of the following is not a stable sorting algorithms ? Insertion sortSelection sort Bubble sortMerge sort
3 votes
18
Which open addressing technique is free from clustering problems ? Linear Probing Quadratic Probing Double hashing Rehashing
2 votes
19
Consider the relations:$R_{1}${Roll_No, Name, Grades} and $R_{2}${Roll_No, Subject_ID, Grades}Which of the following operations cannot be performed using the above relati...
2 votes
20
Worst Case scenario in case of linear search algorithm is_______________.Item is somewhere in the middle of the arrayItem is not in the array at allItem is the last eleme...
3 votes
21
Total number of nodes at the nth level of a full binary tree can be given as___________. 2n + 1$2n^{2}$2^n2n – 1
6 votes
22
#include <stdio.h>int main(){ static int i = 6; if( i) { main(); printf("%d", i+1); } return 0;}Please explain the output of this program ?
5 votes
24
2 votes
25
what is the decimal equivalent of ${{(1221)}}_{3}$${{(50)}}_{10}$${{(53)}}_{10}$${{(52)}}_{10}$${{(51)}}_{10}$