Algorithms Diploma Level 3 - Edukite
β’
0 likesβ’23 views
What is an Algorithm? It is a set of rules that allows you to solve computational problems in an organized and definite order. You can also use algorithms on a roadmap to reach a destination. See More: https://bit.ly/2Dib8D4
Recommended
Recommended
More Related Content
Similar to Algorithms Diploma Level 3 - Edukite
Similar to Algorithms Diploma Level 3 - Edukite (20)
More from EduKite
More from EduKite (20)
Recently uploaded
Recently uploaded (20)
Algorithms Diploma Level 3 - Edukite
- 1. 4/17/2019 Algorithms Diploma Level 3 - Edukite https://edukite.org/course/algorithms-diploma-level-3-stanu/ 1/18 HOME / COURSE / TECHNOLOGY / VIDEO COURSE / ALGORITHMS DIPLOMA LEVEL 3 Algorithms Diploma Level 3 ( 9 REVIEWS ) 424 STUDENTS What is an Algorithm? It is a set of rules that allows you to solve computational problems in an organized β¦ οοοοοο ο ο ο ο FREE ξ1 YEAR TAKE THIS COURSE
- 2. 4/17/2019 Algorithms Diploma Level 3 - Edukite https://edukite.org/course/algorithms-diploma-level-3-stanu/ 2/18 ο ο ο ο‘ ξͺLEVEL 3 - DIPLOMA ξΉCOURSE BADGE ξ‘COURSE CERTIFICATE 171NUMBER OF UNITS 0NUMBER OF QUIZZES ξ»1 DAY, 12 HOURS HOME CURRICULUM REVIEWS What is an Algorithm? It is a set of rules that allows you to solve computational problems in an organized and de nite order. You can also use algorithms on a roadmap to reach a destination. This course is important to understand the basics in Algorithm as they are related to all the branches in computer science, development of technological innovations, quantum mechanics, economic market and facing new challenges on developing the current technologies. Assessment 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. Certification 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 Certi cate at a cost of Β£49. Having an Of cial Edukite Certi cation is a great way to celebrate and share your success. You can: Add the certi cate to your CV or resume and brighten up your career Show it to prove your success Β Course Credit:Β Stanford University COURSE CURRICULUM
- 3. 4/17/2019 Algorithms Diploma Level 3 - Edukite https://edukite.org/course/algorithms-diploma-level-3-stanu/ 3/18 ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο Module 01 Why Study Algorithms 00:04:00 Algorithms β Integer Multiplication 00:09:00 Algorithms β Karatsuba Multiplication 00:13:00 Algorithms β βbig-ohβ notation and asymptotic analysis β About the Course 00:17:00 Algorithms β Merge Sort Motivation and Example 00:09:00 Algorithms β Merge Sort Pseudocode 00:13:00 Merge Sort Analysis 00:09:00 Guiding Principles for Analysis of Algorithms 00:15:00 Algorithms β The Gist 00:14:00 Algorithms β Big Oh Notation 00:04:00 Algorithms β Asimptotic Analysis β Basic Examples 00:07:00 Algorithms β Asimptotic Analysis β Big Omega and Theta 00:08:00 Algorithms β Asimptotic Analysis β Additional Examples Review 00:08:00 Module 02 Algorithms β On log n Algorithm for Counting Inversions I 00:13:00 Algorithms β On log n Algorithm for Counting Inversions II 00:17:00 Algorithms β Strassenβs Subcubic Matrix Multiplication Algorithm 00:23:00
- 4. 4/17/2019 Algorithms Diploma Level 3 - Edukite https://edukite.org/course/algorithms-diploma-level-3-stanu/ 4/18 ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο Algorithms β On log n Algorithm for Closest Pair I Advanced Optional 00:32:00 Algorithms β On log n Algorithm for Closest Pair II Advanced Optional 00:19:00 Analyzing divide and conquer algorithms. β Motivation 00:08:00 Analyzing divide and conquer algorithms. β Formal Statement 00:10:00 Analyzing divide and conquer algorithms. β Examples 00:13:00 Analyzing divide and conquer algorithms. β Proof I 00:10:00 Algorithms β Analyzing divide and conquer algorithms. β Interpretation of the 3 Cases 00:11:00 Algorithms β Analyzing divide and conquer algorithms. β Proof II 00:16:00 Module 03 Algorithms β Quicksort -Overview 00:12:00 Algorithms β Quicksort β Partitioning Around a Pivot 00:25:00 Algorithms β Quicksort β Correctness of Quicksort Review Optional 00:11:00 Algorithms β Quicksort β Choosing a Good Pivot 00:22:00 Algorithms β Quicksort β Analysis I A Decomposition Principle 00:22:00 Algorithms β Quicksort β Analysis I A Decomposition Principle 00:12:00 Algorithms β Quicksort β Analysis III Final Calculations 00:09:00 Algorithms β Probability Review I 00:26:00 Algorithms β Probability Review II 00:17:00
- 5. 4/17/2019 Algorithms Diploma Level 3 - Edukite https://edukite.org/course/algorithms-diploma-level-3-stanu/ 5/18 ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο Algorithms β Randomized Selection Algorithm 00:22:00 Algorithms β Randomized Selection Analysis 00:21:00 Algorithms β Deterministic Selection Algorithm 00:17:00 Algorithms β Deterministic Selection Analysis I 00:22:00 Algorithms β Deterministic Selection Analysis II 00:13:00 Module 04 Algorithms β Omega(n log n) Lower Bound for Comparison Based Sorting 00:14:00 Algorithms β Graphs and Minimum Cuts 00:16:00 Algorithms β Graph Representations 00:14:00 Algorithms β Random Contraction Algorithm 00:09:00 Algorithms β Analysis of Contraction Algorithm 00:30:00 Algorithms β Counting Minimum Cuts 00:07:00 Algorithms β Graph Search Overview 00:23:00 Algorithms β Breadth First Search BFS The Basics 00:14:00 Algorithms β BFS and Shortest Paths 00:08:00 Algorithms β BFS and Undirected Connectivity 00:13:00 Algorithms β Depth First Search DFS The Basics 00:07:00 Algorithms β Topological Sort 00:22:00
- 6. 4/17/2019 Algorithms Diploma Level 3 - Edukite https://edukite.org/course/algorithms-diploma-level-3-stanu/ 6/18 ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο Algorithms β Computing Strong Components The Algorithm 00:29:00 Algorithms β Computing Strong Components The Analysis 00:26:00 Module 05 Algorithms β Structure of the Web 00:19:00 Algorithms β Dijkstraβs Shortest Path Algorithm 00:21:00 Algorithms β Dijkstraβs Algorithm Examples 00:13:00 Algorithms β Correctness of Dijkstraβs Algorithm 00:19:00 Algorithms β Dijkstraβs Algorithm Implementation and Running Time 00:26:00 Algorithms β Data Structures Overview 00:05:00 Algorithms β Heaps Implementation Details 00:21:00 Algorithms β Balanced Search Trees Operations and Applications 00:11:00 Algorithms β Binary Search Tree Basics, Part I 00:13:00 Algorithms β Binary Search Tree Basics, Part II 00:30:00 Algorithms β Red Black Trees 00:21:00 Module 06 Algorithms β Rotations Advanced 00:08:00 Algorithms β Insertion in a Red Black Tree 00:15:00 Algorithms β Hash Tables Operations and Applications 00:19:00
- 7. 4/17/2019 Algorithms Diploma Level 3 - Edukite https://edukite.org/course/algorithms-diploma-level-3-stanu/ 7/18 ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο Algorithms β Hash Tables Implementation Details, Part I 00:19:00 Algorithms β Hash Tables Implementation Details, Part II 00:22:00 Algorithms β Pathological Data Sets and Universal Hashing Motivation 00:22:00 Algorithms β Universal Hashing De nition and Example Advanced Optional 00:26:00 Algorithms β Universal Hashing Analysis of Chaining Advanced Optional 00:19:00 Algorithms β Hash Table Performance with Open Addressing Advanced Optional 00:16:00 Algorithms β Bloom Filters The Basics 00:15:00 Algorithms β Bloom Filters Heuristic Analysis 00:13:00 Algorithms β Application Internet Routing 00:11:00 Algorithms β Application Sequence Alignment 00:09:00 Algorithms β Introduction to Greedy Algorithms 00:13:00 Algorithms β Application Optimal Caching 00:11:00 Algorithms β two motivating applications Problem De nition 00:06:00 Module 07 Algorithms β A Greedy Algorithm 00:13:00 Algorithms β Correctness Proof Part I 00:07:00 Algorithms β Correctness Proof Part II 00:05:00
- 8. 4/17/2019 Algorithms Diploma Level 3 - Edukite https://edukite.org/course/algorithms-diploma-level-3-stanu/ 8/18 ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο Algorithms β Handling Ties 00:07:00 Algorithms β MST Problem De nition 00:11:00 Algorithms β Primβs MST Algorithm 00:08:00 Algorithms β Correctness Proof I 00:16:00 Algorithms β Proof of Cut Property 00:12:00 Algorithms β Correctness Proof II 00:08:00 Algorithms β Fast Implementation I 00:15:00 Algorithms β Fast Implementation II 00:10:00 Algorithms β Kruskalβs MST Algorithm 00:07:00 Algorithms β Correctness of Kruskalβs Algorithm 00:09:00 Module 08 Algorithms β Implementing Kruskalβs Algorithm via Union Find I 00:09:00 Algorithms β Implementing Kruskalβs Algorithm via Union Find II 00:14:00 Algorithms β MSTs State of the Art and Open Questions 00:09:00 Algorithms β Application to Clustering 00:12:00 Algorithms β Correctness of Clustering Algorithm 00:10:00 Algorithms β Lazy Unions 00:10:00 Algorithms β Union by Rank 00:12:00
- 9. 4/17/2019 Algorithms Diploma Level 3 - Edukite https://edukite.org/course/algorithms-diploma-level-3-stanu/ 9/18 ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο Algorithms β Analysis of Union by Rank 00:15:00 Algorithms β Path Compression 00:15:00 Algorithms β Path Compression The Hopcroft Ullman Analysis I 00:09:00 Algorithms β Path Compression The Hopcroft Ullman Analysis II 00:12:00 Module 09 Algorithms β The Ackermann Function 00:16:00 Algorithms β Path Compression Tarjanβs Analysis I 00:14:00 Algorithms β Path Compression Tarjanβs Analysis II 00:15:00 Algorithms β Huffman codes β Introduction and Motivation 00:09:00 Algorithms β Huffman codes β Problem De nition 00:10:00 Algorithms β Huffman codes β A Greedy Algorithm 00:17:00 Algorithms β Huffman codes β A More Complex Example 00:04:00 Algorithms β Huffman codes β Correctness Proof I 00:10:00 Algorithms β Huffman codes β Correctness Proof II 00:13:00 Module 10 Algorithms β Introduction Weighted Independent Sets in Path Graphs 00:08:00 Algorithms β WIS in Path Graphs Optimal Substructure 00:09:00 Algorithms β WIS in Path Graphs A Linear Time Algorithm 00:10:00
- 10. 4/17/2019 Algorithms Diploma Level 3 - Edukite https://edukite.org/course/algorithms-diploma-level-3-stanu/ 10/18 ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο Algorithms β WIS in Path Graphs A Reconstruction Algorithm 00:07:00 Algorithms β Principles of Dynamic Programming 00:08:00 Algorithms β The Knapsack Problem 00:10:00 Algorithms β The Knapsack Problem β A Dynamic Programming Algorithm 00:10:00 Algorithms β The Knapsack Problem β example Review 00:13:00 Algorithms β Sequence Alignment β Optimal Substructure 00:14:00 Algorithms β Sequence Alignment β A Dynamic Programming Algorithm 00:12:00 Algorithms β optimal binary search trees β Problem De nition 00:12:00 Algorithms β optimal binary search trees β Optimal Substructure 00:10:00 Algorithms β optimal binary search trees β Proof of Optimal Substructure 00:07:00 Module 11 Algorithms β optimal binary search trees β A Dynamic Programming Algorithm I 00:10:00 Algorithms β optimal binary search trees β A Dynamic Programming Algorithm II 00:09:00 Algorithms β Single Source Shortest Paths, Revisted 00:11:00 Algorithms β The Bellman-Ford algorithm β Optimal Substructure 00:11:00 Algorithms β The Bellman-Ford algorithm β The Basic Algorithm I 00:09:00 Algorithms β The Bellman-Ford algorithm β The Basic Algorithm II 00:11:00
- 11. 4/17/2019 Algorithms Diploma Level 3 - Edukite https://edukite.org/course/algorithms-diploma-level-3-stanu/ 11/18 ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο Algorithms β The Bellman-Ford algorithm β Detecting Negative Cycles 00:09:00 Algorithms β The Bellman-Ford algorithm β A Space Optimization 00:13:00 Algorithms β The Bellman-Ford algorithm β Internet Routing I 00:11:00 Algorithms β The Bellman-Ford algorithm β Internet Routing II 00:07:00 Module 12 Algorithms β Problem De nition I 00:07:00 Algorithms β Problem De nition II 00:12:00 Algorithms β The Floyd Warshall Algorithm 00:13:00 Algorithms β A Reweighting Technique 00:14:00 Algorithms β Johnsonβs Algorithm I 00:11:00 Algorithms β Johnsonβs Algorithm II 00:12:00 Algorithms β Polynomial Time Solvable Problems 00:14:00 Algorithms β Reductions and Completeness 00:14:00 Algoritjms β De nition and Interpretation of NP Completeness I 00:11:00 Algorithms β De nition and Interpretation of NP Completeness II 00:08:00 Algorithms β The P vs NP Question 00:09:00 Algorithms β Algorithmic Approaches to NP Complete Problems 00:13:00 Algorithms β The Vertex Cover Problem 00:09:00
- 12. 4/17/2019 Algorithms Diploma Level 3 - Edukite https://edukite.org/course/algorithms-diploma-level-3-stanu/ 12/18 ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο Module 13 Algorithms β Smarter Search for Vertex Cover I 00:10:00 Algorithms β Smarter Search for Vertex Cover II 00:08:00 Algorithms β The Traveling Salesman Problem 00:15:00 Algorithms β A Dynamic Programming Algorithm for TSP 00:12:00 Algorithms β A Greedy Knapsack Heuristic 00:14:00 Algorithms β Analysis of a Greedy Knapsack Heuristic I 00:07:00 Algorithms β Analysis of a Greedy Knapsack Heuristic II 00:10:00 Algorithms β A Dynamic Programming Heuristic for Knapsack 00:12:00 Algorithms β Knapsack via Dynamic Programming, Revisited 00:10:00 Algorithms β Ananysis of Dynamic Programming Heuristic 00:15:00 Module 14 Algorithms β The Maximum Cut Problem I 00:08:00 Algorithms β The Maximum Cut Problem II 00:09:00 Algorithms β Principles of Local Search I 00:09:00 Algorithms β Principles of Local Search II 00:10:00 Algorithms β Principles of Local Search II 00:15:00 Algorithms β Random Walks on a Line 00:16:00
- 13. 4/17/2019 Algorithms Diploma Level 3 - Edukite https://edukite.org/course/algorithms-diploma-level-3-stanu/ 13/18 ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ£ ο ξ· ο ξ· ο Algorithms β Analysis of Papadimitriouβs Algorithm 00:15:00 Algorithms β Stable Matching Optional 00:15:00 Algorithms β Matchings, Flows, and Braessβs Paradox Optional 00:14:00 Algorithms β Linear Programming and Beyond Optional 00:11:00 Algorithms β Epilogue 00:01:00 Assessment Submit Your Assignment 00:00:00 Certi cation 00:00:00 COURSE REVIEWS 4.7 9 ratings οοοοοο ο ο ο ο
- 14. 4/17/2019 Algorithms Diploma Level 3 - Edukite https://edukite.org/course/algorithms-diploma-level-3-stanu/ 14/18 5 STARS 4 STARS 3 STARS 2 STARS 1 STARS 0 0 0 0 0 NO REVIEWS FOUND FOR THIS COURSE. RELATED COURSES
- 15. 4/17/2019 Algorithms Diploma Level 3 - Edukite https://edukite.org/course/algorithms-diploma-level-3-stanu/ 15/18 ο833 Six Sigma Diploma Level 3 FREE οοοοοο ο ο ο ο ο964 Diploma in Power System Engineering FREE οοοοοο ο ο ο ο
- 16. 4/17/2019 Algorithms Diploma Level 3 - Edukite https://edukite.org/course/algorithms-diploma-level-3-stanu/ 16/18 ο364 Modern Construction Materials FREE οοοοοο ο ο ο ο 424 STUDENTS ENROLLED
- 17. 4/17/2019 Algorithms Diploma Level 3 - Edukite https://edukite.org/course/algorithms-diploma-level-3-stanu/ 17/18 BEST RECOMMEND COURSES ( 9 REVIEWS ) 1909: The Peopleβs Budget 1253 STUDENTS οοοοοο ο ο ο ο ( 6 REVIEWS ) 21st Century Marketing 720 STUDENTS οοοοοο ο ο ο ο ( 7 REVIEWS ) 70-697 β Con guring Windows Devices 1334 STUDENTS οοοοοο ο ο ο ο SUBSCRIBE TO OUR NEWSLETTER Get top tips & guidance from our in-house study abroad experts Your Email Submit
- 18. 4/17/2019 Algorithms Diploma Level 3 - Edukite https://edukite.org/course/algorithms-diploma-level-3-stanu/ 18/18 USEFUL LINKS About Terms & Conditions Privacy Policy Cookie Policy Contact INQUIRY οΉΒ 3 Lower Thames Street,London,EC4R 6HE. ο 020 3934 9675 ο info@edukite.org COPYRIGHT Β© BYΒ EDUKITE ο ο ο ο‘