TIL

During my commute today, I dedicated my time to studying Python Programming and Discrete Mathematics. The Python curriculum focused on OOP. Since I was already well-versed in this subject, I was able to progress through the material seamlessly. In Discrete Mathematics, I explored the second part of Graph Theory. Much like the preceding section, the fundamental concepts were not overly taxing.

The most noteworthy aspect of the lesson was Dijkstra’s algorithm, a topic I had not thoroughly mastered during my previous coding test preparations. I found the methodology of utilizing the concepts of infinity and the minimum value function for formal proofs to be remarkably intriguing. This experience has further stimulated my desire to delve into more advanced studies in Data Structures and Algorithms.

Leave a comment