Forwarded from Bond007
Given the following two statements:
L={w∣na(w)=nb(w)} is deterministic context free language, but not linear.
L={anbn}∪{anb2n} is linear, but not deterministic context free language.
Which of the following options is correct?
Both (A) and (B) are false.
Both (A) and (B) are true.
(A) is true, (B) is false.
(A) is false, (B) is true.
What is meaning of linear?
L={w∣na(w)=nb(w)} is deterministic context free language, but not linear.
L={anbn}∪{anb2n} is linear, but not deterministic context free language.
Which of the following options is correct?
Both (A) and (B) are false.
Both (A) and (B) are true.
(A) is true, (B) is false.
(A) is false, (B) is true.
What is meaning of linear?
Bond007
Given the following two statements: L={w∣na(w)=nb(w)} is deterministic context free language, but not linear. L={anbn}∪{anb2n} is linear, but not deterministic context free language. Which of the following options is correct? Both (A) and (B) are false.…
Telegram
Bond007 in Gate CSE (STAY AT HOME)
Given the following two statements:
L={w∣na(w)=nb(w)} is deterministic context free language, but not linear.
L={anbn}∪{anb2n} is linear, but not deterministic context free language.
Which of the following options is correct?
Both (A) and (B) are false.…
L={w∣na(w)=nb(w)} is deterministic context free language, but not linear.
L={anbn}∪{anb2n} is linear, but not deterministic context free language.
Which of the following options is correct?
Both (A) and (B) are false.…
Forwarded from MP
Consider database table R with 8 attributes A, B, C, D, E, F, G, H. What is the largest number of candidate keys that could simultaneously have given that ABC is already known to be a candidate key?
Computer Science quiz
Consider database table R with 8 attributes A, B, C, D, E, F, G, H. What is the largest number of candidate keys that could simultaneously have given that ABC is already known to be a candidate key?
Telegram
MP in Gate CSE (STAY AT HOME)
Consider database table R with 8 attributes A, B, C, D, E, F, G, H. What is the largest number of candidate keys that could simultaneously have given that ABC is already known to be a candidate key?
Forwarded from Disha
What will be the output of the following C code?
#include <stdio.h>
int *i;
int main()
{
if (i == 0)
printf("true\n");
return 0;
}
a) true
b) true only if NULL value is 0
c) Compile time error
d) Nothing
#include <stdio.h>
int *i;
int main()
{
if (i == 0)
printf("true\n");
return 0;
}
a) true
b) true only if NULL value is 0
c) Compile time error
d) Nothing
Disha
What will be the output of the following C code? #include <stdio.h> int *i; int main() { if (i == 0) printf("true\n"); return 0; } a) true b) true only if NULL value is 0 c) Compile time error d) Nothing
Telegram
Deepali Sharma in Gate CSE (STAY AT HOME)
What will be the output of the following C code?
#include <stdio.h>
int *i;
int main()
{
if (i == 0)
printf("true\n");
return 0;
}
a) true
b) true only if NULL value is 0
c) Compile time error
d) Nothing
#include <stdio.h>
int *i;
int main()
{
if (i == 0)
printf("true\n");
return 0;
}
a) true
b) true only if NULL value is 0
c) Compile time error
d) Nothing