2024
29-06-2024
Formal Languages & Automata
3
Total Questions
कुल प्रश्न
2024
1 Paper
Papers Covered
कुल पेपर्स
1 Exam Years
1 परीक्षा वर्ष
2.5%
Exam Weightage
परीक्षा वेटेज
In 2024 Exam
2024 परीक्षा में
1 Type
Question Variety
प्रश्नों के प्रकार
MCQ (Single Correct)
Question Types:
प्रश्न प्रकार:
MCQ (Single Correct)
MCQ (एकल सही)
3
Previous Years Questions (PYQ) Statistics
विगत वर्षों के प्रश्न (PYQ) सांख्यिकी
Previous Years Questions (PYQ) Statistics विगत वर्षों के प्रश्न (PYQ) सांख्यिकी
Year-wise question count, paper frequency, and exam weightage percentage: वर्षवार प्रश्नों की संख्या, पेपर आवृत्ति और परीक्षा वेटेज प्रतिशत:
| Year वर्ष | Questions प्रश्न | Avg / Paper औसत / पेपर | Weightage & Trend वेटेज व ट्रेंड |
|---|---|---|---|
| 2024 | 3 Qs | 3.0 |
Questions in this Topic इस टॉपिक के प्रश्न
3 Questions 3 प्रश्न
1
2
3
Which of the following problems is undecidable?
Consider the context-free grammar $G$:
$$S \to aSb \mid X$$
$$X \to aX \mid Xb \mid a \mid b$$
where $S$ and $X$ are non-terminals, and $a, b$ are terminals. Starting non-terminal is $S$. Which statement is CORRECT?
Consider the Deterministic Finite Automata (DFA) on alphabet {0, 1} with states {s, p, q, r}, start state s and single final state p. Which regular expression describes the language accepted?
Official PYQ Papers
Previous Year Papers of Computer Application
Practice official shift-wise question papers with answer keys and detailed explanations on the actual exam pattern.
1
Total Available
Previous Papers