Algorithms and Data Structures IS-FCS-00020S

Description:
Students will have demonstrated the ability to: analyze worst-case running times of algorithms using asymptotic analysis. Synthesize dynamic programming algorithms, and analyze them. Explain the major algorithms for sorting. Derive lower bounds on the running time of comparison-sorting algorithms.. Explain the major elementary data structures for implementing dynamic sets and the analyses of operations performed on them. Synthesize new data structures by augmenting existing data structures, etc.

Requirements:
Programming in C, C++, Java or C#, mathematical analysis - basic knowledge.