# Discrete Mathematics (3140708)

5
Credit
3 + 2 + 0
Lect + Tuto + Pract
Teaching Scheme
70 + 30 + 0
ESE + PA + ALA
Theory Marks
0 + 0 + 0
ESE + OEP + PA
Practical Marks
###### ESE - End Semester Examination, PA - Progress Assessment, ALA - Active Learning Assignments, OEP -Open Ended Problem

Prerequisite
Algebra, Logic
Rationale
This course introduces the basic concepts of discrete mathematics in the field of computer science. It covers sets, logic, 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 Outcome
Sr. Co Statement Marks % weightage
1 Understand the basic principles of sets and operations in sets and apply counting principles to determine probabilities, domain and range of a function, identify one-to- one functions, perform the composition of functions and apply the properties of functions to application problems. 12
2 Write an argument using logical notation and determine if the argument is or is not valid. To simplify and evaluate basic logic statements including compound statements, implications, inverses, converses, and contra positives using truth tables and the properties of logic. To express a logic sentence in terms of predicates, quantifiers, and logical connectives. 13
3 Apply relations and to determine their properties. Be familiar with recurrence relations 25
4 Use the properties of algebraic structures. 25
5 Interpret different traversal methods for trees and graphs. Model problems in Computer Science using graphs and trees. 25

Active Learning
NPTEL Discrete Mathematics lectures