Welcome to Discrete Mathematics!
Instructor: Dr. Vaide Narvaez
Schedule: Tuesday and Thursday 8:30am-10am
A study and introduction to the mathematical concepts of sets, logic, relations, functions, combinatorics, graph theory and Boolean algebra. This course will be applicable to those studying computer science and technology.
Discrete mathematics involves the kind of mathematics which arises when one tries to model real world problems in a form which can be numerically analyzed by a computer. The mathematical tools which will be studied in this course form the basis of a methodology known as mathematical modeling. The aim of this course is to acquire these mathematical tools and be able to apply them to simple forms of mathematical modeling.
Course Syllabus and Material
|1-3||1||The Foundations: Logic and Proofs||Exercise sheet|
Assignment1 (due 24/11/09)
|5||3||The growth of functions|
|6-7||4||Induction and recursion|
|9||6||Discrete Probability||Assignment 2 (due 26.01.2010)|
|12-13||9||Graphs||Assignment 3 (due 18.02.2010)|
|15||–||Course Review||Review Exercises|
- James Rosen, Kenneth H. Discrete Mathematics and it’s Applications: McGraw-Hill, 2003
Supplementary reading materials
- Wayne Haggarty, Rod. Discrete Mathematics for Computing: Pearson Education, 2002