Harry Huang's Homepage

MATH 240
Introduction to Discrete Mathematics

An introduction to discrete mathematics. We covered topics such like proof techniques, recursion and structural induction, recurrences, functions and relations, graphs and trees, finite automata and regular expressions, and counting.

MATH 341
Linear Algebra (Honor Section)

An introduction to linear algebra. This is one of the hardest linear algebra courses in UW-Madison. We talked about some properties of vector space, subspace, and field first. Then we covered the regular topics such as matrix calculation, eigenvalues, diagonalization, Gram-Schmidt Orthogonalization Process and Orthogonal Complements. Details can be seen in my github repo MATH341.

COMP SCI 300
Programming II

My first formal Computer Science course in UW-Madison. This course talked about some basic objects and properties of Java like polymorphis. Also, it introduced some simple data structures like binary search tree, heap, etc. There were 10 programming assignments in total, all of them are strongly related with current topic. All of them should be completed with Java.

MUSIC 60
All-University String Orchestra

University string orchastra opened for all students in our university. I play cello in this orchastra. This course has rehearsals every week, and a concert at the end of semester.

COMP SCI 252
Introduction to Computer Engineering

An introduction to computer engineering. It introduced how computers compile programs, various electronic components, and how to write assembly language. There are programming assignments in LC-3 language.

COMP SCI 400
Programming III

This is the third and final course in the series of Java programming course CS200/300/400. In this course we learnt some useful CS techniques, including usage of various Linux commands and git. Also, we learnt more algorithms including Kruskal, Dijkstra, and data structures like red-black tree.

MATH 521
Analysis I (Honor Section)

Introduction to mathematics analysis. It covered several topics about analysis, including basic set theory, topology on metric spaces, formal definitions of derivative and integral, and some techniques about analyzing properties of sequence, series, and functions. We used baby rudin (Principles of Mathematical Analysis) as our textbooks, which is written by professor Rudin from our university!

MATH 541
Modern Algebra (Honor Section)

This course introduced abstract algebra. Topics basic set theory, group theory (including group actions), ring theory, Euclidean Domain, Principle Ideal Domain, and congurence problems with Chinese Remainder Theorem are covered and all appear in the homework and exams. We mainly followed the lecture notes written by professor Chenxi Wu. I wrote several blogs about topics that are covered in this course.

MATH 551
Elementary Topology (Honor Section)

In this course, we learnt point set topology, in the order of set theory, topology on metric spaces, then point set topology (general topology). I wrote several blogs about topics that are covered in this course.

MATH/CS 475
Introduction to Combinatorics

This course introduced various topics about combinatorics, including generating permutations and combinations, binomial coefficients, inclusion-exclusion principle, recurrence relations, generating functions, special counting sequences (First/Second Stirling number, Catalan number), and Polya Counting. It is interesting that these topics are also covered in International Collegiate Programming Contest. We used a textbook written by professor Brualdi, who also comes from our university.

COMP SCI 540
Introduction to Artificial Intelligence

As its name, this is an introduction to artificial intelligence. Indeed, this is one of the most popular upper level CS courses in UW-MAdison, probably because its name. As there are to many topics that are covered in this course, please refer to our course webpage if you are interested in the topics of this course. There are 10 programming assignments in this course. All of them (except the first one about writing essay) should be completed by python. While there are few prerequistes for this course, you need a solid understanding in basic probability theory and linear algebra to fully grasp this course.

COMP SCI 502
Theory and Practice in Computer Science Education

This is a course about CS education. We discuessed lots of topics about the problems in CS education, such as the usage of LLM, how to make students feel more belonging in CS courses, and what are the characteristics of a good peer mentor. We are also asked to watch how peer mentors/TAs work, and write reports and thoughts from the observation.