VEDA VYASA INSTITUTE OF TECHNOLOGY

KARADPARAMBA P.O.MALAPPURAM DIST

LESSON PLAN Course and branch: Third year B-Tech (Semester 6). Computer Science & Engineering Subject: CS09-601 Embedded Systems
Note: Each theory class duration is 1hour.This lesson plan is prepared based on the time allotted by the university in the syllabus (52 hours).Therefore neither this schedule nor the sequence of conducting theory classes should be changed. faculty taking the class should record the date of conducting the class in the class taken on column and affix their signature in the signature of faculty column of this lesson plan respectively immediately after taking the theory class.

Lecturer in charge: SHIJA V Class no 01 & 02 &03 04 05 06 07&08 09&10 11&12 13 14 15 16 17 18 19 Cartesian products Relation Relation matrices Properties of relations Composition of relations MODULE II (13 HOURS) Relational structures Subject to be taught Embedded systems: Overview, Design challengesOptimizing design metrics,Common design metrics

Year of admn:2009 Class Signature of faculty taken on

Processor technology-General purpose processors,Single purpose processors and Application specific processors. IC technology:Full custom/VLSI,Semi-custom ASIC, Compilation/Synthesis,libraries/IP,Test/Verification

20&21 22&23 24 25 26

Equivalence relations and partitions Functions-one -to-one-Onto functions Composition of functions-inverse functions Partial orders Hasse diagrams Module III (13 hours)

27 28 29 30&31 32 33&34

Group theory-Definition Elementary properties Cyclic groups Homomorphism-Isomorphisms Subgroups Cosets and lagrange's theorem

35 36&37 38&39 Elements of coding theory Hamming metric-Generator matrices Group codes-Haming matrices Module IV (13 hours) 41&42 43&44 45 46&47 48&49 50,51&5 2 Recurrence Relations - Introduction Linear recurrence relations with constant coefficients Homogeneous solutions Particular solutions Total solutions Generating Function solutions of recurrence relations by the method of generating functions.

Text Books

1. Ralph P Grimaldi, Discrete and Combinatorial Mathematics: An applied introduction (Fourth Edition), Pearson Education, 2004. Reference Books 1. Thomas Koshy, Discrete Mathematics with Applications, Academic Press/Elsevier, 2005 2. Tremblay, J P & Manohar,R, Discrete and Mathematical Structures with Applications to Computer Science, McGraw Hill Book Company. 3. Kolman B & Busby R C, Discrete and Mathematical Structures for Computer Science, Prentice Hall of India. 4. C.L. Liu, Elements of Discrete Mathematics, Tata McGraw Hill, 2002 5. Donald F Stanat & David F McAllister, Discrete and Mathematical Structures in Computer Science, Prentice Hall. 6. Truss J K, Discrete Mathematics for Computer Scientists, Pearson Education, 2001. \