1
GATE CSE 2022
MCQ (Single Correct Answer)
+1
-0.33

What is printed by the following ANSI C program?


 #include <stdio.h>
 int main(int argc, char *argv[]) {
    char a = 'P';
    char b = 'x';
    char c = (a & b) + '*';
    char d = (a | b) $$-$$ '$$-$$';
    char e = (a ^ b) + '+';
    printf("%c %c %c\n", c, d, e);
    return 0;
 }

ASCII encoding for relevant characters is given below :

GATE CSE 2022 Programming Languages - Basic of Programming Language Question 1 English

A
z K S
B
122 75 83
C
* $$-$$ +
D
P x +
2
GATE CSE 2022
MCQ (Single Correct Answer)
+1
-0.33

Which one of the following regular expressions correctly represents the language of the finite automation given below?

GATE CSE 2022 Theory of Computation - Finite Automata and Regular Language Question 2 English

A
ab*bab* + ba*aba*
B
(ab*b)* ab* + (ba*a)*ba*
C
(ab*b + ba*a)* (a* + b*)
D
(ba*a + ab*b)* (ab* + ba*)
3
GATE CSE 2022
MCQ (More than One Correct Answer)
+1
-0.33

Which of the following statements is/are TRUE?

A
Every subset of a recursively enumerable language is recursive.
B
If a language L and its complement $$\overline L $$ are both recursively enumerable, then L must be recursive.
C
Complement of a context-free language must be recursive.
D
If L1 and L2 are regular, then L1 $$\cap$$ L2 must be deterministic context-free.
4
GATE CSE 2022
MCQ (More than One Correct Answer)
+1
-0.33

Which of the following is/are undecidable?

A
Given two Turing machines M1 and M2, decide if L(M1) = L(M2).
B
Given a Turing machine M, decide if L(M) is regular.
C
Given a Turing machine M, decide if M accepts all strings.
D
Given a Turing machine M, decide if M takes more than 1073 steps on every string.
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12