UCSanDiegoX: Data Structures Fundamentals
|
Learn about data structures that are used in computational thinking – both basic and advanced.
About this course
A good algorithm usually comes together with a set of good data structures that allow the algorithm to manipulate the data efficiently. In this course, part of the Algorithms and Data Structures MicroMasters program, we consider the common data structures that are used in various computational problems. You will learn how these data structures are implemented in different programming languages and will practice implementing them in our programming assignments. This will help you to understand what is going on inside a particular built-in implementation of a data structure and what to expect from it. You will also learn typical use cases for these data structures.
A few examples of questions that we are going to cover in this course are:
What is a good strategy of resizing a dynamic array?
How priority queues are implemented in C++, Java, and Python?
How to implement a hash table so that the amortized running time of all operations is O(1) on average?
What are good strategies to keep a binary tree balanced?
We look forward to seeing you in this course! We know it will make you a better programmer.
At a Glance:
Institution: UCSanDiegoX
Subject: Computer Science
Level: Intermediate
Prerequisites:
Basic grasp of:
One programming language (C,C++,C#,Haskell,Java,JavaScript,Python2/3,Ruby,Scala)-loop, array, stack, recursion
Math-proof by induction and contradiction
The Algorithmic Design and Techniques class
Language: English
Video Transcript: English
Associated programs:
MicroMasters® Program in Algorithms and Data Structures
Associated skills:Computational Thinking, Operations, Algorithms, C++ (Programming Language), Priority Queue, Java (Programming Language), Python (Programming Language), Data Structures
What You’ll Learn:
About this course
A good algorithm usually comes together with a set of good data structures that allow the algorithm to manipulate the data efficiently. In this course, part of the Algorithms and Data Structures MicroMasters program, we consider the common data structures that are used in various computational problems. You will learn how these data structures are implemented in different programming languages and will practice implementing them in our programming assignments. This will help you to understand what is going on inside a particular built-in implementation of a data structure and what to expect from it. You will also learn typical use cases for these data structures.
A few examples of questions that we are going to cover in this course are:
What is a good strategy of resizing a dynamic array?
How priority queues are implemented in C++, Java, and Python?
How to implement a hash table so that the amortized running time of all operations is O(1) on average?
What are good strategies to keep a binary tree balanced?
We look forward to seeing you in this course! We know it will make you a better programmer.
User Reviews
Be the first to review “UCSanDiegoX: Data Structures Fundamentals”
Related Products
UCSanDiegoX: Data Structures Fundamentals
Learn about data structures that are used in computational thinking – both basic and advanced.
AdelaideX: Big Data Fundamentals
Learn how big data is driving organisational change and essential analytical tools and techniques, including data mining and PageRank algorithms.
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.
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.
TokyoTechX: Introduction to Computer Science and Programming
The term “Computation” refers to the action performed by a computer. A computation can be a basic operation and it can also be a sophisticated computer simulation requiring a large amount of data and substantial resources. This course aims at introducing learners with no prior knowledge to the basic key concepts of computer science. By following the lectures and exercises of this course, you will gain an understanding of algorithms by programming using the language Ruby.
There are no reviews yet.