MOHAMED SATHAK A.J.

COLLEGE OF ENGINEERING
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
M.E [COMPUTER SCIENCE AND ENGINEERING] I YEAR / I SEMESTER
CP7201 THEORETICAL FOUNDATIONS OF COMPUTER SCIENCE
LESSON PLAN

UNIT II LOGIC AND LOGIC PROGRAMMING

SL.
NO

TOPIC SYLLABUS

1.

PROPOSOTIONAL LOGIC SYNTAX

2.

INTERPRETATIONS AND MODELS

3.

DEDUCTION THEOREMS

4.

NORMAL FORMS

5.

INFERENCE RULES

6.

SAT SOLVERS

7.

PREDICATE LOGIC SYNTAX

8.

PROOF THEORY

CONTENT
FORMULAE AND
PROBLEM ASSIGNMENT
I,II
THEORY
DIRECT PROOFS,
INDIRECT PROOFS,
CONDITIONAL PROOFS
TESTING OF VALIDITY OF
ARGUMENTS.
PROBLEMS
FORMULAE, RULES &
THEOREMS
THEORY DEFINITION
THEORY, PROOF
DEDUCTIONS
RULES OF
INFERENCE,PROOF
DEDUCTIONS
SYMBOLIZE GIVEN
PREDICATE LOGIC

ASSIGNMENT

REFERENCE
TEXT BOOK
REF 1,2

I & II

REF 3

REF 3
REF 3
Davis Putnam
Procedure

REF 1,2
REF 1,2

II

REF 3

10
.

SEMANTICS OF PREDICTAE
LOGIC
UNDECIDABILITY OF PREDICATE
LOGIC

11
.

INFERENCES IN FIRST ORDER

LOGIC

RULES OF INFERENCE,
PROOFS , TESTING OF
VALIDITY OF
ARGUMENTS

LOGIC PROGRAMMING

DEFINITION

REF 1,2

DEFINITE PROGRAMS

THEORY

REF 1,2

SLD RESOLUTION

DEFINITION OF
RESOLUTION
PRINCIPLES, PROBLEMS
ON SLD DERIVATIONS

NORMAL PROGRAMS

DEFINITION

REF 1,2

SLDNF RESOLUTION

THEORY, THEOREMS

REF 1,2

INTRODUCTION TO PROLOG

PROGRAM SYNTAX,
LOGIC, PROGRAMMING
EXAMPLES

DAVIS PUTNAM PROCEDURE

Satisfiability problem

9.

12
.
13
.
14
.
15
.
16
.
17
.
18
.
19
.

REF 1,2

THEORY, THEOREMS *Refer to Unit V Decidability

II

Derivations
Logic
programming
in Prolog

Prolog Facts
and rules
Variable
ordering,
OBDD,ROBDD

REF 1,2

REF 1,2

REF 1,2
REF 1,2

BINARY DECISION TREE

Binary decision diagrams
REF 1,2
DIAGRAMS
for logic gate
REFERENCE TEXTBOOK: 1. Kenneth H. Rosen, Discrete Mathematics and its applications,
Seventh Edition, Tata McGraw Hill, 2011.
2. M. Huth and M. Ryan, Logic in Computer Science Modeling and Reasoning about systems,
Second Edition, Cambridge University Press, 2004.

1 Mrs. G. Jayanthi, B.E(CSE).,M. Tech(Remote Sensing).,AP, MSAJCE

MOHAMED SATHAK A.J. COLLEGE OF ENGINEERING

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
M.E [COMPUTER SCIENCE AND ENGINEERING] I YEAR / I SEMESTER
CP7201 THEORETICAL FOUNDATIONS OF COMPUTER SCIENCE
LESSON PLAN

3. Dr. Veerarajan, Discrete Mathematics,Tata Mac Graw Hill (for problems only).
UNIT V STATE MACHINES
SL.
NO

TOPIC - SYLLABUS

1.
2.

LANGUAGES
GRAMMAR

3.

FINITE STATE
MACHINES

4.
5.

STATE MACHINES
REGULAR LANGUAGES

