(3 hours of lectures per week, 1.5 hours of dicussion group per week, 3 credits)

Instructor:

Professor: WonSook LEE. CBY A509 (tel x2501), wslee@uottawa.ca, http://www.eecs.uottawa.ca/~wslee

Professor's office hours:

TBD

TAs and office hours:

TBD

Timetable:

Section	Activity	Day	Location	Professor
CSI2101 A00 (January 08 - April 11)	LEC	Wednesday 8:30 - 10:00	FSS 1007	Wonsook Lee
CSI2101 A00 (January 08 - April 11)	LEC	Monday 10:00 - 11:30	MRT 212	Wonsook Lee

Section	Activity	Day	Location	Professor
CSI2101 A01 (January 08 - April 11)	DGD	Tuesday 17:30 - 19:00	STE C0136	Wonsook Lee

Section	Activity	Day	Location	Professor
CSI2101 A02 (January 08 - April 11)	DGD	Tuesday 17:30 - 19:00	UCU 205	Wonsook Lee

Course schedule for the term: 2018 Winter Term

Section	Activity	Day	Location	Professor
CSI2101 B00 (January 08 - April 11)	LEC	Friday 8:30 - 10:00	MRT 212	Wonsook Lee
CSI2101 B00 (January 08 - April 11)	LEC	Wednesday 10:00 - 11:30	MRT 212	Wonsook Lee

Section	Activity	Day	Location	Professor
CSI2101 B01 (January 08 - April 11)	DGD	Thursday 17:30 - 19:00	MRT 219	Wonsook Lee

Section	Activity	Day	Location	Professor
CSI2101 B02 (January 08 - April 11)	DGD	Thursday 17:30 - 19:00	LPR 285	Wonsook Lee

Description:

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.

Textbook:

Kenneth H. Rosen, Discrete Mathematics and Its Applications,Seventh Edition

course notes (blackboard learn)

Recommended References:

Marking scheme:

Assignments (A) 25 %
Midterm exam (M) 25 %
Final exam (F) 50 %

NOTE I: To pass the course you must get at least 50% in the average of the two exams
(0.25*M + 0.50*F)/0.75 >= 50%

NOTE II: A student who has an official medical certificate (from the University Health Services) for the absence on the day of the midterm will have the final exam mark scaled up accordingly.

Topics (Tentative):

Review of Propositional Logic (Chapters 1.1-1.3)
Predicates and Quantifiers (Chapters 1.4-1.5)
Rules of Inference, Proofs – Methods and Strategies (Chapters 1.6-1.8)
Basic Number Theory and applications (Chapters 4.1-4.6)
Mathematical Induction (Chapters 5.1-5.3)
Program Correctness/Verification and Recursive Algorithms (Chapters 5.4-5.5)
Solving Recurrence Relations (Chapters 8.2-8.3)
Graphs (Chapters 10)

CSI 2101:DISCRETE STRUCTURES