CSE131-Discrete Mathematics

• The course delivery plan for this course is:

Course Delivery Plan

• Topics cover in this course:

s1.1_propositional_logic

s1.2_propositional_equivalences

s1.3_predicates_quantifiers

s1.5_rules_inferences

s2.1_sets

s2.2_set_operations

s2.3_functions

s4.1_mathematical_induction

s8.1-3_relations_representations

s8.4_closures_relations

s8.6_partial_orderings

s9.1_graphs_and_models

s9.2_graph_bipartite

s9.2_graph_terminology

s9.3_graph_isomorphism

s9.3_representing_graphs

s9.4_connectivity

s9.5_Euler_Paths

s9.5_Hamilton_paths

s9.6_shortest_path_problems

s9.6_TSP

s10.1_introduction_trees

s10.3_tree_traversal

s10.4_spanning_tree

s10.5_minimum_spanning_trees

5_MST

Floyd-Warshall

• Book Reference:

Rosen_Discrete_Mathematics_and_Its_Applications_7th_Edition

** Some topics are cover only by white board.