Курс: CS242. Algorithms and Data Structures (2021)

Тематический план

Выбрать тему Общее

Общее

Свернуть всё Развернуть всё
- Select activity Organizational matters
  
  Organizational matters Файл
- Select activity Exam mode query
  
  Exam mode query Опрос
  
  Сделать выбор
- Select activity Examination Questions
  
  Examination Questions Файл
Выбрать тему Module 1. Introduction to algorithms and data structures

Module 1. Introduction to algorithms and data structures
- Select activity Lecture 01. Introduction to the course
  
  Lecture 01. Introduction to the course Файл
- Select activity Task 1
  
  Task 1 Задание
- Select activity Sample code for comparing sorting procedures
  
  Sample code for comparing sorting procedures Файл
- Select activity Lecture 02. Sorting algorithms, part 1.List data structures.
  
  Lecture 02. Sorting algorithms, part 1.List data structures. Файл
- Select activity Task 2. Insertion sort implementation using dynamic list
  
  Task 2. Insertion sort implementation using dynamic list Задание
- Select activity Sample code for task 2
  
  Sample code for task 2 Файл
- Select activity Lecture 03. Graphs: definitions, representations and basic operations
  
  Lecture 03. Graphs: definitions, representations and basic operations Файл
- Select activity Lecture 04. Graph traversals, part 1
  
  Lecture 04. Graph traversals, part 1 Файл
- Select activity Lecture 05. Graph traversals, part 2.
  
  Lecture 05. Graph traversals, part 2. Файл
- Select activity Task 3. Graph traversals.
  
  Task 3. Graph traversals. Задание
- Select activity Lecture 06. Graph traversals, part 3
  
  Lecture 06. Graph traversals, part 3 Файл
- Select activity Test 1
  
  Test 1 Тест
Выбрать тему Module 2. Greedy algorithms. Divide-and-Conquer strategy.

Module 2. Greedy algorithms. Divide-and-Conquer strategy.
- Select activity Lecture 07 Greedy algorithms. MST, Kruskal's algorithm
  
  Lecture 07 Greedy algorithms. MST, Kruskal's algorithm Файл
- Select activity Lecture 08 Greedy algorithms. MST, Prim's algorithm
  
  Lecture 08 Greedy algorithms. MST, Prim's algorithm Файл
- Select activity Task 4. Minimum Spanning Tree problem
  
  Task 4. Minimum Spanning Tree problem Задание
- Select activity Lecture 09. Priority queue, heap
  
  Lecture 09. Priority queue, heap Файл
- Select activity Lecture 10. Binary heap
  
  Lecture 10. Binary heap Файл
- Select activity Lecture 11. Divide-and-Conquer. MergeSort
  
  Lecture 11. Divide-and-Conquer. MergeSort Файл
- Select activity Task 5. Merge sort
  
  Task 5. Merge sort Задание
- Select activity Lecture 12. Divide-and-Conquer. Multiplication
  
  Lecture 12. Divide-and-Conquer. Multiplication Файл
- Select activity Task 6. Fast exponentiation
  
  Task 6. Fast exponentiation Задание
- Select activity Test 2
  
  Test 2 Тест
Выбрать тему Module 3. Dynamic programming

Module 3. Dynamic programming
- Select activity Lecture 13. Introduction to Dynamic Programming
  
  Lecture 13. Introduction to Dynamic Programming Файл
- Select activity Lecture 14. Dynamic programming for calculating distances in graphs. Part 1.
  
  Lecture 14. Dynamic programming for calculating distances in graphs. Part 1. Файл
- Select activity Lecture 15. Dynamic programming for calculating distances in graphs. Part 2.
  
  Lecture 15. Dynamic programming for calculating distances in graphs. Part 2. Файл
- Select activity Task 7. Graph distances
  
  Task 7. Graph distances Задание
- Select activity Lecture 16. Edit distance. The Longest Common Subsequence.
  
  Lecture 16. Edit distance. The Longest Common Subsequence. Файл
- Select activity Task 8. Edit distance
  
  Task 8. Edit distance Задание
- Select activity Lecture 17. Optimal binary search tree
  
  Lecture 17. Optimal binary search tree Файл
- Select activity Test 3
  
  Test 3 Тест
Выбрать тему Module 4. NP-hard problems

Module 4. NP-hard problems
- Select activity Lecture 18. Algorithms for NP-hard problems. The Travelling Salesman Problem.
  
  Lecture 18. Algorithms for NP-hard problems. The Travelling Salesman Problem. Файл
- Select activity Task 9. Brute force algorithm for TSP
  
  Task 9. Brute force algorithm for TSP Задание
- Select activity Lecture 19. Branch-and-Bound approach.
  
  Lecture 19. Branch-and-Bound approach. Файл
- Select activity Lecture 20. Inexact algorithms. Part 1.
  
  Lecture 20. Inexact algorithms. Part 1. Файл
- Select activity Lecture 21. Inexact algorithms. Part 2.
  
  Lecture 21. Inexact algorithms. Part 2. Файл
- Select activity Task 10. Heuristic algorithm for TSP
  
  Task 10. Heuristic algorithm for TSP Задание
- Select activity Test 4
  
  Test 4 Тест

Тематический план

Общее

Module 1. Introduction to algorithms and data structures

Module 2. Greedy algorithms. Divide-and-Conquer strategy.

Module 3. Dynamic programming

Module 4. NP-hard problems