How do Java programs deal with vast quantities of data? Many of the data structures and algorithms that work with introductory toy examples break when applications process real, large data sets. Efficiency is critical, but how do we achieve it, and how do we even measure it?
About this Course
Skills you will gain
- Trees (Data Structures)
- Data Structure
- Linked List
- Binary Tree
Syllabus - What you will learn from this course
Introduction to the Course
Working with Strings
Efficiency Analysis and Benchmarking
Interfaces, Linked Lists vs. Arrays, and Correctness
- 5 stars82.63%
- 4 stars14.62%
- 3 stars1.87%
- 2 stars0.41%
- 1 star0.45%
TOP REVIEWS FROM DATA STRUCTURES AND PERFORMANCE
I really liked this course and the way it was taught. Although I am a CS major, I really learnt a lot of other stuff from this course apart from learning the core content of Data Structures.
This was a challenging course for me. But in the best way possible! The programming challenges are interesting and the application of asymptotics is made clear and relevant throughout.
The course curriculum is well designed and teaches students the basic data structures needed to be a successful software engineer. The project is good, and the weekly assignments are challenging.
This course helped understand the utility of data structures in software and how to benchmark algorithms in order to compare their performance so as to choose the most efficient algorithm
Frequently Asked Questions
When will I have access to the lectures and assignments?
What will I get if I subscribe to this Specialization?
Is financial aid available?
More questions? Visit the Learner Help Center.