Register
Filter

Answers by manikantsharma

0 votes
2
selfdoubt
if concatenation of two languages $L_1\ and\ L_2(L_1.L_2)$ is regular then what can we say about $L_1\ and\ L_2 $ ?? is there any possibility of $L_1=nonregular\ ,\ L_2=nonregular \ $ ??
if concatenation of two languages $L_1\ and\ L_2(L_1.L_2)$ is regular then what can we say about $L_1\ and\ L_2 $ ??is there any possibility of $L_1=nonregular\ ,\ L_2=...
7 votes
5
GATE CSE 1996 | Question: 2.8
If $L_1$ and $L_2$ are context free languages and $R$ a regular set, one of the languages below is not necessarily a context free language. Which one? $L_1.L_2$ $L_1 \cap L_2$ $L_1 \cap R$ $L_1 \cup L_2$
If $L_1$ and $L_2$ are context free languages and $R$ a regular set, one of the languages below is not necessarily a context free language. Which one?$L_1.L_2$$L_1 \cap L...
0 votes
6
GATE CSE 1995 | Question: 2.20
Which of the following definitions below generate the same language as $L$, where $L=\{x^ny^n \text{ such that } n\geq 1 \}$? $E \rightarrow xEy\mid xy$ $x y \mid (x^+xyy^+$) $x^+y^+$ I only I and II II and III II only
Which of the following definitions below generate the same language as $L$, where $L=\{x^ny^n \text{ such that } n\geq 1 \}$?$E \rightarrow xEy\mid xy$$x y \mid (x^+xyy^+...
0 votes
7
GATE CSE 1992 | Question: 02,xix
Context-free languages are: closed under union closed under complementation closed under intersection closed under Kleene closure
Context-free languages are:closed under unionclosed under complementationclosed under intersectionclosed under Kleene closure
0 votes
8
GATE CSE 1987 | Question: 2k
State whether the following statements are TRUE or FALSE: The intersection of two CFL's is also a CFL.
State whether the following statements are TRUE or FALSE:The intersection of two CFL's is also a CFL.
0 votes
9
GATE CSE 1996 | Question: 2.23
Consider the following state table for a sequential machine. The number of states in the minimized machine will be ... $4$ $3$ $2$ $1$
Consider the following state table for a sequential machine. The number of states in the minimized machine will be$$\begin{array}{|l|l|ll|}\hline \text{} & \text{} & \tex...
0 votes
10
GATE CSE 2003 | Question: 14
The regular expression $0^*(10^*)^*$ denotes the same set as $(1^*0)^*1^*$ $0+(0+10)^*$ $(0+1)^*10(0+1)^*$ None of the above
The regular expression $0^*(10^*)^*$ denotes the same set as$(1^*0)^*1^*$$0+(0+10)^*$$(0+1)^*10(0+1)^*$None of the above
0 votes
11
GATE CSE 2000 | Question: 1.4
Let $S$ and $T$ be languages over $\Sigma=\{a,b\}$ represented by the regular expressions $(a+b^*)^*$ and $(a+b)^*$, respectively. Which of the following is true? $S \subset T$ $T \subset S$ $S = T$ $S \cap T = \phi$
Let $S$ and $T$ be languages over $\Sigma=\{a,b\}$ represented by the regular expressions $(a+b^*)^*$ and $(a+b)^*$, respectively. Which of the following is true?$S \subs...
1 votes
14
Grammar
Can set of terminal be empty in a grammar? Is epsilon (null string) counted as a terminal symbol?
Can set of terminal be empty in a grammar? Is epsilon (null string) counted as a terminal symbol?
0 votes
15
GATE CSE 2016 Set 1 | Question: 24
Which one of the following protocols is NOT used to resolve one form of address to another one? $\textsf{DNS}$ $\textsf{ARP}$ $\textsf{DHCP}$ $\textsf{RARP}$
Which one of the following protocols is NOT used to resolve one form of address to another one?$\textsf{DNS}$$\textsf{ARP}$$\textsf{DHCP}$$\textsf{RARP}$
0 votes
16
Fragmentation
Fragmentation is done by Network layer or Transport Layer ?
Fragmentation is done by Network layer or Transport Layer ?
0 votes
17
#TCP/IP
What is the maximum size of data that the Network layer can forward to the Data link layer including header data? Should it be 65535B or 1500B?
What is the maximum size of data that the Network layer can forward to the Data link layer including header data? Should it be 65535B or 1500B?
0 votes
19
GATE CSE 2000 | Question: 1.16
Aliasing in the context of programming languages refers to multiple variables having the same memory location multiple variables having the same value multiple variables having the same identifier multiple uses of the same variable
Aliasing in the context of programming languages refers tomultiple variables having the same memory locationmultiple variables having the same valuemultiple variables hav...
0 votes
23
ISRO2020-57
The hardware implementation which provides mutual exclusion is Semaphores Test and set instructions Both options None of the options
The hardware implementation which provides mutual exclusion isSemaphoresTest and set instructionsBoth optionsNone of the options
0 votes
25
GATE CSE 2017 Set 2 | Question: 19
Consider the following tables $T1$ and $T2.$ ... delete record $\langle 3, 8 \rangle$ from the table $T1,$ the number of additional records that need to be deleted from table $T1$ is _______
Consider the following tables $T1$ and $T2.$$$\overset{T1}{\begin{array}{|c|c|c|} \hline \textbf {P} & \textbf {Q} \\\hline \text {2} & \text{2 }\\\hline \text{3} & \te...
1 votes
26
GATE CSE 1998 | Question: 1.19
Which of the following addressing modes permits relocation without any change whatsoever in the code? Indirect addressing Indexed addressing Base register addressing PC relative addressing
Which of the following addressing modes permits relocation without any change whatsoever in the code?Indirect addressingIndexed addressingBase register addressingPC relat...
0 votes
27
GATE CSE 1996 | Question: 1.16, ISRO2016-42
Relative mode of addressing is most relevant to writing: Co – routines Position – independent code Shareable code Interrupt Handlers
Relative mode of addressing is most relevant to writing:Co – routinesPosition – independent codeShareable codeInterrupt Handlers
0 votes
28
Addressing Mode
"The Address Part of the Index Addressing mode Instruction must set to zero,to behave like Register Indirect Mode Instruction" IS IT A VALID STATEMENT ?
"The Address Part of the Index Addressing mode Instruction must set to zero,to behave like Register Indirect Mode Instruction"IS IT A VALID STATEMENT ?
3 votes
29
GATE CSE 2020 | Question: 20
If there are $m$ input lines and $n$ output lines for a decoder that is used to uniquely address a byte addressable $1$ KB RAM, then the minimum value of $m+n$ is ________ .
If there are $m$ input lines and $n$ output lines for a decoder that is used to uniquely address a byte addressable $1$ KB RAM, then the minimum value of $m+n$ is _______...
Page: