CMPSC 26: Foundations of Computer Science


GOAL

This course reviews sets and formal logic, and introduces combinatorics; these topics are fundamental to various areas of computer science. The topics we cover are applied only in subsequent computer science courses.
Prerequisites
Math 8.
Meetings
Lecture: Tuesday and Thursday, 11:00 - 12:15, PHELPS 1408
Discussion: Wednesday, 5:00 - 5:50, ENGR 1132
Discussion: Friday, 1:00 - 1:50, PHELPS 1408
Syllabus
Foundations
Sets and operations on sets; relations and functions; fundamentals of logic; logical inferences; proving an implication; basic 1st-order logic; rules of inference for quantified propositions; mathematical induction.
Elementary Combinatorics
The 2 basic counting principles; arrangements and selections; arrangements and selections with repetition; distributions; binomial and multinomial coefficients; inclusion-exclusion principle; generating function models; recurrence relation models.
Grades
The grade distribution is determined by the undergraduates. If the class finishes with at least 25 people, then the average final grade of the undergraduates will be between 2.4 and 2.6. Keep your graded work, and verify our grade spread sheet.


	ITEM             % OF GRADE   DATE
	Home works (3)   30           April 18, May 9, and May 30
	1st Mid-quarter  20           Tuesday, April 25, in class
	2nd Mid-quarter  20           Tuesday, May 16, in class
	Final            30           Tuesday, June 13, noon - 3

Homeworks and Examinations
All examinations are closed-book. There is no make-up for a missed examination unless it is pre-arranged. There are no exceptions to these rules.
Since the Discussion sections are on Wednesdays and Fridays, I have decided to have the homework due on Tuesdays, at 11:10 in class. Homeworks submitted after that time receive a grade of 0. This is partly because I do not want you to do homework in class, or miss class to do your homework. Homework solutions are discussed during the Discussion sections. Written solutions are placed in the Reserve Book Room of the Library.
Text
Joe L. Mott, Abraham Kandel, and Theodore P. Baker. Discrete Mathematics for Computer Scientists and Mathematicians, 2nd edition, Reston Publishing Company, Inc., Reston, VA 1986.
Notes
Run on request at the Associated Students Notetaking Service.
Personnel
Pete Cappello (cappello@cs.ucsb.edu); Office hours: Tuesdays 1:30 - 2:30, Thursdays, 10 - 11, ENGR 2157, and by appointment.
Lane K. Mangum (lane@cs.ucsb.edu); Office hours: Tuesday and Thursday, 1:00 - 2:30, Trailer 380, Rm 101c.
Richard Ross (ross@cs.ucsb.edu); Office hours: Monday 9-10am, Wednesday 9-11am, Trailer 380, Rm 101c.

Last modified: Sun Apr 2 15:43:09 PDT 1995 by Pete Cappello