• No products in the cart.

The aim of this course is to provide an introduction to mathematical modeling of computational problems. It is an undergraduate course. It covers topics such as the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming. In addition to that, it introduces basic performance measures and analysis techniques for these problems.


This course does not involve any written exams. Students need to answer 5 assignment questions to complete the course, the answers will be in the form of written work in pdf or word. Students can write the answers in their own time. Each answer needs to be 200 words (1 Page). Once the answers are submitted, the tutor will check and assess the work.


Edukite courses are free to study. To successfully complete a course you must submit all the assignment of the course as part of the assessment. Upon successful completion of a course, you can choose to make your achievement formal by obtaining your Certificate at a cost of £49.

Having an Official Edukite Certification is a great way to celebrate and share your success. You can:

  • Add the certificate to your CV or resume and brighten up your career
  • Show it to prove your success



Course Credit: MIT

Course Curriculum

Module 01
Introduction to Algorithms 00:10:00
More document distance, mergesort 00:10:00
Airplane scheduling, binary search trees 00:10:00
Balanced binary search trees 00:20:00
Hashing I chaining, hash functions 00:10:00
Hashing II table doubling, Karp-Rabin 00:10:00
Hashing III open addressing 00:10:00
Sorting I heaps 00:10:00
Sorting II heaps 00:15:00
Sorting III lower bounds, linear-time sorting 00:10:00
Sorting IV stable sorting, radix sort 00:10:00
Searching I graph search, representations, and applications 00:20:00
Module 02
Searching II breadth-first search and depth-first search 00:10:00
Searching III topological sort and NP-completeness 00:10:00
Shortest paths I intro 00:15:00
Shortest paths II Bellman-Ford 00:10:00
Shortest paths III Dijkstra 00:10:00
Shortest paths IV Dijkstra speedups 00:10:00
Dynamic programming I memoization, Fibonacci, Crazy Eights, guessing 00:10:00
Dynamic programming II longest common subsequence, parent pointers 00:10:00
Dynamic programming III text justification, parenthesization, knapsack, pseudopolynomial time, Tetris training 00:10:00
Dynamic programming IV piano fingering, structural DP (trees), vertex cover, dominating set, and beyond 00:10:00
Numerics I 00:10:00
Numerics II 00:10:00
Beyond 6.006 follow-on classes, geometric folding algorithms 00:05:00
Submit Your Assignment 00:00:00
Certification 00:00:00

Course Reviews


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

No Reviews found for this course.

©2021 Edukite. All Rights Resereved
Edukite is A Part Of Ebrahim College, Charity Commission
Reg No 110841