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.64%
- 4 stars14.61%
- 3 stars1.87%
- 2 stars0.41%
- 1 star0.45%
TOP REVIEWS FROM DATA STRUCTURES AND PERFORMANCE
Very solid review of data structures. In fact, I learned a lot of new things along the way like how to benchmark test Java code and how to properly use JUnit and other unit testing frameworks.
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.
I have learned a lot of things from this course. Earlier I couldn't feel the real necessity of data structures. In this course I have seen differences in performance of my own code.
This is a great course. If you ever feared (like me) about implementations of linked-list, trees, tries, you should definitely join this! It would make these things much simpler!!!
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.