Course Page ✏️
- Synthesis and analysis of algorithms
- CCEe04
- Description
-
AIMS AND OBJECTIVES OF THE COURSE: Acquisition of skills for problem algorithmization, analysis and evaluation of algorithms and synthesis of programs based on such algorithms. Students are introduced to basic groups of algorithms: number processing, sorting, search, hashing, tree structures, recursion, list structures, graph and graph processing. Classical algorithmic solutions are reproduced and analyzed. Evaluation of different problem.
DESCRIPTION OF THE COURSE: The course introduces students to the theory of algorithmization, analysis of the complexity and resource intensity of algorithms and synthesis of optimal algorithms. Classical groups of algorithms are considered: number processing, sorting, search, hashing, tree structures, recursion, list structures, graph and graph processing. Classical algorithmic solutions are reproduced and analyzed. - ECTS credits
- 6
- Teaching Language
- English
- Exam Language
- English
- Support Materials Language
- English
- Basic Learning Outcomes
-
- Understand the relationship between mathematical methods and algorithms / models.(MF2 - CSB - Understand the relationship between mathematical methods and algorithms / models. )
- Develop an understanding of basic concepts, terms, and relationships from the fields of automata theory and formal languages. Be able to design and implement the phases of programming language translators: lexical analysis, syntactic analysis, and code generation.(PA4 - CSB - Develop an understanding of basic concepts, terms, and relationships from the fields of automata theory and formal languages. Be able to design and implement the phases of programming language translators: lexical analysis, syntactic analysis, and code generation.)
- Final Learning Outcomes
-
- Course categorized
- Managing Entity (faculty)