Linear algebra is the branch of mathematics concerning linear equations and linear maps. It is central to almost all areas of mathematics. In this course, we will follow the idea of solving linear equations Ax=b and introduce the four fundamental subspaces for the matrix A, culminating in the fundamental theorem of linear algebra.

This course is co-taught with Prof. Hong Xuan. In the first half of the semester, Prof. Hong will introduce topics in matrix theory; in the second half, I will cover topics including group theory and related algebraic structures.

Turing Award awardee Knuth once said, "Computer Science is the study of algorithms". Even though the speed of computers is now so fast that we might even question whether Moore's Law still holds true, the significance of an efficient algorithm remains essential for us. In this course, we aim to present various algorithms for numerous standard algorithmic problems. We will illustrate both algorithm design techniques and the methods employed in algorithm analysis. By the end of the course, students will attain proficiency in applying fundamental algorithm design techniques and will become acquainted with the key theoretical instruments utilized in algorithm analysis.

Discrete Mathematics is the mathematical foundation of computer science. Within this course, students will acquire a specific collection of mathematical principles and learn how to apply them. Significantly, the course will cultivate logical and mathematical thinking abilities among students. Topics covered include: Logic, Set Theory, Algebraic Structures, Combinatorics, Graph Theory, and Elementary Number Theory.

Linear algebra is the branch of mathematics concerning linear equations and linear maps. It is central to almost all areas of mathematics. In this course, we will follow the idea of solving linear equations Ax=b and introduce the four fundamental subspaces for the matrix A, culminating in the fundamental theorem of linear algebra.

Discrete Mathematics is the mathematical foundation of computer science. Within this course, students will acquire a specific collection of mathematical principles and learn how to apply them. Topics covered include: Logic, Set Theory, Algebraic Structures, Combinatorics, Graph Theory, and Elementary Number Theory.

Turing Award awardee Knuth once said, "Computer Science is the study of algorithms". Even though the speed of computers is now so fast that we might even question whether Moore's Law still holds true, the significance of an efficient algorithm remains essential for us. In this course, we aim to present various algorithms for numerous standard algorithmic problems.

Discrete Mathematics is the mathematical foundation of computer science. Topics covered include: Logic, Set Theory, Algebraic Structures, Combinatorics, Graph Theory, and Elementary Number Theory.

Linear algebra is the branch of mathematics concerning linear equations and linear maps. It is central to almost all areas of mathematics. In this course, we will follow the idea of solving linear equations Ax=b and introduce the four fundamental subspaces for the matrix A.

Turing Award awardee Knuth once said, "Computer Science is the study of algorithms". Even though the speed of computers is now so fast that we might even question whether Moore's Law still holds true, the significance of an efficient algorithm remains essential for us. In this course, we aim to present various algorithms for numerous standard algorithmic problems.

Discrete Mathematics is the mathematical foundation of computer science. Topics covered include: Logic, Set Theory, Algebraic Structures, Combinatorics, Graph Theory, and Elementary Number Theory.