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
GalileoX: Java Programming Fundamentals
Your career as a program developer starts here. Gain entry-level programing skills in Java language, and prepare yourself to handle any task that is required in any programming job.
MITx: Understanding the World Through Data –
Become a data explorer – learn how to leverage data and basic machine learning algorithms to understand the world.
GTx: Introduction to Object-Oriented Programming with Java II: Object-Oriented Programming and Algorithms
Learn the basics of object-oriented programming and algorithms.
GTx: Data Structures & Algorithms I: ArrayLists, LinkedLists, Stacks and Queues
Work with the principles of data storage in Arrays, ArrayLists & LinkedList nodes. Understand their operations and performance with visualizations. Implement low-level linear, linked data structures with recursive methods, and explore their edge cases. Extend these structures to the Abstract Data Types, Stacks, Queues and Deques.
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.