cst-370- week 4- learning journal
This week I focused heavily on preparing for the midterm by reviewing all of the core topics we have covered so far in the course. I went back over fundamental data structures such as trees, binary search trees, and graphs, including different graph types and representations like adjacency lists and matrices. I also reviewed important algorithm concepts such as merge sort and the divide and conquer approach, especially how merging works and why the time complexity is Θ(n log n). In addition, I practiced time complexity analysis, recurrence relations, and the Master Theorem, along with BFS, DFS, and classic problems like TSP and Knapsack.
Comments
Post a Comment