Data structures: Measuring and Optimizing Performance

Description

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? In this course, you will use and analyze data structures that are used in industry-level applications, such as linked lists, trees, and hashtables. You will explain how these data structures make programs more efficient and flexible. You will apply asymptotic Big-O analysis to describe the performance of algorithms and evaluate which strategy to use for efficient data retrieval, addition of new data, deletion of elements, and/or memory usage. The program you will build throughout this course allows its user to manage, manipulate and reason about large sets of textual data. This course is designed around the same video series as in our first course in this specialization, including explanations of core content, learner videos, student and engineer testimonials, and support videos — to better allow you to choose your own path through the course!



Have you tried this resource? Help someone out by sharing your thoughts!

Write a review

More Ways to Learn Database Management

MongoDB Tutorials
CodeDamn
MongoDB Tutorials
College | Free
Database Management Essentials
University of Colorado System
Database Management Essentials
College | Free
Introduction to Meteor.js Development
University of London, Goldsmiths, University of London
Introduction to Meteor.js Development
College | Free
Data Management and Visualization
Wesleyan University
Data Management and Visualization
College | Free