Home » Course Layouts » Free Course Layout Udemy

This course is an introduction to mathematical modeling of computational problems, as well as common algorithms, algorithmic paradigms, and data structures used to solve these problems.

0

1

English

English [CC]

FREE

Description

It emphasizes the relationship between algorithms and programming and introduces basic performance measures and analysis techniques for these problems.

Course content

  • Introduction notes Unlimited
  • Data Structures notes Unlimited
  • Sorting notes Unlimited
  • Hashing notes Unlimited
  • Linear Sorting notes Unlimited
  • Binary Trees, Part 1 notes Unlimited
  • Binary Trees, Part 2: AVL notes Unlimited
  • Binary Heaps notes Unlimited
  • Breadth-First Search notes Unlimited
  • Depth-First Search notes Unlimited
  • Weighted Shortest Paths notes Unlimited
  • Bellman-Ford notes Unlimited
  • Dijkstra’s Algorithm notes Unlimited
  • ASP & Johnson’s Algorithm notes Unlimited
  • Dynamic Programming, Part 1: SRBOT, Fib, DAGs, Bowling notes Unlimited
  • Dynamic Programming, Part 2: LCS, LIS, Coins notes Unlimited
  • Dynamic Programming, Part 3 notes Unlimited
  • Dynamic Programming, Part 4: Rods, Subsetsums, Pseudopolynomial notes Unlimited
  • Complexity notes Unlimited
  • Course Review notes Unlimited

N.A

0 ratings
  • 5 stars0
  • 4 stars0
  • 3 stars0
  • 2 stars0
  • 1 stars0

No Reviews found for this course.

Instructor

Massachusetts Institute of Technology
Profile Photo
5 5
1
1916
1520

Explore Free Courses

Access valuable knowledge without any cost.