Register
Filter

Questions by Pranavpurkar

0 votes
0 answers
3
Test-Series
Consider the following language: $L$ $=$ { $<M>$ $|$ $L(M)$ has atleast $10$ strings } Which of the following is true about L? A)L is decidable B)L is Turing recognizable C)L is not recursive D)None of these
Consider the following language:$L$ $=$ { $<M>$ $|$ $L(M)$ has atleast $10$ strings }Which of the following is true about L?A)L is decidable ...
0 votes
0 answers
4
Test-Series
Consider the language given below: $L$ $=$ { $p$ $|$ $p$ $\neq$ $w$ $and$ $p$ $is$ $the$ $prefix$ $of$ $w$ $and$ $w$ $\epsilon$ {$0,1$}*} Which of following is true about L. A)L is CFL B)L is DCFL C)L is CSL D)L is regular
Consider the language given below:$L$ $=$ { $p$ $|$ $p$ $\neq$ $w$ $and$ $p$ $is$ $the$ $prefix$ $of$ $w$ $and$ $w$ $\epsilon$ {$0,1$}*}Which of following is true about ...
1 votes
1 answer
5
Test-Series
Consider the following language given below: I. L1= { $p^xq^y$ |; x,y >0 } II. L2 = {$p^xq^yp^z$ |$ x>y$ , $y\geq 0$ and $z>0$} Which of the following is true about L1 intersection L2 ? A)It is CSL B)It is CFL C)It is regular D)It is non regular
Consider the following language given below:I. L1= { $p^xq^y$ |; x,y >0 }II. L2 = {$p^xq^yp^z$ |$ x>y$ , $y\geq 0$ and $z>0$}Which of the following is true about L1 inter...
2 votes
1 answer
6
Test-Series
Consider the following language over $\sum$ = {0, 1} L = {w | w $\epsilon \sum$ * and |w| is divisible by 2 and not by 4} How many sates will min-DFA accepting L will have?
Consider the following language over $\sum$ = {0, 1}L = {w | w $\epsilon \sum$ * and |w| is divisible by 2 and not by 4}How many sates will min-DFA accepting L will have?...
0 votes
0 answers
7
unacademy test series
Consider a string is stored in a word addressable memory where each word is of 4 Bytes. If the string starts at 100 and ends at 104 then which of the following can be the possible string(s) that can be stored. A)STRUCTURE B)UNION C)POINTER D)FUNCTION
Consider a string is stored in a word addressable memory where each word is of 4 Bytes. If the string starts at 100 and ends at 104 then which of the following can be the...
1 votes
1 answer
8
DOUBT
DOUBT: suppose a memory space of 16B is given and it is asked that what is the maximum length of string it can store. then do we have to consider the space taken by the “\0” also? OR just the string length?
DOUBT:suppose a memory space of 16B is given and it is asked that what is the maximum length of string it can store.then do we have to consider the space taken by the �...
0 votes
0 answers
9
Doubt
DOUBT 1: if head = P → link. is performed then what will happen to the nodes containing values a and b? will they get removed as no link is pointing them? and we will left with only three nodes like DOUBT 2: what does head = (*P).link; equals to?
DOUBT 1: if head = P → link.is performed then what will happen to the nodes containing values a and b? will they get removed as no link is pointing them?and we will ...