Scribd
Upload
0 views2 pages

Toc 4

This document is a question paper for a Re-Major Test in the Theory of Computation course for B.Tech CSE students at Northcap University. It outlines the structure of the exam, including sections on regular expressions, Turing machines, and pushdown automata, with specific questions linked to course outcomes. The test is designed to assess students' understanding of computational theories and concepts over a duration of three hours for a maximum of 100 marks.

Uploaded by

Ad
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
0 views2 pages

Toc 4

This document is a question paper for a Re-Major Test in the Theory of Computation course for B.Tech CSE students at Northcap University. It outlines the structure of the exam, including sections on regular expressions, Turing machines, and pushdown automata, with specific questions linked to course outcomes. The test is designed to assess students' understanding of computational theories and concepts over a duration of three hours for a maximum of 100 marks.

Uploaded by

Ad
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/ 2

NCU/FRM/2.

6/ACAD/027
Review Date:

Question paper for Re-Major Test


School of Engineering and Technology
Session: (Jan-June)
THE
NORTHCАР Programme Name: B.Tech CSE
UNIVERSITY Course Name: Theory of Computation 8 JUN 2023 CE) Maximum Marks: 100
Duration: 3 hrs
Course Code: CSL 318
Sheet 1 of 2
Semester: Even (VIth)
Note:

1. All the questions are compulsory.


2. Marks and COs are indicated against the questions.
3. Calculator is not permitted.
CO1: Articulate the mathematical foundations of computation including automata theory.
CO2: Describe the notion related to formal languages and grammar.
CO3: Identify and Assess the concepts, design of pushdown automata.
CO4: Explain the concept of Turing machine and its working, design and applicability among students.
CO5: Understand the notions of algorithm, decidability, complexity, and computability

SECTION A (25 marks)

Question Marks CO's


Q. No.
5 CO1
QI. What is Regular Expression? Discuss closure properties of Regular
Expression in details.
Q2. Discuss Decidability, Partially Decidability and Undecidability in details. 5 CO5
5 C04
Q3. What is Turing Machine? Explain its formal definition and graphical
notation in details.

5 CO3
Q4. Design Pushdown Automata for the following Language:

L= a"b: n>m||n,m>=0|

example. 5 CO5
Q5. What do you mean by Halting problem? Explain with

SECTION B (55 marks)

Q6. a.
whether the given regular languages equivalent, 5+5 CO1
Check two are

whereΣ= {0,1}.
i. (0+1)1(0+1)
ii. (0+1)"(10+11 + 1)(0 + 1)
b. Write the regular expression of all strings starting with ab and ending
with ba.
Q7. 10 CO3
Convert the given grammar to CNF-

SaAD
AaB/bAB
Bb
Dd

Issued by: Approved by:


Date Date:
5+5+5 CO4
Q8. a. Design Turing machine for the following language:
L= {a"bc/m=2n+p and m,n,p>=0}
b. State distinction between finite automata and turing machine.
c. Outline an instantaneous description of a turing machine.

Q9. a. Design Pushdown Automata for the following language: 5+5 CO3

L= a"bc: n = p, n,m,p>=0|
b. Convert the following CFG into PDA:
L=ab": n/m||n,m>=0|
What is Grammar? Discuss formal definition of Grammar. 5+5 CO2
Q10. a.

b. Explain the difference between Type-0, Type-1, Type-2 and Type 3


Grammars.
SECTION C (20 marks)
OIL Explain Post Correspondence Problem. Show that post correspondence 10 CO5
problem with two lists: A= [aa, bb, abb] and B=[aab, ba, b] has a solution
or not. If yes, then write the solution.

Q12. Construct DFA for following languages: 5+5 CO1


L= WWends with aba, Σ a,b =

L=WW contains at least two a's and exactly one b, Σ= |a,b["|

Issued by: Approved by:


Date Date:

You might also like