COT3100 Applications of Discrete Structures (TA)

Course Overview

This is the required discrete mathematics course for computer science and computer engineering majors at the University of Florida. It covers:

• Propositional logic, predicate calculus, and rules of inference
• Sets, functions, sequences, and summations
• Algorithms, growth of functions, and complexity
• Number theory: divisibility, primes, and number systems
• Induction and recursion
• Counting, permutations, and combinations
• Discrete probability
• Graphs

The Fall 2020 offering was delivered online because of the pandemic.

Prerequisites

• MAC2311 or MAC3472 (calculus) and COP3502C or equivalent, each with a minimum grade of C
• Corequisite: COP3503 or COP3504

Textbook

• Discrete Mathematics and Its Applications, Kenneth Rosen

My Role

I served as an Undergraduate Teaching Assistant (UF uses the term Peer Mentor). I ran a weekly discussion section, for which I wrote practice problem handouts drawn from the textbook that flagged commonly misunderstood concepts, wrote worked solutions, and held office hours.

Schedule

Week	Date	Topic	Materials
1	Sep 7	Propositional Logic Sections 1.1-1.3. No discussion section (Labor Day).
2	Sep 14	Predicate Calculus, Inference Sections 1.4-1.6.
3	Sep 21	Predicate Calculus, Inference Sections 1.7-1.8.
4	Sep 28	Sets, Functions Sections 2.1-2.3.
5	Oct 5	Functions, Sequences, Series, Summations Sections 2.3-2.5.
6	Oct 12	Algorithms, Complexity, Searching Sections 3.1-3.2.
7	Oct 19	Algorithms, Complexity, Searching, Sorting Sections 3.1-3.3.
8	Oct 26	Number Theory, Primes, Divisors, Number Systems Sections 4.1-4.3.
9	Nov 2	Number Theory, Induction Sections 4.3, 5.1.
10	Nov 9	Induction, Recursion Sections 5.1-5.3.
11	Nov 16	Recursion Section 5.4.
12	Nov 23	Counting, Permutations, Combinations Sections 6.1-6.3.
13	Nov 30	Probability Sections 7.1-7.2.
14	Dec 7	Graphs Sections 10.1-10.3.