Course Description

This course is a part of the Algorithms and Data Structures MicroMasters program and focuses on the common data structures essential for various computational problems. It delves into the implementation of these data structures across various programming languages and provides practical assignments for hands-on learning. The course aims to give a deep understanding of internal workings of data structures and their application in everyday programming.

What Students Will Learn

• Fundamentals of data structures like arrays and linked lists.
• Implementation and applications of dynamic arrays and hashing.
• Utilization of priority queues in system operations and real life scenarios.
• Understanding and implementing binary search trees including AVL and Splay trees.
• Real-world applications of various data structures learned throughout the course.

Prerequisites

Students need a basic knowledge of:

• A programming language such as C, C++, Java, Python, etc., covering loops, arrays, stacks, and recursion.
• Mathematical proof methods including induction and contradiction.
• Prior completion of the "Algorithmic Design and Techniques" course is recommended.

Course Content

• Understanding and implementing various fundamental data structures (Arrays, Linked Lists).
• Exploring and applying dynamic arrays and amortized analysis.
• Working with priority queues and understanding their practical implementations in different programming languages.
• Studying hashing and its applications in programming and data storage.
• Learning about binary search trees and methods to maintain their balance for optimal operations.

Who should take this course?

This course is designed for intermediate students who have a basic understanding of programming and mathematics, and are looking to enhance their knowledge in algorithms and data structures. It's particularly beneficial for computer science students, software developers, and programming enthusiasts interested in effective data handling and algorithm creation.

Real-world Application of Skills

The skills taught in this program can significantly improve programming efficiency and problem-solving capabilities which are crucial for software development and analysis. Implementing efficient data structures can optimize performance for software applications, enhance algorithm efficiency, and are essential in fields like data analytics, machine learning, and systems programming.

Syllabus

• Module 1: Basic Data Structures (Arrays, Linked Lists, Stacks, Queues, Trees)
• Module 2: Dynamic Arrays and Amortized Analysis
• Module 3: Priority Queues and Disjoint Set Union
• Modules 4 and 5: Hash Tables
• Module 6: Binary Search Trees