Перейти к основному содержанию
EDU-MMCS
Вы используете гостевой доступ (
Вход
)
CS242. Algorithms and Data Structures (2021)
В начало
Курсы
Весенний семестр
Фундаментальная информатика и ИТ
ADS (2021)
Module 2. Greedy algorithms. Divide-and-Conquer st...
Task 6. Fast exponentiation
Task 6. Fast exponentiation
Требуемые условия завершения
Отметить как выполненный
Открыто с:
вторник, 4 мая 2021, 00:00
Task 06.pdf
4 мая 2021, 20:29
◄ Lecture 12. Divide-and-Conquer. Multiplication
Перейти на...
Перейти на...
Organizational matters
Exam mode query
Examination Questions
Lecture 01. Introduction to the course
Task 1
Sample code for comparing sorting procedures
Lecture 02. Sorting algorithms, part 1.List data structures.
Task 2. Insertion sort implementation using dynamic list
Sample code for task 2
Lecture 03. Graphs: definitions, representations and basic operations
Lecture 04. Graph traversals, part 1
Lecture 05. Graph traversals, part 2.
Task 3. Graph traversals.
Lecture 06. Graph traversals, part 3
Test 1
Lecture 07 Greedy algorithms. MST, Kruskal's algorithm
Lecture 08 Greedy algorithms. MST, Prim's algorithm
Task 4. Minimum Spanning Tree problem
Lecture 09. Priority queue, heap
Lecture 10. Binary heap
Lecture 11. Divide-and-Conquer. MergeSort
Task 5. Merge sort
Lecture 12. Divide-and-Conquer. Multiplication
Test 2
Lecture 13. Introduction to Dynamic Programming
Lecture 14. Dynamic programming for calculating distances in graphs. Part 1.
Lecture 15. Dynamic programming for calculating distances in graphs. Part 2.
Task 7. Graph distances
Lecture 16. Edit distance. The Longest Common Subsequence.
Task 8. Edit distance
Lecture 17. Optimal binary search tree
Test 3
Lecture 18. Algorithms for NP-hard problems. The Travelling Salesman Problem.
Task 9. Brute force algorithm for TSP
Lecture 19. Branch-and-Bound approach.
Lecture 20. Inexact algorithms. Part 1.
Lecture 21. Inexact algorithms. Part 2.
Task 10. Heuristic algorithm for TSP
Test 4
Test 2 ►