This week’s module focused on algorithm design techniques and graph algorithms. I learned how divide-and-conquer is applied in QuickSort, including how pivot selection affects performance and how the Median-of-Three strategy helps avoid worst-case scenarios. I also studied decrease-and-conquer through binary search and understood why sorting first can improve efficiency. In addition, I learned about Directed Acyclic Graphs (DAGs) and topological sorting. Using Kahn’s algorithm, I practiced calculating in-degrees, identifying source vertices, and detecting cycles. The quizzes and HW4_2 helped reinforce how algorithm steps and data structures like queues affect the final output order.
My educational goal in the Computer Science program is to become a skilled software engineer who can design and build innovative, efficient software solutions using both strong programming skills and AI tools responsibly. I want to complete my degree with a solid understanding of core computer science principles, such as algorithms, data structures, and system design, so I can solve complex problems without relying only on AI. After graduation, I aim to work on projects that improve people’s lives by combining creativity and technology, constantly learning new skills to stay ahead in the fast-changing tech world. This goal excites me because I see myself growing as a confident, adaptable developer who uses both traditional knowledge and AI to create a meaningful impact. My career goal is to be a software engineer who makes intelligent and helpful technology for people. I want to work at a company that uses AI and new tools carefully and responsibly. I want to grow as a leader who helps...
Comments
Post a Comment