The course provides an introduction to mathematical structures fundamentals of computer science. Topics discussed include logic of compound and quantified statements, number theory and methods of proof, sequences and mathematical induction, set theory, counting methods, functions, relations, and graph theory. The course lays down the mathematical formulation necessary for success in the computer science field.
Bachelor of Computer Science - 132 CRs
Susanna Epp, Discrete Mathematics with Applications, Thomson Learning.
| content serial | Description |
|---|---|
| 1 | Introduction and Logic form and logical equivalence |
| 2 | Conditional statements |
| 3 | Valid and invalid arguments |
| 4 | Predicates and quantified statements |
| 5 | Arguments with quantified statements |
| 6 | Methods of proof: Direct proof and counterexample part 1 |
| 7 | Methods of proof: Direct proof and counterexample part 2 |
| 8 | Methods of proof: Contraposition and contradiction |
| 9 | Sequences and mathematical induction |
| 10 | Counting part 1 |
| 11 | Counting part 2 |
| 12 | Functions |
| 13 | Composite Functions |
| 14 | Relations and elementary graph theory |
| 15 | Relations and elementary graph theory |
Start your application
