CSCI 3080: Discrete Structures

Spring 2026--Section 001 (Face to Face)


Section Lecture (TRs)
Sec 001 09:40 AM -- 11:05 AM (ACB 104)

Computer Science Tutoring 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

Week 1 Jan 20th, 2026 Jan 22nd, 2026
Lecture
Syllabus Discrete Mathematics for Computer Science
How do computers represent data? Bit, Byte, KB, MB, GB, TB
Branches 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
Quiz 1: Formal Logic
Week 3 Feb 3rd, 2026 Feb 5th, 2026
Lecture
1.1 Tautology 1.2 Valid Argument
1.2 Derivation Rules
1.2 Verbal Arguments Quiz1_Solution
Code
OLA
Reading assignment:
Chapter 2.1: Proof Techniques
Lab 1: Traffic Light Control System Simulation
Due date: Feb 17th, 2026 23:59 PM (Tuesday) 		OLA1 Due date: Feb 15th, 2026 23:59 PM (Sunday)
Week 4 Feb 10th, 2026 Feb 12th, 2026
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: Feb 22nd 2026 23:59 PM (Sunday)

Week 5 Feb 17th, 2026 Feb 19th, 2026
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: Feb 26th, 2026 23:59 PM (Thursday)
Reading assignment:
Chapter 3.2: Recurrence Relations
Linear First-Order Recurrence Relations
OLA3 Due date: Mar 1st, 2026 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) \)
Week 6 Feb 24th, 2026 Feb 26th, 2026
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: Mar 19th, 2026 (Thursday))

Week 7 Mar 3rd, 2026 Mar 5th, 2026
Lecture
6.1 Graph Basics 6.1 Graph Terminology
6.1 Adjacent Matrix 6.1 Adjacent List
Test 1
Code
graphDemo.ipynb graphDemo.pdf
OLA
Reading assignment:
Chapter 6.1: Graphs and Representations
Week 8 Mar 10th, 2026 Mar 12th, 2026
Lecture No Class (Spring Break) No Class (Spring Break)
Code
OLA
Week 9 Mar 17th, 2026 Mar 19th, 2026
Lecture
6.2 Tree Terminology 6.2 Tree Representation
6.2 Tree Traversal Algorithms 6.2 Prefix, Infix and Postfix Notation
6.3 Decision Trees: Searching 6.3 Decision Tree: Sorting
6.4 Huffman Codes
Code InOrder.cpp
OLA
Reading assignment:
Chapter 6.2: Tree and Representations
Chapter 6.3: Decision Trees
Chapter 6.4: Huffman Codes
Lab 4: Compressing Text Files using Huffman Coding
(Due date: TBD, 2026 ())
OLA4 Due date: TBD, 2026 23:59 PM ()
Week 10 Mar 24th, 2026 Mar 26th, 2026
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
Week 11 Mar 31st, 2026 April 2nd, 2026
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:   TBD, 2026 23:59 PM () 		Lab 5: Finding the Shortest Path with Dijkstra’s Algorithm
(Due date: TBD, 2026 23:59 PM ())

Week 12 April 7th, 2026 April 9th, 2026
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
Week 13 April 14th, 2026 April 16th, 2026
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
Week 14 April 21st, 2026 April 23rd, 2026
Lecture
X.3 Parity Bit X.4 7 bit Hamming Code
X.1 Weighted Codes X.2 Non-Weighted Codes
Code EncodingScheme.pdf
OLA OLA6 Due date: TBD, 2026 23:59 PM () Bonus Lab: Binary, Decimal, Hexadecimal Converter
(Due date: TBD, 2026 23:59 PM ())
Week 15 April 28th, 2026 April 30th, 2026
Lecture
Quiz 8: Encoding & Error Detection/Correction
Test 2 Review
No Class
Code
OLA Quiz 8 Solution
Week 16 May 5th, 2026 May 7th, 2026
Lecture No Class Final Exam
10:00 AM to 12:00 PM
Code
OLA


Last Day of Classes: April 29th, 2026
Test 1 (Sec001) Date: Mar 5th, 2026 (Thursday) Time: 09:40 AM to 11:05 AM
Test 2 (Sec001) Date: TBD, 2026 (Thursday) Time: 09:40 AM to 11:05 AM
Final Exam (Sec001) Date: May 7th, 2025 (Thursday) Time: 10:00 AM to 12:00 PM