Course Summary:

This course introduces the applications of discrete mathematics in the field of computer science. It covers sets, logic, proving techniques, combinatorics, functions, relations, graph theory and algebraic structures. These basic concepts of sets, logic functions and graph theory are applied to Boolean Algebra and logic networks, while the advanced concepts of functions and algebraic structures are applied to finite state machines and coding theory.

Course Objectives:

The objective of this course is to 

• Apply formal mathematical, logical reasoning techniques and basic counting techniques to solve a variety of problems.

• Apply algorithms to problems including searching algorithms, base conversion algorithms in the design and analysis of other algorithms, computability theory, software engineering, and computer systems.

• To solve discrete probability problems sets in combinatorics and probability theory to media applications.

• Apply Graph and Tree.

Week 01 - Chapter 1: The Foundations: Logic and Proofs 

1. Discrete Mathematics and its Applications, 8th Edition by Rosen, K.H.

2. Schaum's outline of discrete mathematics by Lipschutz S., Lipson M. [3rd Edition]

3. Elements of Discrete Mathematics, 2nd Edition by C. L. Liu.

4. Discrete Mathematics- Veerarajan.T;  McGraw-Hill Education, Year: 2018

5. Elements of Discrete Mathematics by Richard Hammack ; Virginia Commonwealth University

1. https://www.geeksforgeeks.org/discrete-mathematics-tutorial/

2. https://discrete.openmathbooks.org/dmoi3/ch_intro.html

3. https://nptel.ac.in/courses/106108227

4. https://nptel.ac.in/courses/106103205

5. https://nptel.ac.in/courses/111106086

6. https://nptel.ac.in/courses/111107058

7. Slide : https://highered.mheducation.com/sites/0073383090/student_view0/lecture_powerpoint_slides.html