HOME | CSCI 1710 | CSCI 1900 | CSCI 2150 | CSCI 2910 | CSCI 4717 | CSCI 4956 | CSCI 5011 | RESEARCH

Class Notes

Last semester, most of the lectures were done in PowerPoint with some success. If a lecture is available in PowerPoint, it will be posted here.

As for additional course notes, there will be none. We feel comfortable with the textbook selected for this course (Discrete Mathematical Structures, 5th ed., by Kolman, Busby, and Ross). If, however, the time comes when additional notes are necessary, links to them will be added here. It will be announced in class or through an e-mail from the Blackboard system if you need to visit this page to get those notes.

All of these documents are in either HTML or PDF format. If you do not have a copy of the Adobe Acrobat Viewer for the PDF files, download the free copy from their web site.


Reading Topic Reference to Assigned Reading
Section 1.1 Sets and Subsets
Section 1.2 Operations on Sets
Section 1.3 Sequences
Section 1.4 Integers
Section 1.5 Matrices Sorry, but there won't be any PowerPoint notes for this lecture. Formatting matrices to PowerPoint was just too messy.

Section 2.1

 Logical Operations
Section 2.2 Conditional Statements
Section 2.3 Methods of Proof
Section 2.4 Mathematical Induction Mathematical induction requires the understanding of a single concept, one not worthy of its own PowerPoint presentation. Therefore, our discussion will focus on doing exercises from the book.
Section 3.1 Permutations
Section 3.2 Combinations
Section 3.3 Pigeonhole Principle Slides are not available yet.
Section 3.4 Probability
Sections 4.1 and 4.2 Relations
Sections 4.4 and 4.5 Properties of relations
Section 5.1 Functions
Sections 5.2 and 5.3 Complexity
Section 7.1 Trees
Section 7.2 Labeled Trees
Section 7.3 Searching Trees

Section 7.5

 Minimal Spanning Trees

Sections 8.1 and 10.3

 Graphs and finite state machines

[ News ] [ Syllabus ] [ Notes ] [ Exercises ] [ Test aids ] [ Blackboard ] [ Other links ]