Scribd
Upload
22 views1 page

Final Theory of Automata CS09305

The document outlines the final-term examination details for the Theory of Automata course at The University of Lahore, Sargodha Campus, including instructions, question formats, and marks distribution. It consists of short questions worth 18 marks and long questions worth 22 marks, covering topics such as Turing machines, Pushdown Automata, and Context-Free Grammars. The exam is scheduled for August 5, 2024, with a maximum duration of 2 hours and 30 minutes.

Uploaded by

urwakhan413
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views1 page

Final Theory of Automata CS09305

The document outlines the final-term examination details for the Theory of Automata course at The University of Lahore, Sargodha Campus, including instructions, question formats, and marks distribution. It consists of short questions worth 18 marks and long questions worth 22 marks, covering topics such as Turing machines, Pushdown Automata, and Context-Free Grammars. The exam is scheduled for August 5, 2024, with a maximum duration of 2 hours and 30 minutes.

Uploaded by

urwakhan413
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Department of Computer Science

Final-Term Examination (W-2024)


The University of Lahore, Sargodha Campus.
Instructor Name: Yasir Ghayor Malik
Program-Semester: BSCS-4rth
Subject: Theory of Automata
Course Code: CS09305
Maximum Marks: 40
Maximum time: 2 hours and 30 minutes
Date: 05/08/2024
*******************************************************************************
Please read instructions before attempting the paper.

1. Please make sure your admit card is attached with the answer sheet at the end of exam.
2. Read all the questions carefully before starting paper.
3. All Answers should be written on the answer sheet.
4. No extra time will be given to any candidate other than exceptional situations. Cheating and use of unfair
means during exam are strictly prohibited. In case of this situation, the exam invigilator is authorized to stop
the candidate from carrying on the exam and officially report such a case to the unfair means committee via
examination office for further necessary action.

----------------------------------------------------------------------------------------------------------------------------------
Question No. 1 Short Questions. (Total: 6*3=18)
1. What are real life examples of theory of automata?
2. Provide a seven-tuple definition of a Turing machine.
3. Define a Pushdown Automaton and describe its components.
4. What does CFL stand for, and provide a short explanation of Context-Free Languages (CFLs)?
5. What are the differences between Moore and Mealy machines?
6. In which phases of compiler construction are Deterministic Finite Automata (DFA) and Context-Free
Grammars (CFG) used?

Question No. 2 Long Questions. (Total: 22)


1. Briefly explain the concept of a Finite State Machine (FSM) and describe the basic operations of a Virtual
Machine (VM). (6)
n 2n
2. Construct Pushdown automata for L = {a b | n ≥ 0}. (6)
n 3n
3. Design a Turing machine for the given language L = a b ; n>0. (6)
4. Construct a Context-Free Grammar (CFG) for generating palindromes. (4)

Page 1

You might also like