Week 56 (2/25/2026 - 2/28/2026)
(Click on READ MORE for better formatting)
Hi everyone, welcome to my 56th blog! This is the Week 8 post for CST 370 Design and Analysis of Algorithms.- While there was no required journal entry for this week of class, I felt that I should write one to keep up with my tradition to cover my journey of every week in the CS Online program.
- As this week featured the Final Exam, there was not much in terms of new content, other than Dijkstra's algorithm. That is a greedy technique algorithm used to find the shortest path between nodes in a weighted graph. This was a neat callback to CST 311 Introduction to Computer Networks, where we explored how Dijkstra and Bellman-Ford algorithms are applied in a networking context.
- To wrap things up, I felt that while this class can be quite challenging, the concepts covered in data structures and algorithm (DSA) courses are very much fundamental to computer science and many of its sub-disciplines, such as networking, software engineering, and data science.
- Especially in the emergence of agentic/AI programming, it is more important than ever to know when agents generate a poor solution. For example, if AI generated a O(n^2) algorithm, but by taking this class you know it could be done in O(n log n) time, that is incredible leverage to hold the agent accountable when it fails to choose the most optimal solution independently.
That is all for this week, see you in my Week 57 post!
Onward to CST462S Race, Gender, Class in the Digital World and CST328 Digital Art and Design!
Comments
Post a Comment