CSCI 3080: Discrete Structures

Summer 2025--Section 001 (Face to Face)

Sec 001	10:00 AM -- 11:45 AM (ACB 104)
Section	Lecture (MWTRs)

Office Hour

NOTE: According to departmental policy, students who fail to attend the first two class meetings will be dropped from the course

Attendance:Class attendance is required. If several classes or assignments submissions are missing, student attendance will be reported as "no longer attending".

Attendance Grading Policy

Course Calendar

Note: Tentative Class Schedule (subject to change)
OLA stands for Open L ab Assignment (Homework) Homework Late Submission Information

Lesson 1

Lecture

Syllabus	Discrete Mathematics for Computer Science
How do computers represent data?	Bit, Byte, KB, MB, GB, TB
Fundamental Fields of Mathematics

An Introduction to Propositional Logic	1.1 Formal symbols of Propositional Logic
1.1 Translating English Statements into Propositional Logic

Code

OLA

Reading assignment:
Chapter 1.1: Statements, Symbolic Representation, and Tautologies

Reading assignment:
Chapter 1.2: Propositional Logic
Lab 1: Traffic Light Control System Simulation Due date: May 24th, 2025 23:59 PM (Saturday)

Lesson 2

Lecture

1.1 Tautology	1.2 Valid Argument
1.2 Derivation Rules

1.2 Verbal Arguments	Quiz 1: Formal Logic Quiz1_Solution

Code

OLA

Reading assignment:
Chapter 2.1: Proof Techniques

OLA1 Due date: May 26th, 2025 23:59 PM (Monday)

Lesson 3

Lecture

2.1 Proof Techniques

2.2 Induction	Quiz2_Solution

Code

OLA

Reading assignment:
Chapter 2.2: Induction
Quiz 2: Proofs and Induction

OLA2 Due date: June 1st, 2025 23:59 PM (Sunday)

Lesson 4

Lecture

3.1 Recursive Definitions	Recursion vs Iteration in C++

3.2 Recurrence Relations

Code

Fibonnacci Demo
Factorial Demo

Quiz 3: Recursion and Recurrence Relations	Quiz3_Solution

OLA

Reading assignment:
Chapter 3.1 Recursive Definitions Recursively Defined Sequences Recursively Defined Algorithms
Lab 2: Virus Spread Simulation Due date: June 4th, 2025 23:59 PM (Wednesday)

Reading assignment:
Chapter 3.2: Recurrence Relations Linear First-Order Recurrence Relations
OLA3 Due date: June 8th, 2025 23:59 PM (Sunday) OLA 3 Exercise 5 Hint: \( \sum\limits_{i=0}^na^i = \frac{a^{n+1}-1}{a-1} (a \neq 1) \)

Lesson 5

Lecture

5.7 Matrices	5.7 Boolean Matrix

5.7 Gaussian Elimination	Quiz 4: Matrices and Gaussian Elimination

Code

matrixDemo.pdf matrixDemo.ipynb
lena.jpg dog.jpg

OLA

Reading assignment:
Chapter 5.7: Matrices

Quiz 4: Matrices and Gaussian Elimination
Lab 3: Gauss-Jordan Elimination for Solving Linear Equations (Due date: June 11th, 2025 (Wednesday))

Lesson 6

Lecture

6.1 Graph Basics	6.1 Graph Terminology

Test 1

Code

graphDemo.ipynb	graphDemo.pdf

OLA

Reading assignment:
Chapter 6.1: Graphs and Representations

Lesson 7

Lecture

6.1 Adjacent Matrix	6.1 Adjacent List

6.2 Tree Terminology	6.2 Binary Tree Representation
6.2 Tree Traversal Algorithms

Code

OLA

Reading assignment:
Chapter 6.2: Tree and Representations

Lesson 8

Lecture

6.3 Decision Trees: Searching	6.3 Decision Tree: Sorting
Test 1 Review

6.4 Huffman Codes

Code

OLA

Reading assignment:
Chapter 6.3: Decision Trees
Chapter 6.4: Huffman Codes

Lab 4: Compressing Text Files using Huffman Coding
(Due date: June 19th, 2025 (Thursday))

OLA4 Due date: June 15th, 2025 23:59 PM (Sunday)

Lesson 9

Lecture

Quiz 5: Graphs and Trees	Quiz 5 Solution: Graphs and Trees
7.1 Directed Graphs and Binary Relations

7.1 Warshall' Algorithm	7.2 Euler Path and Hamiltonian Circuit

Code

reachability.cpp adjmatrix.txt

OLA

Reading assignment:
Chapter 7.1: Directed Graphs and Binary Relations, Warshall' Algorithm

Reading assignment:
Chapter 7.2: Euler Path and Hamiltonian Circuit

Lesson 10

Lecture

7.3 Dijkstra's Algorithm
7.4 Depth-First Search	Depth-First Search Video
7.4 Breadth-First Search	Breadth-First Search Video

Quiz 6: Graph and Algorithm	9.3 Finite-State Machine

Code

OLA

Reading assignment:
Chapter 7.3: Shortest Path
Chapter 7.4: Traversal Algorithms

OLA5 Due date: June 22nd, 2025 23:59 PM (Sunday)

Lab 5: Finding the Shortest Path with Dijkstra’s Algorithm
(Due date: June 27th, 2025 (Friday))

Lesson 11

Lecture

9.3 Examples of FSM: Binary Adder	9.3 Examples of FSM: Recognition
9.3 Regular Sets and Kleene's Threorem

9.4 Turing Machine	9.4 Turing Machine as Recognizers

Code

OLA

Lesson 12

Lecture

9.4 P, NP Problems	9.5 Formal Languages
Quiz 7: FSM & Turing Machine	Quiz 7 Solution

Test 2

Code

OLA

Reading assignment:
Chapter 9.3: Finite-State Machines

Lesson 13

Lecture

X.1 Weighted Codes	X.2 Non-Weighted Codes

X.3 Parity Bit	X.4 7 bit Hamming Code

Code

EncodingScheme.pdf

OLA

OLA6 Due date: June 25th, 2025 23:59 PM (Wednesday)

Lesson 14

Lecture

Quiz 8: Encoding & Error Detection/Correction
Test 2 Review

No Class

Code

OLA

Quiz 8 Solution

Last Day of Classes: June 26th, 2025 (Thursday)
Test 1 (Sec001)	Date: June 2nd, 2025 (Monday)	Time: 10:00 AM to 11:45 AM
Test 2 (Sec001)	Date: June 18th, 2025 (Wednesday)	Time: 10:00 AM to 11:45 AM
Final Exam (Sec001)	Date: June 26th, 2025 (Thursday)	Time: 10:00 AM to 12:00 PM

CSCI 3080: Discrete Structures

Summer 2025--Section 001 (Face to Face)

Course Calendar

Note: Tentative Class Schedule (subject to change) OLA stands for Open L ab Assignment (Homework) Homework Late Submission Information

Note: Tentative Class Schedule (subject to change)
OLA stands for Open L ab Assignment (Homework) Homework Late Submission Information