CMPE 232 [Bilgi university] [Advanced Data Structures and Algorithms]

What Will You Learn?

• Upon successful completion of the course, students will be able to;
• Analyse and compare algorithms for string matching
• Analyse and compare numerical algorithms such as fast multiplication and exponentiation
• Implement and compare Monte Carlo algorithms such as those for primality testing.
• Recognise and define data structures for the representation of constructs such as graphs, hash tables, matrices and others. discuss and compare their implementations
• Implement and analyse graph algorithms.
• Implement and analyse dynamic programming algorithms.
• Use amortised analysis on the time and space requirements of algorithms.