Mathematical modeling of computation problems is a subject that deals with algorithms. Being introduced to algorithms will let you understand how programming works to deliver the data you need and solve mathematical equations.
You will be introduced to types of computation problems and solution in this [course_title] to let you experience real-life situations involving algorithms. You will be exposed to common algorithms, algorithmic paradigms, and data structures in this course.
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
|Lecture 1: Algorithmic Thinking, Peak Finding||00:53:00|
|Lecture 2: Models of Computation, Document Distance||00:49:00|
|Lecture 3: Insertion Sort, Merge Sort||00:51:00|
|Lecture 4: Heaps and Heap Sort||00:52:00|
|Lecture 5: Binary Search Trees, BST Sort||00:52:00|
|Lecture 6: AVL Trees, AVL Sort||00:52:00|
|Lecture 7: Counting Sort, Radix Sort, Lower Bounds for Sorting||00:52:00|
|Lecture 8: Hashing with Chaining||00:51:00|
|Lecture 9: Table Doubling, Karp-Rabin||00:53:00|
|Lecture 10: Open Addressing, Cryptographic Hashing||00:51:00|
|Lecture 11: Integer Arithmetic, Karatsuba Multiplication||00:47:00|
|Lecture 12: Square Roots, Newton’s Method||00:51:00|
|Lecture 13: Breadth-First Search (BFS)||00:50:00|
|Lecture 14: Depth-First Search (DFS), Topological Sort||00:50:00|
|Lecture 15: Single-Source Shortest Paths Problem||00:53:00|
|Lecture 16: Dijkstra||00:51:00|
|Lecture 17: Bellman-Ford||00:49:00|
|Lecture 18: Speeding up Dijkstra||00:53:00|
|Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths||00:52:00|
|Lecture 20: Dynamic Programming II: Text Justification, Blackjack||00:52:00|
|Lecture 21: Dynamic Programming III: Parenthesization, Edit Distance, Knapsack||00:52:00|
|Lecture 22: Dynamic Programming IV: Guitar Fingering, Tetris, Super Mario Bros.||00:49:00|
|Lecture 23: Computational Complexity||00:51:00|
|Lecture 24: Topics in Algorithms Research||00:47:00|
|Submit Your Assignment||00:00:00|
No Reviews found for this course.