This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: ECE 190: Discrete Mathematics – Fall 2006 General Information This course is an introduction to discrete mathematics and its applications in electrical and computer en- gineering. Mathematical reasoning and methods of proof will be emphasized. Topics covered in the course include: sets, logic, relations, functions, proofs, permutations, combinations, discrete probability, recurrence relations, graphs, and trees. Students are expected to attend three lectures, one recitation, and one tutorial per week. The formal course material will be presented in the lectures. Various worked examples will be presented in the recitations. The smaller recitation class size is intended to encourage greater opportunities for questions and discussion of the course material. Homework will be assigned each week and taken up during the tutorial. Homework will not be graded; however, a ten-minute quiz covering the homework (with questions that are either directly from the homework or closely related to it) will be administered each week. Instructors Name E-mail Web Phone J. Carter [email protected] www.ecf.utoronto.ca/ ∼ jcarter/ 416-946-5209 P. Papakonstantinou [email protected] www.cs.utoronto.ca/ ∼ papakons/ 416-978-4299 If you need to talk to an instructor, you may do so without an appointment during their office hours, shown...
View Full Document
This note was uploaded on 04/19/2008 for the course ECE 190 taught by Professor Carter during the Fall '06 term at University of Toronto.
- Fall '06