Discrete Mathematics detail syllabus for Computer Science & Engineering (Cse), 2017 regulation is taken from Anna University official website and presented for students of Anna University. The details of the course are: course code (MA8351), Category (BS), Contact Periods/week (4), Teaching hours/week (4), Practical Hours/week (0). The total course credits are given in combined syllabus.
For all other cse 3rd sem syllabus for be 2017 regulation anna univ you can visit Cse 3rd Sem syllabus for BE 2017 regulation Anna Univ Subjects. The detail syllabus for discrete mathematics is as follows.”
Course Objective:
- To extend students logical and mathematical maturity and ability to deal with abstraction.
- To introduce most of the basic terminologies used in computer science courses and application of ideas to solve practical problems.
- To understand the basic concepts of combinatorics and graph theory.
- To familiarize the applications of algebraic structures.
- To understand the concepts and significance of lattices and boolean algebra which are widely used in computer science and engineering.
Unit I
For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.
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
For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.
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.
Course Outcome:
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:
- Rosen, K.H., “Discrete Mathematics and its Applications”, 7th Edition, Tata McGraw Hill Pub. Co. Ltd., New Delhi, Special Indian Edition, 2011.
- Tremblay, J.P. and Manohar.R, ” Discrete Mathematical Structures with Applications to Computer Science”, Tata McGraw Hill Pub. Co. Ltd, New Delhi, 30th Reprint, 2011.
References:
- Grimaldi, R.P. “Discrete and Combinatorial Mathematics: An Applied Introduction”, 4th Edition, Pearson Education Asia, Delhi, 2007.
- Lipschutz, S. and Mark Lipson., “Discrete Mathematics”, Schaums Outlines, Tata McGraw Hill Pub. Co. Ltd., New Delhi, 3rd Edition, 2010.
- Koshy, T. “Discrete Mathematics with Applications”, Elsevier Publications, 2006.
For detail syllabus of all other subjects of BE Cse, 2017 regulation do visit Cse 3rd Sem syllabus for 2017 Regulation.
Dont forget to download iStudy for latest syllabus and results, class timetable and more.