About This Course

Objectives:
The course will cover basics and enhancements in design, analysis and implementation of algorithms. Students will learn how to solve competitive programming exercises on online judge systems and to solve real-life practical problems. The problems are described in the form of multidisciplinary applications such as on transportation, communication networks, bioinformatics, scheduling, artificial intelligence, data processing, .... In addition to mastering the basic knowledge of the algorithm, students will learn skills to implement and quickly implement different types of algorithms, different basic and advanced data structures. The course also provides students with access to anumber of programming problems in job interviews of famous companies, a number of problems in the Olympic in informatics for students and International Collegiate Programming Contest (ICPC). This makes advantage for students in preparing to looking for opportunities to get a job in a famous company, even in abroad. Students will also have access to the best online judge systems in the world.

Content:
Topics include: Data structure and basic algorithms libraries, Recursion and branchand-bound techniques, Greedy algorithm, Divide and Conquer, Dynamic programming, Data structure and algorithm on graphs, Algoritms on strings, Introduction to NP-completeness. The topics are illustrated on practical application problems.