UCSanDiegoX: Algorithmic Design and Techniques
|
Learn how to design algorithms, solve computational problems and implement solutions efficiently.
About this course
In this course, part of the Algorithms and Data Structures MicroMasters program, you will learn basic algorithmic techniques and ideas for computational problems, which arise in practical applications such as sorting and searching, divide and conquer, greedy algorithms and dynamic programming.
This course will cover theories, including:
how to sort data and how it helps for searching;
how to break a large problem into pieces and solve them recursively;
when it makes sense to proceed greedily;
how dynamic programming is used in genomic studies.
You will practice solving computational problems, designing new algorithms, and implementing solutions efficiently (so that they run in less than a second).
At a Glance:
Institution: UCSanDiegoX
Subject: Computer Science
Level: Intermediate
Prerequisites:
Basic knowledge of at least one programming language: loops, arrays, stacks, recursion.
Basic knowledge of mathematics: proof by induction, proof by contradiction.
Language: English
Video Transcript: English
Associated programs:
MicroMasters® Program in Algorithms and Data Structures
Associated skills:Greedy Algorithm, Data Structures, Sorting, Algorithms, Dynamic Programming, Divide And Conquer, Algorithm Design
User Reviews
Be the first to review “UCSanDiegoX: Algorithmic Design and Techniques”
Related Products
ETHx: Autonomous Mobile Robots
Basic concepts and algorithms for locomotion, perception, and intelligent navigation.
CS50’s Introduction to Computer Science
An introduction to the intellectual enterprises of computer science and the art of programming.
DelftX: AI in Practice: Applying AI
Learn about the implementation and practical aspects of Artificial Intelligence and how to write a plan for applying AI in your own organization in a step-by-step manner.
GTx: Data Structures & Algorithms IV: Pattern Matching, Dijkstra’s, MST, and Dynamic Programming Algorithms
Delve into Pattern Matching algorithms from KMP to Rabin-Karp. Tackle essential algorithms that traverse the graph data structure like Dijkstra’s Shortest Path. Study algorithms that construct a Minimum Spanning Tree (MST) from a graph. Explore Dynamic Programming algorithms. Use the course visualization tool to understand the algorithms and their performance.
HarvardX: Fundamentals of TinyML
Focusing on the basics of machine learning and embedded systems, such as smartphones, this course will introduce you to the “language” of TinyML.
GTx: Data Structures & Algorithms II: Binary Trees, Heaps, SkipLists and HashMaps
Become familiar with nonlinear and hierarchical data structures. Study various tree structures: Binary Trees, BSTs and Heaps. Understand tree operations and algorithms. Learn and implement HashMaps that utilize key-value pairs to store data. Explore probabilistic data structures like SkipLists. Course tools help visualize the structures and performance.
There are no reviews yet.