CST370 - Week 1

1. 1. This week introduced the fundamentals of algorithm analysis. We reviewed different types of graphs: acyclic, directed, undirected, weighted. This weeks material also covered time complexity and reminded me of concepts from past object‑oriented programming courses, especially binary trees and binary search trees. Revisiting these ideas helped solidify my understanding of them.
2. 
   
3. I especially enjoyed the problem‑solving focus of this week’s content. Our previous course was more design‑oriented, which I appreciate, but I really enjoy logical and computational thinking. We also practiced creating adjacency matrices and adjacency lists from given graphs. I learned that a valid graph must have a non‑empty set of vertices, while the edge set may be empty, and that graphs cannot contain duplicate vertices or duplicate edges.
4. 
   
5. 2. Besides spending the week watching lectures and reviewing slides, no other class participation was done outside of the required work for the week.