6.

REGULAR EXPRESSION

7.

REGULAR GRAMMAR

8.

CONTEXT FREE
GRAMMAR

9.

TURING MACHINE

10
.

COMPLEXITY

11
.

COMPUTABILITY

12
.
13
.

CONTENT
Definition Classification Examples Problems
Definition Classification Examples - Problems
Finite Automata Mathematical formal definition
Transition function Transition tables
Transition diagrams Examples , problems
NFA DFA Basic difference, problems
Definition Regular sets Examples
Mathematical Formulation Definitions
Examples Problems. NFA to Regular
expression, Regular languages.
NFA DFA conversions, NFA - moves to NFA
without, DFA to Regular grammar. Language
generated by grammar.
Definition Mathematical Formulation
Production rules Derivation Parse tree
Ambiguity.
Mathematical formulation Construction of TM
Problems. DTM, NDTM
Polynomial time complexity analysis Big Oh,
Omega Theta Notations Complexity classes
P class, NP class, NP Complete class , NP
hard, Tractable, Intractable Examples. Boolean
satisfiability Cooks Theorem.

DECIDABILITY

Properties of languages and proof

CHURCH THESIS

Definition Theory.

ASSIGNMENT

TEXT
BOOK/
WEBSITE
REF1,2,3

I
REF 2

II,III

REF 1,2

IV

REF1, 2
REF2

Analysis of
algorithm
Complexity

THEOREMS

REF2,3

Lecture
Notes

TEXTBOOK FOR REFERENCES :

1.

John. C. Martin, Introduction to Formal Languages and The theory of Computation,Tata

Mac Graw Hill.

2.

Hopcroft Aho, Ullman

3.

Lewis

2 Mrs. G. Jayanthi, B.E(CSE).,M. Tech(Remote Sensing).,AP, MSAJCE

MOHAMED SATHAK A.J. COLLEGE OF ENGINEERING

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
M.E [COMPUTER SCIENCE AND ENGINEERING] I YEAR / I SEMESTER
CP7201 THEORETICAL FOUNDATIONS OF COMPUTER SCIENCE
LESSON PLAN

THEOREM STATEMENTS TO BE COVERED IN UNIT V STATE MACHINES

1.

Every

2.

Myhill Nerode Theorem

3.

3 Mrs. G. Jayanthi, B.E(CSE).,M. Tech(Remote Sensing).,AP, MSAJCE

MOHAMED SATHAK A.J. COLLEGE OF ENGINEERING

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
M.E [COMPUTER SCIENCE AND ENGINEERING] I YEAR / I SEMESTER
CP7201 THEORETICAL FOUNDATIONS OF COMPUTER SCIENCE
LESSON PLAN

UNIT III LAMBDA CALCULUS AND FUNCIONAL PROGRAMMING

SL.
NO
1.
2.
3.
4.
5.
6.
7.
8.
9.
10
.
11
.
12
.
13
.
14
.

TOPIC SYLLABUS
Lambda notation for functions
Syntax
curried functions
parametric polymorphism
lambda reduction
alpha reduction
beta reduction
beta abstraction
extensionality
theorem

CONTENT

ASSIGNMENT

TEXT BOOK/
WEBSITE

Meaning of mathematical language,

free and bound variable,
representation of

Class work,
REF1

Problems on evaluation of lambda

calculus, Formal definitions

REF1

delta reduction
reduction strategies
normal forms Church-Rosser
Theorems

Normal order, Applicative order

reduction Call by name, call by vale.
Abstract tree.

Pure lambda calculus

Constants, arithmetic, conditionals,

Iteration, recursion.

introduction to functional
programming

LISP, HASKEL, SCHEME, ML (LISP

covered fully)

REF1
Problem solved
in class

Reference Text book:

1. Greg Michaelson, An introduction to functional programming through lambda
calculus, Dover Publications, 2011.
2.

4 Mrs. G. Jayanthi, B.E(CSE).,M. Tech(Remote Sensing).,AP, MSAJCE

Class work
Slide: 28-414.ppt,
other .ppt
files