PROFESSOR/ CONTACT: 
Lucia Moura, Office: STE 5027 email: lucia@site.uottawa.ca (Your email message must have in the subject line "CSI2101 <student full name>" or it may not be read) Office hours: regular office hours discontinued (see below) WEB PAGE: http://www.site.uottawa.ca/~lucia/courses/210111/ 

LINKS/INFO: 


LECTURES/TUTORIALS: 
Lec1 Tuesdays 2:304:00 (LPR 155) TUT Tuesdays 4:005:30 (LMX 106)  tutorials are mandatory Lec2 Fridays 4:005:30 (LPR 155) 

POLICIES: 
You are responsible for reading the course's policies on plagiarism, remarking, late assignments and missed midterm. Any mass communication with the class is going to be posted under News/Announcements check regularly. 

TEXTBOOK: 
Kenneth H. Rosen, Discrete Mathematics and Its Applications, Sixth Edition, McGraw Hill, 2007. 

CALENDAR DESCRIPTION 
CSI2101 Discrete Structures (3,1.5,0) 3 cr. Discrete structures as they apply to computer science, algorithm analysis and design. Predicate logic. Review of proof techniques; application of induction to computing problems. Graph theory applications in information technology. Program correctness, preconditions, postconditions and invariants. Analysis of recursive programs using recurrence relations. Properties of integers and basic cryptographical applications. Prerequisite: MAT1348. 

COURSE OBJECTIVES 
Discrete mathematics and structures form the very foundation for computer science, and are essential in every branch of computing. In MAT1348 (discrete mathematics for computing) you have been introduced to fundamental problems and objects in discrete mathematics. In CSI2101 (discrete structures) you will learn more advanced concepts in this area, and at the same time increase your knowledge of how to apply them to various types of problems in computing. While learning how to analyse an algorithm, prove the correctness of a program, model a network problem with graphs or use number theory in cryptography, you will be sharpening your mathematical skills by practicing problem solving, modeling, logical reasoning and writing precise proofs. 

COURSE OUTLINE 


MARKING SCHEME: 
Final Grade (G): if (0.25*M + 0.50*F)/0.75 < 50% then G=(0.25*M + 0.50*F)/0.75 if (0.25*M + 0.50*F)/0.75>= 50% then G=0.25*M + 0.50*F + 0.25*A 

IMPORTANT DATES: 
Assignment (currently tentative) due dates:



