Title: Data Structures Fundamentals

Location: US

Company: The University of California, San Diego

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.

Basics of data structures including their fundamental building blocks: arrays and linked lists

How to use Dynamic arrays

A very powerful and widely used technique called hashing and its applications

How to use priority queues to efficiently schedule jobs, in the context of a computer operating system or real life

Basic structure of binary search trees - AVL trees and Splay trees

Applications of data structures

Learn about data structures that are used in computational thinking – both basic and advanced.

Duration: 6 weeks

Skills:
- Algorithms
- C++ (Programming Language)
- Computational Thinking
- Data Structures
- Java (Programming Language)
- Operations
- Priority Queue
- Python (Programming Language)

Curriculum:
- Module 1: Basic Data Structures
- Module 2: Dynamic Arrays and Amortized Analysis
- Module 3: Priority Queues and Disjoint Set Union

- Module 6: Binary Search Trees