Skip to main content
You are currently using guest access (
Log in
)
Module 3. Dynamic progamming
Home
Courses
Весенний семестр
Фундаментальная информатика и ИТ
ADS
Module 3. Dynamic progamming
Section outline
◄
Module 2.Greedy algorithms. Divide-and-Conquer strategy.
Module 4. NP-hard problems
►
Select activity Lecture 11. Dynamic programming: general concepts and scheme
Lecture 11. Dynamic programming: general concepts and scheme
File
Select activity Lecture 12. Edit Distance, the Longest Common Subsequence
Lecture 12. Edit Distance, the Longest Common Subsequence
File
Select activity Assignment 5. Edit distance
Assignment 5. Edit distance
Select activity Test 3 (online)
Test 3 (online)
Quiz
Select activity Test 3
Test 3
Assignment
◄
Module 2.Greedy algorithms. Divide-and-Conquer strategy.
Jump to...
Main course page
General
Module 1. Introduction to algorithms and data structures
Module 2.Greedy algorithms. Divide-and-Conquer strategy.
Module 3. Dynamic progamming
Module 4. NP-hard problems
Module 4. NP-hard problems
►