1. |
Course title |
Construction and analysis of algorithms |
2. |
Course of Study, Speciality |
3, Mathematics and information technologies (majors in) Major in 1-31 03 08-01 Web development and Internet Technologies |
3. |
Semester |
5 |
4. |
Credits |
3 |
5. |
Lecturer |
Candidate of Physical and Mathematical Sciences Suzdal Stanislav Valerievich |
6. |
Coarse goal |
Familiarization of students with the most frequently used combinatorial algorithms, with basic ideas, methods and algorithmic strategies that will allow them to be prepared for solving real problems arising in practice. Formation of students’ skills in algorithmic thinking and the ability to apply it in specific tasks. |
7. |
Prerequisites |
Programming Methods and Informatics (1, 2 course), Discrete Mathematics (3, 4 semesters) |
8. |
Course Topics |
Basic data structures and complexity of algorithms. The subject of the theory of algorithms. Stacks, queues, linked lists, binary trees. The complexity of algorithms. Deterministic and nondeterministic Turing machines. Algorithms of sorting. Search and selection algorithms. Algorithms on graphs. Algorithms on the lines. |
9. |
Recommended Literature |
1. Ахо, А. Построение и анализ вычислительных алгоритмов / А. Ахо, Дж. Хопкрофт, Дж. Ульман. – М.: Издательский дом «Вильямс», 2001. – 384 с. 2. Гэри, М. Вычислительные машины и труднорешаемые задачи / М. Гэри, Д. Джонсон. – М.: Мир, 1982. – 416 с. 3. Кормен, Т. Х. Алгоритмы. Построение и анализ / Т. Х. Кормен., Ч. И. Лейзерсон, Р. Л. Ривест, К. Штайн. – М.: Вильямс, 2005. – 1296 c. 4. Кнут, Д. Искусство программирования. Т. 1. Основные алгоритмы / Д. Кнут. – М.: Вильямс, 2006. – 720 с. 5. Кнут, Д. Искусство программирования. Т. 3. Сортировка и поиск / Д. Кнут. – М.: Вильямс, 2007. – 824 с. |
10. |
Teaching Methods |
Passive, active, interactive, verbal, visual, problematic |
11. |
Teaching language |
Russian |
12. |
Requirements, current control |
– Test; – Verification of completed practical assignments |
13. |
Method of certification |
Credit |