Required: Discrete Mathematics and Its Applications (8th ed.), by Kenneth Rosen, McGraw Hill Publishing, 2019
Course Website: Additional course material can be found on Desire to Learn
CSC 251 - Finite Structures (3 credits)
Prerequisite: MATH 123 and CSC 150 or CSC 170
Homework and Course Outline
An update on the sequence of topics and supplementary materials will be available
here. All students are responsible for keeping up with the course
.
Prep work. There are a bunch of things to review in order to prepare for starting this course
Watch the welcome video on the YouTube playlist that is on D2L
Make sure you are registered for the course on the publisher site (McGraw Hill Connect, link is available on the D2L course site or you can go to https://www.mheducation.com/ . The quizzes will be administered through the McGraw Hill Connect Platform.
Watch the introduction to LaTeX on the YouTube playlist (playlist link is on D2L course page)
Setup your LaTeX (you can setup LaTeX on your own computer, or you can use Overleaf, or you can do anything else that generates LaTeX documents as long as you use the templates provided for this class
Read the syllabus and review due dates
Take the first quiz (quiz 0 on the McGraw Hill Connect Platform)
(8/19) Class introduction, review lecture 2.1 and lecture 2.2 on the YouTube playlist (link to playlist can be found on D2L) and lecture 2 in the notes that can be found on the D2L course page along with reading section 1.1 in the textbook. Practice problems: Section 1.1 (Propositional Logic) 1-5 odd, 9-13 odd, 17-23 odd, 29-33 odd, 37, 49, 51
(8/21) Finish section 1.1 in the text, and start section 1.2. Read Lecture 3 in the class notes on the D2L course page. Section 1.2 (Applications of logic) 3-11 odd, 21, 44, 45
(8/24) Section 1.3 in the textbook and you can also check out the short introduction on the CSC 251 YouTube playlist. Operations and logic equivalency: 5,7,9,11 a), b), c), d), 17-35 odd, 39, 41, 51, 53
Check out the video that is an Introduction to the Proof Assignments in CSC 251 on the YouTube playlist. This will help you start getting ready for writting your proofs for proof 1 and proof 2 that are due on 9/16.
(8/26) Section 1.4 in the textbook also intersects lecture 4 in the class notes and there is a video regarding lecture 4 on the CSC 251 YouTube playlist. Section 1.4 Quantifiers 1-25 odd, 31
(8/31) Nested quantifiers are covered in seciton 1.5 of the text and is covered in lecture 4 of the class notes. In addition, there is a video on the CSC 251 YouTube playlist that goes with lecture 4. Section 1.5 Nested Quantifiers: 1,3,7,9,15,17,23,25,31,33,35,39,45
(9/2) Section 1.6 has some content covered in lecture 5 of the class notes and also part 1 of lecture 5 in the YouTube playlist. Problems for section 1.6 Rules of Inference: 1-17 odd, 23
(9/4) Section 1.7 has some content covered in lecture 5 of the class notes and also part 2 of lecture 5 on the YouTube playlist. Section 1.7 Introduction to Proof: 1-14, 17,21, 29, 37. Quiz 1 due on McGraw Hill Connect Platform
(9/7) Practice your proofs and work on first proof set.
(9/9) Read section 1.8 and also check out the three short videos on section 1.8 that are available on the YouTube playlist. 1.8 Proof Strategy: 1-6,8-11,16,18,19,21.
(9/11) Read section 2.1 in the textbook and the corresponding problems for 2.1 Introduction to Set Theory: 1-29 odd, 37, 45, 47.
Also read lecture 6.1 in the class notes and at the end of the class notes lecture 6.1 is an additional video that you can watch.
(9/14) Section 2.2 More on Set Theory: 3,9,13,15,21,27-33 odd,40,41,45,53,57,59,61,62. Read section 2.2 and you can watch the lecture 6.2 video on the YouTube playlist.
(9/16) 2.3 Functions: 1-16, 22-26,30-34,42,44,45,50,51,61,71. Read section 2.3 in the textbook and you can watch a video of lecture 6.3 on the YouTube playlist. Due date for Proof 1 and Proof 2 in D2L dropbox
(9/28) 2.4 Sequences and Series: 1,3,5,9,11,29,31,33,35. Read section 2.4 in the textbook and you can watch a video of lecture 6.4 on the YouTube playlist.
(9/30) 2.6 Matrices: 1, 3, 9, 11, 22, 23, 26, 27. Read section 2.6 in the textbook and read the section 6.5 in the lecture notes. There are video links provided in the lecture notes that you can watch.
(10/2) 3.1 Algorithm analysis is covered in lecture 9 in the class notes and there are also two videos that go with lecture 9 on the YouTube playlist. In addition, lecture 9 notes have additional videos you can review. 3.1 Algorithms: 1,3,4,6,9,13,18,27,37,41,43,44, Proof 3 due in D2L dropbox
(10/5) Growth of Functions is covered in section 3.2 of the textbook and discussed in lecture 10 of the course notes. In addition, there is a video on lecture 10 and big O notation on the YouTube playlist along with additional videos listed in the course notes. 3.2 Growth of Functions: 1-9odd,13,17,19,23,25,29,63.
(10/7) Section 3.3 in the textbook gives an overview of computational complexity. Lecture 10 in the course notes also supplements the work in the text along with an additional lecture 10 video on the YouTube playlist. 3.3 Complexity of Algorithms: 1-3,7,11,15,19,33.
The book does not really discuss P and NP problems, but a simple introduction is included in lecture 10 along with a listing of a few videos
(10/9) 5.1 Mathematical Induction: 3,7,9,11,15. This material is also covered in lecture 11 of the class notes and the is a video on the YouTube playlist about induction. Quiz 4 due on McGraw Hill Connect Platform
(10/14) 5.3 Recursive Definition and Structural Induction: 1,3,5,20,23,36,37. You can find additional source material in the class notes in lecture 12.
(10/16) 4.1 Divisibility and Modular Arithmetic should be a famaliar topic from other courses. It is covered in section 4.1 of the text and in the class notes in lecture 13. Lecture 13 also includes several videos that you can use to review the subject. 4.1 Divisibility and Modular Arithmetic: 1,2,4,5,7,9,10,13,17,21,27,29,31,35,41.
(10/26) 5.4 Recursive Algorithms: 1,2,3,4,7,9,10,11,23. Please check out lecture 14 in the class notes on D2L (the notes include links to a couple of videos that could be helpful).
(10/28) 6.1 Counting: 1-11 odd,15,17,25,27,29.
Supplement material is provided in lecture 15 in the course notes. In addition, the notes have links to several videos that can be of assistance in learning the basics of counting methods.
The YouTube playlist does have a short overview regarding Chapter 6.
Added lecture 16 to the notes and the lecture notes do include a couple of videos that cover pigeonhole principle
(11/4) 6.2 more on 6.2: 22,23,24,38 Proofs 4 and 5 due on D2L
(11/6) 6.3 Permutations and Combinations: 1-21 odd.
Added lecture 17 in the class notes that includes links to videos and problems worked as examples
(11/9) 6.4 Binomial Theorem. Please see lecture 18 in the class notes (includes a couple of links to videos) and problems out of 6.4: 1,3,7.
(11/11) 7.1 Introduction to discrete probability: 1-9 odd, 13,21,25,27,37.
The book covers the material in sections 7.1 and 7.2 very well, but there is a supplement available in Lecture 19 in the class notes that includes some videos.