After completing the course the student shall

• demonstrate knowledge of the disciplinary foundation and of proven experience in the design and analysis of algorithms and data structures that solve different types of problems correctly and efficiently
• demonstrate the ability to construct, analyze and critically evaluate various algorithmic solutions
• demonstrate the ability to simulate and evaluate complex computer programs
• show knowledge of mathematical tools for analyzing algorithms
• demonstrate ability for teamwork and cooperation and demonstrate ability to independently identify the need and ability to gain additional knowledge to enhance their skills
• demonstrate the ability to plan and use appropriate methods to undertake advanced tasks within predetermined parameters  
• demonstrate the ability to make judgments with regard to the possibilities of technologies , and demonstrate proficiency in present and discuss their conclusions and the knowledge and arguments that form the basis for these

The course will emphasize on the techniques for algorithmic problem solving. The main focus is the problems of searching in and sorting large data sets and the algorithmic graph problems. Basic data structures investigated include queues, stacks, lists, priority queues, trees, search trees, graphs, sets, and tables. The topics to be covered also include paradigms for design of algorithms and recurrence equations, measures of algorithmic efficiency, upper bounds, analysis of algorithmic asymptotic complexity in terms of time and memory.