CST370 - Week 1

This week was the first week of the new class, CST370. I went through the lecture slides which included videos, documents, exercises, and puzzles. First, we learnt about important problem types such as sorting, searching, graph problems, etc. Then we delved into the fundamental data structures such as arrays, lists, and graphs. We focused heavily on undirected and directed graphs, adjacency matrices and lists, and the different properties of various graphs. Last, we defined algorithm analysis as the efficiency of the algorithm and learned how to determine an algorithm's order of growth from the 8 common time complexities and how they compare to each other.

Our homework was to write 3 different programs. The first one received numbers from the user and displayed the number that occurred most frequently and the number of times it occurred. The second program took in two sets of numbers and displayed the uncommon numbers between them. The last read a set of elements and then displayed the possible binary numbers and corresponding subsets. I worked really hard writing and testing these programs and felt great when I was able to figure them out and pass all test cases!