CS 170 Home Page
Discrete Structures I
Fall 2017
This course is an introduction to the topics in discrete mathematics that are of particular use in computing.
Discrete mathematics is especially concerned with counting techniques and finite or infinite sets of integers
(discrete numbers), instead of a continuous range of numbers (such as the real numbers used in calculus).
Topics to be covered include logic, sets, functions, simple proof techniques,
algorithms, counting techniques, basics of graphs and trees, finite state machines, parsing, and grammars.
Further Information
 Documents, homilies, and speeches of Pope Francis
 Course Syllabus
 Course Schedule
 Anita Borg Institute (women in technology)
 Order of Operations
 Education Technology web site by Texas Instruments
 Guidebooks for
Texas Instruments Calculators
 All Elementary Mathematics
See the algebra section
for mathematical induction, sequences, permutations and combinations, etc.
 The Probability Web: Teaching
Resources
This site has lots of links to resources on probability and statistics.
 The Math Forum: Discrete Mathematics
 National Curve Bank
 Example Prolog programs
Including tictac.pro.
 Discrete Mathematics
and Its Applications web site
The student center provides guides to writing proofs and common mistakes
in discrete mathematics, links to external Web sites, extra examples, selfassessment
on some key topics, and interactive demonstrations of important algorithms.
 Example proofs
 LearnSAT is a satisfiability solver for propositional logic formulas.
Although the SAT problem is NPcomplete, this and other SAT solvers are said to perform well.
 Parser Freeware and Examples
 Pope Francis condemns the attacks in Paris.

Help is Available
Note on Flu
Because of the possibility of the flu affecting us on campus, please practice good hand washing, etc.
If you get the flu, please notify me by phone or email and stay home for 24 hours after the fever has gone.
Check with me about what you miss. You will not be penalized for missing class in this situtation.
It is better to stay away from class and not spread the flu when you are ill.
Homework
Exams
 First Exam
 Oct 2
 Open book, open notes exam. Be sure to bring these as you will need to look up formulas, theorems, rules of logic, etc.
Only paper materials may be used.
 Your must bring a good calculator. You will need it to compute the numbers on the sum problems.
 Phones, computers, and other electronic devices cannot be used on the exam.
 Covers what we did in chapters 1 and 2.
 See the review packet and homework for a good idea of the types of problems.
 Second Exam
 Nov 6
 Open book, open notes exam. Anything on paper!
Be sure to bring at least the book and your notes as you will need to look up formulas, theorems, etc.
 Bring a calculator. You will need it to compute the numbers for some of the problems.
 Phones, computers, and other electronic devices cannot be used on the exam.
 Covers what we did in chapters 3, 4, 5, and 6.
 See the review packet and homework for a good idea of the types of problems.
 Final Exam:
 Wed, Dec 13, 8:30 am  10:30 am
 Open book, open notes exam. Be sure to bring these as you will need to look up formulas, theorems, etc.
 Bring a calculator. You will need it to compute the numbers for some of the problems.
 Phones, computers, and other electronic devices cannot be used on the exam.
 Covers what we did in chapters 7, 10, 11, and 13, as well as parsing.
Earlier topics might be used at least indirectly in some places.
 See the review packet and homework for a good idea of the types of problems.

