Algorithms: Design and Analysis - 1
What you'll learn
- "Big-oh" notation
- Sorting and Searching
- Divide and Conquer (master method, integer and matrix multiplication, closest pair)
- Randomized Algorithms (QuickSort, contraction algorithm for min cuts)
- Data Structures (heaps, balanced search trees, hash tables, bloom filters)
- Graph Primitives (applications of BFS and DFS, connectivity, shortest paths)
This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists.
Specific topics in the course include: "Big-oh" notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), randomized algorithms (QuickSort, contraction algorithm for min cuts), data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of BFS and DFS, connectivity, shortest paths).
Learners will practice and master the fundamentals of algorithms through several types of assessments. There are 6 multiple choice quizzes to test your understanding of the most important concepts. There are also 6 programming assignments, where you implement one of the algorithms covered in lecture in a programming language of your choosing. The course concludes with a multiple-choice final. There are no assignment due dates and you can work through the course materials and assignments at your own pace.
This is the 1st course in the intermediate, undergraduate-level offering that makes up the larger Algorithms MicroBachelors program. We recommend taking them in order, unless you have a background in these areas already and feel comfortable skipping ahead.
Comments