About this course: 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? This is an intermediate Java course. We recommend this course to learners who have previous experience in software development or a background in computer science, and in particular, we recommend that you have taken the first course in this specialization (which also requires some previous experience with Java). 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 is an intermediate Java course, and we will build on your prior knowledge. 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!
Who is this class for: This is an intermediate software development course. We recommend this course to learners who have previous experience in programming, specifically in Java, or a background in computer science and who want to take the next step in designing data structures for more efficient and more complex algorithms.
Taught by: Christine Alvarado, Associate Teaching Professor
Computer Science and Engineering
Taught by: Mia Minnes, Assistant Teaching Professor
Computer Science and Engineering
Taught by: Leo Porter, Assistant Teaching Professor
Computer Science and Engineering
| Basic Info |
Course 2 of 5 in the
Object Oriented Java Programming: Data Structures and Beyond Specialization.
|
| Level | Intermediate |
| Commitment | 6 weeks of study, 6-10 hours/week |
| Language | English |
| How To Pass | Pass all graded assignments to complete the course. |
| User Ratings |
Each course is like an interactive textbook, featuring pre-recorded videos, quizzes and projects.
Connect with thousands of other learners and debate ideas, discuss course material, and get help mastering concepts.
Earn official recognition for your work, and share your success with friends, colleagues, and employers.
| Audit | Purchase Course | |
|---|---|---|
| Access to course materials | Available | Available |
| Access to graded materials | Not available | Available |
| Receive a final grade | Not available | Available |
| Earn a shareable Course Certificate | Not available | Available |
detailed and condense lecture, lots of hands on practical project
Nice course with extensive tutoring. Thank you instructors!!
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
Coursera provides universal access to the world’s best education, partnering with top universities and organizations to offer courses online.
M
Excellent course! Strongly recommended!