← Back to Home

Discrete Structures for Computer Science

CS 0441. Fall 2022, Term 2231

This webpage is no longer maintained, and serves only archival purposes

Course Description

Welcome to CS 0441, Discrete Structures for Computer Science, for the Fall 2022 term!Co-Requisite: MATH 0220 or 0230 or 0235 or 0140 or 0221 or 0231 (Minimum grade C or Transfer)

The purpose of this course is to understand and use (abstract) discrete structures that are backbones of computer science. In particular, this class is meant to introduce logic, proofs, sets, relations, functions, counting, and probability, with an emphasis on applications in computer science. This course satisfies one of the core course requirements for computer science majors/minors

This page will provide any information for the class that I go over in recitation. Please check back for updates regularly, especially if you miss a recitation.

Recitation Information

Most up-to-date information is on Canvas CRN: 17064Accompanies professor Donald Bonidie’s lecture section 1090 which meets Tue/Thu, 4:30–5:45pm at 5502 Sennott Square
Meets: Fridays 4:00 PM at 501 Information Science Building
Course Textbook: Kenneth H. Rosen. Discrete Mathematics and Its Applications, 8th Edition, McGraw Hill. A copy of the text is required for homework.


TA Information

TA: Shinwoo Kim
E-mail: shinwookim@pitt.edu
Home Page: https://sites.pitt.edu/~shk148
TA Office Hours (See Canvas)

Note when E-mailing:


Student Feedback

Please send me your anonymous feedback


Schedule

Click the date for annoucement slides and see footnotes for important recitation information.

# Date/Slides Topic Handout Important Announcements
1 09/02/2022 No Recitation
First Week of Class
-  
2 09/09/2022 Homework #1 - Zoom Recitation (Link on Canvas).
Homework 1 Due: 09/12/2022 11:59 PM ET
3 09/16/2022 Chapter 1.1 & 1.2 Review Problems[1]
Solutions
 
4 09/23/2022 Homework #2 - Homework 2 Due: 09/24/2022 11:59 PM ET
5 09/30/2022 Homework #3 - Homework 3 Due: 10/06/2022 11:59 PM ET
6 10/07/2022 Mid-Term Prep (Common Mistakes)[2]
Proof Practice
(Chapter 1.7)[3]
Problems[1]
Solutions
Homework 4 Due: 10/12/2022 11:59 PM ET
Homework 5 Due: 10/19/2022 11:59 PM ET
7 10/14/2022 No Recitation
Fall Break
- MID-TERM EXAM: 10/19/2022 (During Lecture)
Reference Sheet Due: 10/17/2022 11:59 PM ET
8 10/21/2022 Principle of Mathematical Induction[4] Slides  
9 10/28/2022 Homework #6 - Homework 6 Due: 11/04/2022 11:59 PM ET
10 11/04/2022 Homework #6 - Homework 6 Due: 11/04/2022 11:59 PM ET
11 11/11/2022 Chapter 6 Review/Homework 7 Problems[1]
Solutions
Homework 7 Due: 11/19/2022 11:59 PM ET
12 11/18/2022 Homework 7 - Homework 7 Due: 11/19/2022 11:59 PM ET
13 11/25/2022 No Recitation
Thanksgiving Break
-  
14 12/02/2022 Homework 8 - Homework 8 Due: 12/09/2022 11:59 PM ET
FINAL EXAM DURING LAST LECTURE
15 12/09/2022 No Recitation
(Final) Office Hours
- Last Day for Undergraduate Class
NO MORE OFFICE HOURS PAST THIS POINT

[1] Select problems from Text (© McGraw Hill)

[2] See slides for Common Mistakes in chapter 1, and full document on course Discord

[3] Majority of students voted to spend more time working with Proofs (Chapter 1.7). Thus, we will not be coveing HW#4, HW#5 during recitation. If you have questions, please come to Office Hours.

[4] Induction will not be on the exam, but is a useful concept (that is often covered in a discrete math course) to know for future courses. See Chapter 5 of the text for more details.


Tips for Success

If you want to do well in any course, the bare minimum is attending all lectures and doing all homework assignments.

Dylan Feehan, PittCS Wiki

Pitt CS Wiki: How to Succeed in CS0441: Discrete Structures for Computer Science

Getting Help

We expect that all students will need help at some point in this course. If you find yourself needing help, this is not cause for embarrassment: it is completely expected, and our goal is to ensure that you are able to receive the help you need. A good rule of thumb is that if you spend an hour on the assignment without making any progress, seek help! Please be sure to seek help early and often through any (or all!) of the following resources: