CSE 143 DISCRETE MATHEMATICS

3 Hours/Week, 3 Credits

Set, relations Functions: Set, Function, Representing Relations, Equivalence Relations Propositional Calculus: Propositions, Predicate and Quantifier, Algorithms: Complexity, Divisions, Algorithm, Application of Number Theory Recursion: Sequences and summations, Recursive Definition and algorithm Combinatorial Analysis: Permutation and Combination, Divide and Conquer Algorithms, Generating Functions Graphs: Representation, Isomorphism, Connectivity, Euler and Hamilton path, Shortest path, Planer, Coloring Boolean Algebra: Number System, Boolean Function, representing Boolean Function, Logic gate, Minimization of Circuits