Department of Computer and Information Sciences, Temple University

CIS 2166. Mathematical Concepts in Computing II

Section 003, Fall 2024

Syllabus       Instructor: Dr. Pei Wang


Schedule (tentative)

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

Relevant Links


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