General Class Information Class Handouts Scores Assignments Reference Materials Lecture Notes

CSc 144 Discrete Math for CS I Spring 2023 Lester I. McCann, Ph.D.

The University of Arizona College of Science Department of Computer Science McCann's Home Page

General Class Information

• Class syllabus (general course information)
• Class Discussions and Announcements (<---- Click here!) We're using Piazza for class discussions this semester.
• Some thoughts about exams:
  • Characteristics of Good Exam Answers (suggestions on how to reply to short-answer exam questions)
  • Suggestions for Studying For and Taking Exams (what to do before and during an exam)

Class Handouts       (In case you lost your copy, or missed class)

• Syllabus Summary (2023-01-11) Be sure to see the full version of the syllabus, linked above!
• The Page O' Logical Equivalences (2023-02-01)
• Demonstrating Logical Equivalences Without Truth Tables (2023-02-11; online only)
• A Sample Version of Exam #1 (online only):
  • The Questions (2023-02-11)
  • The Answers (2023-02-15)
• Definitions to know for Exam #1 (2023-02-08)
• Direct Proof Examples (2023-03-14; online only)
• Definitions to know for Exam #2 (2023-03-14)
• 'Contra' Proof Examples (2023-04-14, online only)
• Definitions to know for Exam #3 (2023-04-17)
• Basic Counting Problems Flowchart (2023-04-17)
• Definitions Since Exam #3 (2023-05-01)

Final Course Grades       (Updated after each exam has been graded)

• Final Grades (Updated: 2023-05-07 11:00 a.m.)

Assignments

• Homework #1 Due: 2023-01-27
• Homework #2 Due: 2023-02-03
• Homework #3 Due: 2023-02-10
• Practice Homework #1 "Due": 2023-02-14/15 (in SI sessions)
• Homework #4 Due: 2023-03-03
• Homework #5 Due: 2023-03-17
• Practice Homework #2 "Due": 2023-03-21/22 (in SI sessions)
• Homework #6 Due: 2023-04-07
• Homework #7 Due: 2023-04-14
  • Quick-'n'-Dirty Prolog Tutorial (PDF)
  • The GNU Prolog Manual (HTML)
  • On D2L, in the Content / Class Assignments area: A half-hour video on using SSH/PuTTY, nano, gprolog, and turnin
  • family.pl - the Prolog example used in class and the tutorial.
• Practice Homework #3 "Due": 2023-04-18/19 (in SI sessions)
> Practice Homework #4 "Due": 2022-05-02/03 (in SI sessions)

Reference Materials       (Pointers to additional information)

• The text for this semester is Discrete Mathematics and Its Applications, 8th ed., by Kenneth H. Rosen, 2019. Do not buy an international edition or an earlier edition! The D2L Inclusive Access ebook price is the best deal I know.
• You might also wish to consider purchasing the companion Student Solutions Guide, which offers detailed solutions to the text's odd-numbered end-of-section exercises.
• Kneel Before Z^odd is a draft of several chapters (and an appendix) that I've written to cover my lecture material through roughly the first half of the old CSc 245 course. Much of it is also applicable to this class.
  • Access info is available on Piazza.
  • Please read the Appendix (Math Review) before the end of the first week of class, to review what we expect (hope?) that you already know.
  • Prefer to access the chapters individually? Here are links to separate PDF files for each chapter (and the appendix):
    • Chapter 1: Logic
    • Chapter 2: Quantified Expressions
    • Chapter 3: Logical Arguments
    • Chapter 4: Direct Proofs
    • Chapter 5: Indirect ("Contra") Proofs
    • Chapter 6: Additional Set Concepts
    • Chapter 7: Matrices
    • Chapter 8: Relations
    • Appendix A: Math Review
• There are some other online textbooks that cover parts of the material in this class:
  • Connecting Discrete Mathematics and Computer Science by David Liben-Nowell. This is a pre-print version of an upcoming textbook.
  • "Book of Proof" by Richard Hammack. The name's a bit misleading; it covers a good amount of the material for a discrete structures course, including proofs.
  • An Active Introduction to Discrete Mathematics and Algorithms by Charles A. Cusack. A discrete math text based on parts of another author's writings.
  • Introduction to Higher Mathematics by Patrick Keef and David Guichard. Logic, proofs, functions, and relations, plus some number theory, 'cause ... why not?
  • How To Write Proofs by Larry W. Cusick. And that's what it covers.
• LaTeX resources:
  • I've got a resource page for LaTeX for those of you who would like to use it for formatting your answers to homework assignments. (Last updated: August 2017)
  • Don't want to install LaTeX on your computer? Try Overleaf, a free (for personal use) online LaTeX editor.
  • Want help formatting equations in LaTeX? You might like this tool: LaTeX equation demo by MyScript

Miscellaneous       (A place for stuff that doesn't really fit anywhere else)

• Academic Dishonesty Quiz Slides How well do you know the UA Code of Academic Integrity? Probably not as well as you should. Try this quiz to find out!
• CS2013's Curriculum Guidelines for Undergradate CS Programs A joint work of the ACM and the IEEE Computer Society. Discrete Structures starts on page 76. Want an idea of how important this material is? 41 hours of lecture material is listed; exactly none of it is optional.
• Collection of Common CS Service Links (Account application, compute CSID, etc.) You'll need to supply your NetID for access.

Lectures, Slides, and Notes

• Completed Lecture Slides. I will be posting my annotated lecture slides soon after the end of each class.
  
  
  • Click here to access the completed lecture slides.


• Guided Notes. What follows are links to the 'guided notes' (the yet-to-be-completed slides) for the class. The idea is that you can print these and write your notes on them during lecture. These are formatted as PDFs with two slides per page, for ease of printing and to leave plenty of space for your notes.
  
  
  • Topic 1: Background
  • Topic 2: Logic
  • Topic 3: Quantifiers
  • Topic 4: Arguments
  • Topic 5: Direct Proofs of p -> q
  • Topic 6: Additional Set Concepts
  • Topic 7: Relations
  • Topic 8: Functions
  • Topic 9: Indirect (``Contra'') Proofs of p -> q
  • Topic 10: Integers
  • Topic 11: Sequences and Strings
  • Topic 12: Methods of Counting
  • Topic 13: Finite Probability (Incomplete! I'll be augmenting this set on-the-fly.)

  ---

  Return to Ol' Doc McCann's Home Page
  
  If you have any comments about this page, drop me a note at mccannl@acm.org