Pune University IT Engineering Syllabus TE

Here I am searching for the Pune University Electronics and Telecommunication Engineering syllabus so please can some one provide me the syllabus and tell me that from where I can get the syllabus in PDF format?

[Pathak]

You required the Pune University IT Engineering Syllabus Te. We have uploading here a file which contains syllabus of Pune University IT Engineering. You can download it from here.

Can you provide me the Syllabus for T.E. (Information Technology) offered by Faculty of Engineering, Savitribai Phule Pune University?

[Neelu Bhasin]

The Syllabus for T.E. (Information Technology) offered by Faculty of Engineering, Savitribai Phule Pune University is as follows:


SEMESTER-I

UNIT – I FINITE STATE MACHINES 08 Hours
Basic Concepts: Symbols, Strings, Language, Formal Language, Natural Language. Basic Machine and Finite State Machine.
FSM without output: Definition and Construction-DFA, NFA, NFA with epsilon-Moves, Minimization Of FA, Equivalence of NFA and DFA, Conversion of NFA with epsilon moves to NFA, Conversion of NFA With epsilon moves to DFA.
FSM with output: Definition and Construction of Moore and Mealy Machines, Inter-conversion between Moore and Mealy Machines.


UNIT – II REGULAR EXPRESSIONS 08 Hours
Definition and Identities of Regular Expressions, Construction of Regular Expression of the given L, Construction of Language from the RE, Construction of FA from the given RE using direct method, Conversion of FA to RE using Arden’s Theorem, Pumping Lemma for RL, Closure properties of RLs, Applications of Regular Expressions.


UNIT – III CONTEXT FREE GRAMMAR AND LANGUAGES 08 Hours
Introduction, Formal Definition of Grammar, Notations, Derivation Process: Leftmost Derivation, Rightmost
Derivation, derivation trees, Context Free Languages, Ambiguous CFG, Removal of ambiguity, Simplification of
CFG, Normal Forms, Chomsky Hierarchy, Regular grammar, equivalence of RG(LRG and RLG) and FA.


UNIT IV PUSHDOWN AUTOMATA AND POST MACHINES 08 Hours
Push Down Automata: Introduction and Definition of PDA, Construction (Pictorial/ Transition diagram) of PDA, Instantaneous Description and ACCEPTANCE of CFL by empty stack and final state, Deterministic PDA Vs Nondeterministic PDA, Closure properties of CFLs, pumping lemma for CFL
Post Machine- Definition and construction



Syllabus T.E. (Information Technology) Savitribai Phule Pune University