V__ Embedded Application Development - UML 2.0, State charts, General language characteristics, MISRA C, Hardware/Software Co- design Hardware/software partitioning, Testing embedded systems, Design for festability and Self-test. References: 1. Embedded Systems Design ~ A Unified Hardware /Software Introduction, by Frank Vahid and Tony Givargis, John Wiley, 1999. 2. An Embedded Software Primer, by David E.Simon, Pearson Education Asia, 1999 THEORY OF AUTOMATA & FORMAL LANGUAGE (ACS505) bjective: The objective of this course is to provide basic definitions that ard sociated with theory of computation and to give an overview, applications; ;nvironment of computation. Unit Topic introduction: Alphabets, Strings and Languages, Automata and Grammars| homsky's classification. Finite Automata: Deterministic finite Automata (DFA): ‘ormal Definition, Simplified notation: State transition graph, Transition table| anguage of DFA, Nondeterministic finite Automata (NFA), NFA with ensior ransition, Language of NFA, Equivalence of NFA and DFA, Minimization of Finit Automata, Distinguishing one string from other, Myhill-Nerode Theorem, ‘egular Expression: Regular expression (RE), Definition, Operators of regula bres and their precedence, Algebraic laws for Regular expressions, leen’s Theorem, Regular expression to FA, DFA to Regular expression, Arden] Theorem, egular Languages and Its Properties: Non Regular Languages, Pumpin emma for regular Languages. Application of Pumping Lemma, Closur roperties of Regular Languages, Decision properties of Regular Languages,‘A with output: Moore and Mealy machine, Equivalence of Moore and Meal lachine, Applications and Limitation of FA. Ill Context free grammar (CFG) and Context Free Languages (CFL): Definition amples, Derivation, Derivation trees, Ambiguity in Grammer, Inherent mbiguity, Ambiguous to Unambiguous CFG, Useless symbols, Simplification of FGs, Normal forms for CFGs: CNF and GNF, Closure properties of CFLs, cision Properties of CFLs: Emptiness, Finiteness and Memership, Pumping Jemima for CFLs. IV Push Down Automata (PDA): Description and definition, ey on lescription, Language of PDA, Acceptance by Final state, Acceptance by emp tack, Deterministic PDA, Equivalence of PDA and CFG, CFG to PDA and PDA t FG, Two stack PDA. V_ [Turing machines (TM): Basic model, definition and representation instantaneous Description, Language acceptance by TM, Variants of Turing lachine, TM as Computer of Integer functions, Universal TM, Church's Thesis: cursive and Recursively Enumerable languages. Undecidability: Halting roblem, Introduction to Undecidability, Undecidable problems about TMs. Pos correspondence problem (PCP), Modified PCP, Introduction to recursive junction theory. References: 1. J Hopcroft, JD Ullman, R Motwani, Introduction to Automata Theory, Languages and Computation, Pearson, 2006 2. M Sipser, Introduction to the Theory of Computation, Thomson, 2006. DESIGN & ANALYSIS OF ALGORITHM LAB (acsss1) ENTS LIST OF EXPE Implementation of Quick Sort and Merge Sort. Implementation of Linear-time Sorting Algorithms. Implementation of Red-Black Tree operations. Implementation of Binomial Heap operations. eFeNo