Course 1: Synthesis and analysis of algorithms (LT)
Students will learn to solve problems that require the compilation of more complex algorithms. It is studied all from setting the task to analysing the solutions - data analysis, review of existing algorithms for its solution, selection of an appropriate algorithm, modification of an existing or construction of a new algorithm, selection of data structures, programming, program testing, analysis of the efficiency of the algorithm and the program.
What Will I Learn?
- Create algorithms for solving problems and evaluate their efficiency.
- Apply the basic sorting methods (direct selection, direct swap, direct insertion, distribution sort, pyramidal sorting, fast sorting).
- Be able to create and use recursive functions.
- Be able to create and use recursive data structures.
- Basic programming
Course Duration: 15 weeks
Topics for this course