(Click to listen then read post series)
Once upon a time, in the far reaches of Computer Science universe different kinds of algorithm analysis emerged with its complexities and their hard understanding nature became computer science students final frontier . . .

Yes, you guessed right. Its 0360-454 Design and Analysis of Algorithms and its mighty CLRS book (The MIT Press - Introduction to Algorithms). The course covers a broad range of algorithms along with their design and analysis, some examples are Quick Sort, Dynamic Programming, Greedy Algorithms, Graph Algorithms, NP-Completeness and Approximation Algorithms.

Most of my fellow classmates and previous generations of Honours Computer Science students have/had hard times staying on the thin red line of the passing mark which ultimately i call it the "Final Frontier" of Honours Computer Science students to graduation. All said, may my degree be in the hands of 0630-454.