Home » Syllabus » KTU » KTU B.Tech S5 Syllabus Computer Science

KTU B.Tech S5 Syllabus Computer Science

KTU B.Tech S5 Syllabus Computer Science

clickhereCS301 THEORY OF COMPUTATION

Download

clickhereCS303 SYSTEM SOFTWARE

Download

clickhereCS305 Microprocessors and Microcontrollers

Download

clickhereCS307 Data Communication

Download

clickhereCS309 Graph Theory and Combinatorics

Download

clickhereCS341 Design Project [Elective]

Download

clickhereCS331 System Software Lab

Download

clickhereCS333 Application Software Development Lab   

Download

clickhereCS361 Soft Computing [Elective] 

Download

clickhereCS363 Signals and Systems[Elective]

Download

clickhereCS365 Optimization Techniques[Elective]

Download

clickhereCS367 Logic for Computer Science[Elective]

Download

clickhereCS369 Digital System Testing & Testable Design[Elective] 

Download

KTU B.Tech S5 Syllabus Computer Science

CS 301: THEORY OF COMPUTATION

MODULE I

Introduction to Automata Theory and its significance.

Type 3 Formalism: Finite state automata – Properties of transition functions, Designing finite automata, NFA, Finite Automata with Epsilon Transitions, Equivalence of XFA and DFA, Conversion ol NFA to DFA, Equivalence and Conversion of NFA with and without Epsilon Transitions.

MODULE II

Myhill-Nerode Theorem, Minimal State FA Computation. Finite State Machines with Output Mealy and Moore machine (Design Only), Two. Way Finite Automata. Regular Grammar, Regular Expressions, Equivalence of regular expressions and NFA with epsilon transitions. Converting Regular Expressions to NFA with epsilon transitions Equivalence of DFA and regular expressions, converting DFA to Regular Expressions.

FIRST INTERNAL EXAMINATION

MODULE III

Pumping Lemma for Regular Languages, Applications of Pumping Lemma. Closure Properties

of Regular sets (Proofs not required), Decision Problems related with Type 3 Formalism

Type 2 Formalism:- Context-Free Languages (CFL), Context Free Grammar (CFG), Derivation trees,   Ambiguity. Simplification of CFG. Chomsky Normal Form. Greibach normal forms.

 

x

Check Also

KTU B.Tech S5 Syllabus Civil Engineering

KTU B.Tech S5 Syllabus Civil Engineering CE301 Design of Concrete Structures      ...

KTU B.Tech S5 Syllabus Electronics & Communication

KTU B.Tech S5 Syllabus Electronics & Communication   EC 301 Digital Signal ...