Carnegie Mellon University
Carnegie Mellon University Logo

Introduction to Algorithms and Data Structures 

  • Private University
  • Institute Icon140 acre campus
  • Estd. 1900

Introduction to Algorithms and Data Structures
 at 
Carnegie Mellon University 
Overview

Algorithmic Foundations: Unveiling the World of Data Structures – Essential Introduction for Crafting Efficient Solutions and Mastering Problem-solving Techniques.

Duration

10 weeks

Mode of learning

Online

Difficulty level

Intermediate

Official Website

Go to Website External Link Icon

Course Level

UG Certificate

Introduction to Algorithms and Data Structures
 at 
Carnegie Mellon University 
Highlights

  • Try-it Activities
  • Live Office Hours
  • Knowledge Checks
  • Discussion Board Activities
  • Programming Assignments
  • Earn a Certification after completion
Read more
Details Icon

Introduction to Algorithms and Data Structures
 at 
Carnegie Mellon University 
Course details

Who should do this course?
  • Early-career technology grads who would like to build their skills in a way that has a practical application in the jobs marketplace.
  • Software engineers and other technology professionals who want a hands-on understanding of advanced algorithms and data structures.
What are the course deliverables?
  • Explain the key concepts related to algorithms and data structures
  • Model computational problems and design algorithms
  • Apply standardized algorithmic building blocks
  • Analyze algorithms to verify correctness and efficiency
  • Explore real-world applications of algorithms and data structures
  • Practice implementing algorithms using Python
More about this course
  • There is a rapidly growing demand for technology professionals who understand the ways in which algorithms drive today’s world. The number of technical professionals who list “algorithms and data structures” among their skills is increasing by 25% year over year, according to LinkedIn Insights.
  • Keep pace with this rapidly growing field by enrolling in Algorithms and Data Structures, an online program offered by Carnegie Mellon University's School of Computer Science Executive Education.
  • Participants receive an in-depth understanding of the design principles behind real-world, problem-solving algorithms, as well as the data structures that support them.

Introduction to Algorithms and Data Structures
 at 
Carnegie Mellon University 
Curriculum

Module 1: Introduction to Algorithms

Illustrating the key components of an algorithm and the notations used for time complexity

Performing recurrence analysis and analyzing the time complexity of merge-sort and quick-select algorithms

Module 2: Concrete Models and Tight Upper and Lower Bounds

Explaining the concept of concrete models as well as tight upper and lower bounds

Applying the information-theoretic and adversary techniques to prove upper and lower bounds of computational problems

Module 3: Greedy Algorithms

Explaining what a greedy algorithm is and how to design such algorithms

Proving the optimality of greedy algorithms

Module 4: Dynamic Programming

Developing and implementing dynamic programming

Comparing the bottom-up and the top-down approaches to dynamic programming.

Module 5: Hashing and Streaming

Examining the properties of hashing and applying it to the dynamic dictionary problems

Using hashing to solve problems on data streams

Module 6: Network Flows

Finding the maximum flow and minimum cut of a given network

Designing and implementing network flow algorithms to solve problems

Module 7: Linear Programming

Exploring LP solutions for the min-cut max-flow and the operations research problems

Applying LP algorithms, such as the Simplex algorithm

Module 8: NP-Completeness

Proving a problem is NP-complete

Developing approximation algorithms to solve NP-complete problems

Faculty Icon

Introduction to Algorithms and Data Structures
 at 
Carnegie Mellon University 
Faculty details

DAVID P. WOODRUFF
David Woodruff is an associate professor in CMU's Computer Science Department. A recipient of the 2021 Herbert Simon Award for Teaching Excellence in Computer Science, he has taught algorithm programs since joining CMU in 2017.

Introduction to Algorithms and Data Structures
 at 
Carnegie Mellon University 
Entry Requirements

Eligibility criteriaUp Arrow Icon
Conditional OfferUp Arrow Icon
  • Yes

Other courses offered by Carnegie Mellon University

– / –
    – / –
45.86 L
18 months
A++ Shiksha Grade
#4 THE
– / –
  • Aug' 25
48.46 L
– / –
    – / –
46.1 L
Star Icon5.02 years
A++ Shiksha Grade
#4 THE
– / –
  • Aug' 25
48.46 L
View Other 221 CoursesRight Arrow Icon

Introduction to Algorithms and Data Structures
 at 
Carnegie Mellon University 
Contact Information

Address

5000 Forbes Ave, Pittsburgh, PA 15213, USA
Pittsburgh ( Pennsylvania)

Go to College Website ->