WELCOME!

Services

WELCOME
welcome to my website by KARTHICKRAJA.thank u for visiting...வருகைக்கு நன்றி.|Krtamilanz இந்த BLOG யை நான் 2013 நவம்பர் 5 ல் துவங்கிய நோக்கமே நான் படித்த ,கேட்ட ,தெரிந்த விஷ​யங்கள் நீங்களும் அறியவேண்டும் என்ற நல்லெண்ண நோக்கமே தவிர வேறதும்மில்லை.இதில் வரும் சில பதிவுகள் இணையதளத்தில் இருந்தும், சில பதிவுகள் கேட்டவை ,படித்தவை , சில நானே தொகுத்தவை.௭ன்றும் அன்புடன் உங்கள் கார்த்திக்ராஜா...

Bookmark This Site



Latest News Study According to your Internal Marks, Pass Semester Exam!!

Important Services
Drop Down MenusCSS Drop Down MenuPure CSS Dropdown Menu

Ad

info Links

entireweb

Thursday 16 July 2015

MA6566 DISCRETE MATHMATICS syllabus

ANNA UNIVERSITY CSE SYLLABUS
5TH SEM CSE
REGULATION 2013
OBJECTIVES:
To extend student’s Logical and Mathematical maturity and ability to deal with abstraction and to introduce most of the basic terminologies used in computer science courses and application of ideas to solve practical problems.

UNIT I LOGIC AND PROOFS
Propositional Logic – Propositional equivalences - Predicates and Quantifiers – Nested Quantifiers – Rules of inference - Introduction to proofs – Proof methods and strategy.

UNIT II COMBINATORICS
Mathematical induction – Strong induction and well ordering – The basics of counting – The
pigeonhole principle – Permutations and combinations – Recurrence relations – Solving linear recurrence relations – Generating functions – Inclusion and exclusion principle and its applications.

UNIT III GRAPHS
Graphs and graph models – Graph terminology and special types of graphs – Matrix representation of graphs and graph isomorphism – Connectivity – Euler and Hamilton paths.

UNIT IV ALGEBRAIC STRUCTURES
Algebraic systems – Semi groups and monoids - Groups – Subgroups – Homomorphism’s – Normal subgroup and cosets – Lagrange’s theorem – Definitions and examples of Rings and Fields.

UNIT V LATTICES AND BOOLEAN ALGEBRA
Partial ordering – Posets – Lattices as posets – Properties of lattices - Lattices as algebraic systems – Sub lattices – Direct product and homomorphism – Some special lattices – Boolean algebra.

TOTAL (L: 45+T:15): 60 PERIODS

OUTCOMES:
At the end of the course, students would:
Have knowledge of the concepts needed to test the logic of a program.
Have an understanding in identifying structures on many levels.
Be aware of a class of functions which transform a finite set into another finite set which relates to input and output functions in computer science.
Be aware of the counting principles.
Be exposed to concepts and properties of algebraic structures such as groups, rings and fields.

TEXT BOOKS:
1. Kenneth H.Rosen, "Discrete Mathematics and its Applications", 7 th Edition, Tata Mc Graw Hill Pub. Co. Ltd., New Delhi, Special Indian Edition, 2011.
2. Tremblay J.P. and Manohar R, "Discrete Mathematical Structures with Applications to Computer Science", Tata Mc Graw Hill Pub. Co. Ltd, New Delhi, 30th Reprint, 2011.

REFERENCES:
1. Ralph.P.Grimaldi., "Discrete and Combinatorial Mathematics: An Applied Introduction", 4th Edition, Pearson Education Asia, Delhi, 2007.
2. Thomas Koshy., "Discrete Mathematics with Applications", Elsevier Publications, 2006.
3. Seymour Lipschutz and Mark Lipson., "Discrete Mathematics", Schaum’s Outlines, Tata Mc Graw Hill Pub. Co. Ltd., New Delhi, 3 rd Edition, 2010.

No comments :

Post a Comment

Related Posts Plugin for WordPress, Blogger...