Today is the second exam in CSE-340 Design and Analysis of Algorithms. As, I believe, I mentioned in a previous post, this course is the most important one a Computer Science major will take. Knowing what algorithm to use for a given problem is crucial to be successful in this field.
The exam today will be quite robust. The material covered for this exam spans 11 chapters. Studying for this exam all week has proved exhausting. The material is much more complicated than the first exam which involved relatively simple algorithms and elementary data structures. This exam will be testing our knowledge on sorting algorithms, graph algorithms, trees, shortest paths, greedy algorithms, dynamic programming, and more. Learning each algorithm individually was not too difficult, but being prepared for this exam where we will be tested on a large volume of them is the challenge.
Here’s to hoping I do well on this exam as well!