Scribd
Upload
145 views1 page

Vel Tech CS8501 Exam Paper

This document is a continuous internal assessment test from Vel Tech High Tech Dr.Rangarajan Dr.Sakunthala Engineering College for the fifth semester Theory of Computation course. The test has three parts - Part A with 5 short answer questions worth 2 marks each, Part B with 2 long answer questions worth 13 marks each, and Part C with 1 long answer question worth 14 marks. The test aims to assess students on various concepts related to automata, regular expressions, finite state systems, pumping lemma for regular languages, proofs and finite automata modeling.

Uploaded by

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

Vel Tech CS8501 Exam Paper

This document is a continuous internal assessment test from Vel Tech High Tech Dr.Rangarajan Dr.Sakunthala Engineering College for the fifth semester Theory of Computation course. The test has three parts - Part A with 5 short answer questions worth 2 marks each, Part B with 2 long answer questions worth 13 marks each, and Part C with 1 long answer question worth 14 marks. The test aims to assess students on various concepts related to automata, regular expressions, finite state systems, pumping lemma for regular languages, proofs and finite automata modeling.

Uploaded by

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

Reg. No.

Vel Tech High Tech


Dr.Rangarajan Dr.Sakunthala Engineering College
An Autonomous Institution
CONTINUOUS INTERNAL ASSESSMENT- II
Fifth Semester
COMPUTER SCIENCE AND ENGINEERING
CS8501 – THEORY OF COMPUTATION
(Regulations 2017)
Date: 24.09.2022 Time: 90 Minutes Max. Marks: 50
CO1: Construct automata, regular expression for any pattern.
CO.No Tim
PART - A (5 x 2 = 10 Marks) K.No. Marks
. e
1. Define the following: a. Symbol b. String c. Language CO4 K2 2 3

2. What is relation? CO5 K2 2 3

3. What is finite state system? CO5 K2 2 3

4. What is Deterministic Finite Automata(DFA)? CO5 K2 2 3

5. Discuss pumping lemma for regular languages? CO5 K2 2 3

PART - B (2 x 13 = 26 Marks)
6. a) Construct a DFA that accepts input string of 0’s and 1’s that CO4 K2 13 25
end with 11.
1 1
q0 q1 q2

OR
b Discuss in detail about hypothesis and conclusion? CO4 K2 13 25
)

7. a) Discuss in detail about the theorem CO5 K2 13 25


If x is the sum of squares of four positive integers, then 2x ≥
x2
OR
b List the criteria for Reduction to definitions? CO5 K2 13 25
)

PART - C (1 x 14 = 14 Marks)
Note: Application/Design/Analysis/Evaluation/Creativity/Case Study questions.
8. a) Explain the additional forms of proof CO4 K3 14 25
1. Proof about sets
2. Proof by contradiction
OR
b Explain briefly the finite automation modeling recognition of CO5 K3 14 25
) “then”?

**********************************ALL THE BEST**********************************


K1 – Remember; K2 – Understand; K3 – Apply; K4 – Analyse; K5 – Evaluate; K6 - Create

With reference to NBA-SAR Guideline: Criteria No. 2.2.2

You might also like