======CS203: Discrete Mathematics ======
This course will provide an introduction to mathematics oriented toward computer science and engineering.

=====Class timings=====
  * Wednesday - 1500-1600
  * Thursday - 1600-1700
  * Friday  - 1700-1800


=====TAs=====

| Sandeep Kumar Patel | Shashadhar Das |

=====Books=====
  * //Discrete Mathematics and Its Applications with Combinatorics and Graph Theory// by Kenneth Rosen
  * //Concrete Mathematics// by  Ronald Graham, Donald Knuth, Oren Patashnik
=====Slides=====
^ Topics ^ Slides  ^    ^    ^    ^    ^    ^
| Propositional Logic: Introduction | {{ :courses:2022:cs203:cs203_01_propositional_logic.pdf |pdf}}  |
| Propositional Logic: Deduction | {{ :courses:2022:cs203:cs203_02_propositional_logic_deduction.pdf |pdf}}  |
| Predicate Logic: Introduction | {{ :courses:2022:cs203:cs203_03_predicate_logic_intro.pdf |pdf}}  |
| Predicate Logic: Fundamentals | {{ :courses:2022:cs203:cs203_04_predicatelogic_fundamentals.pdf |pdf}}  |
| Predicate Logic: Resolution Refutation | {{ :courses:2022:cs203:cs203_05_resolution_refutation.pdf |pdf}}  |
| Proof techniques | {{ :courses:2022:cs203:cs203_06_prooftechniques.pdf |pdf}}  |
| Sets | {{ :courses:2022:cs203:cs203_07_sets.pdf |pdf}}  |
| Relations | {{ :courses:2022:cs203:cs203_08_relation.pdf |pdf}}  |
| Mathematical induction | {{ :courses:2022:cs203:cs203_09_induction.pdf |pdf}}  |
| Recursion | NA  |
| Summation | NA  |
| Integer functions | NA  |
| Generating functions | NA  |
| Counting | {{ :courses:2022:cs203:cs203_11_counting.pdf |pdf}}  |
| Graphs-I | {{ :courses:2022:cs203:cs203_12_graph_i.pdf |pdf}}  |
| Graphs-II | {{ :courses:2022:cs203:cs203_13_graphs_ii.pdf |pdf}}  |
| Trees | {{ :courses:2022:cs203:cs203_14_trees.pdf |pdf}}  |
| Planar graph | {{ :courses:2022:cs203:cs203_15_planar_graph.pdf |pdf}}  |