Department of Computer and Information Sciences, Temple University

CIS 2166. Mathematical Concepts in Computing II

Section 003, Fall 2025

Syllabus       Instructor: Dr. Pei Wang


Schedule (tentative)

WEEK DATE TOPIC READING
1 08/26 Algorithms Rosen 3.1
- 08/28 The Growth of Functions Rosen 3.2
2 09/02 Complexity of Algorithms Rosen 3.3
- 09/04 Complexity of Algorithms Rosen 3.3
3 09/09 Mathematical Induction Rosen 5.1
- 09/11 Strong Induction Rosen 5.2
4 09/16 Recursive Definition Rosen 5.3
- 09/18 Recursive Algorithms Rosen 5.4
5 09/23 Introduction to Graphs Rosen 10.1-2
- 09/25 Representing Graphs Rosen 10.3
6 09/30 Connectivity Rosen 10.4
- 10/02 Euler and Hamilton Paths Rosen 10.5
7 10/07 Shortest Path Rosen 10.6
- 10/09 Review for Midterm  
8 10/14 Mid-term Exam  
- 10/16 Midterm Exam discussion  
9 10/21 Systems of Linear Equations Hartman 1.1-2
- 10/23 Systems of Linear Equations Hartman 1.3-4
10 10/28 Matrix Arithmetic Hartman 2.1-4
- 10/30 Matrix Arithmetic Hartman 2.4-7
11 11/04 Operations on Matrices Hartman 3.1-4
- 11/06 Eigenvalues and Eigenvectors Hartman 4.1-2
12 11/11 Graphical Explorations of Vectors Hartman 5.1-2
- 11/13 Neural Networks notes
13 11/18 Google PageRank notes
- 11/20 Google PageRank notes
    Fall Break  
14 12/02 Review: Practice questions  
- 12/04 Review for Final  
  12/16 Final Exam (1:00 - 3:00 pm)  

Relevant Links


URL: http://www.cis.temple.edu/~pwang/2166-MC/2166-index.htm