CS 310-0: MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE

CS 310-0
MATHEMATICAL FOUNDATIONS
OF COMPUTER SCIENCE

Miguel A. Lerma - Spring 2005

Section 20

MWF 1:00 pm - TECH M120

T 1:00 pm - TECH M164

courses/cs310-05s/

This is the web page for CS 310, Spring 2005.
Consult it often for announcements, homework assignments and possible changes to the syllabus.

Index

Announcements
Course description and learning goals
Teachers
- Instructor
- Teaching Assistant
Class Logistic
Lectures and Homework Assignments
Related links
List of Grades

Announcements

Final Exam: Friday, June 10th, 2005, 9-11am in TECH M120. Whole syllabus.

Course Description

725-310-0 Mathematical Foundations of Computer Science

Fundamental concepts and tools in discreet mathematics with emphasis on their applications to computer science. Topics include logic and Boolean circuits; sets, functions, relations, databases, and finite automata: deterministic algorithms, randomized algorithms, and analysis techniques based on counting methods and recurrence equations; trees and more general graphs. Prerequisites: 725-110 or 725-111 and 435-214-3. Prerequisite for: 725-322, 725-332, 725-339, 725-343, 725-351.

Learning Goals

At the end of the course, the student should be able to formulate logic expressions for a variety of applications; convert a logic expression into a Boolean circuit, and vice versa; design relational databases; design finite automata to recognize string patterns; apply, adapt, and design elementary deterministic and randomized algorithms to solve computational problems; analyze the running time of non-recursive algorithms with loops by means of counting; analyze the running time of divide-and-conquer recursive algorithms by means of recurrence equations; and use trees and graphs to formulate computational problems.

Teachers

	Instructor	Teaching Assistant
Name	Miguel A. Lerma	David Feng
Office	Lunt 203	N/A
Phone	1-8020	N/A
E-mail	mlerma at math dot northwestern dot edu	d-feng@northwestern.edu
Office Hours	by appointment in Lunt 203	TH 12-2pm in Tech Express
Teaching in	TECH M120	TECH M164
Code	N.A.	TBA

Class Logistics

Textbooks
Keneth H. Rosen: Discrete Mathematics and Its Applications, Fifth Edition, 2003, McGraw-Hill.
Miguel A. Lerma: Notes on Discrete Mathematics. (See bellow.)
Problem Sessions
The problem sessions will be held on Tuesdays under the TA's supervision.
Homework
The homework assignments will be posted on this web page.
Exams
There will be one one-hour Midterm Exam and one two-hour Final Exam.
- Midterm: Wednesday, May 4rd, 2005, 1:00-1:50pm in TECH M120
- Final: Friday, June 10th, 2005, 9:00-11:00am in TECH M120
No make-up exams will be given. In the event of an extreme and well documented absence (such as hospitalization) the final may be weighted to count for the missing exam. In the case of a missed exam, contact the instructor as soon as possible.
Grading
The course will be graded as follows:
- Homework Assignments: 30%
- Midterm: 30%
- Final: 40%
The lowest homework score will be dropped in calculating the homework grade.
Add/Drop Policy
If you want to change sections, or add/drop the course, please do so at the CS Department Office.

Lectures and Homework Assignments

Note: I am going to be releasing notes ("Notes on Discrete Mathematics", in PDF format) that you can download by clicking in the links of the "subject" column of the syllabus bellow. The introduction is in here:

Introduction

Depending on various circumstances, the schedule shown bellow may experiment small modifications.

The "sections" listed on the 4th column are from Rosen's book.

The "Suggested Exercises" column contains some exercises from the book that you may find useful to try. They are not homework nor need to be turned in.

The appendix is here.

The complete set of notes is here. However I do not recommend to download the whole set until the end of the quarter, since I may still make some changes to the notes.