CS 261 - Mathematical Foundations of Computer Science
University of New Mexico Computer Science Department
Summer 2005

Taught by:
Joel Castellanos
FEC 319
e-mail joel@cs.unm.edu


Course Description and Syllabus:

Lecture Notes:

Chapter 1: Fundamentals (Sets, Sequences, Properties of Integers and Matrices)
Chapter 2: Logic (Rules of Inference, Indirect Method of Proof, Proof by Contradiction, and Induction)
Chapter 3: Counting (Permutations, Combinations, Pigeonhole Principle, Probability, Converting linear homogeneous recurrence relations of degree 2 to explicit formulas)


Sample Tests:

Pretest of prerequisite material
Chapter 1 Quiz: Fundamentals
Chapter 2 Quiz: Logic

Java Algorithms:

The applet below finds the Greatest Common Divisor for a pair of positive integers.
The source code (gcd.java) includes comments describing the methods. The source also serves as template for a GUI program that read input fields from text boxes, calls different functions by responding to button clicks, and displays output in a scrolling text area.

gcd will appear below in a Java enabled browser.