Об этом курсе: 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!
Для кого этот курс: 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.
Автор: University of California, San Diego
Преподаватели: Christine Alvarado, Associate Teaching Professor
Computer Science and Engineering
Преподаватели: Mia Minnes, Assistant Teaching Professor
Computer Science and Engineering
Преподаватели: Leo Porter, Assistant Teaching Professor
Computer Science and Engineering
| Основные сведения | Course 4 of 4 in the Object Oriented Programming in Java Specialization |
| Уровень | Intermediate |
| Выполнение | 6 weeks of study, 6-10 hours/week |
| Язык | English |
| Как пройти курс | Чтобы пройти курс, выполните все оцениваемые задания. |
| Оценки пользователей |
Программа курса
НЕДЕЛЯ 1
Introduction to the Course
Welcome to the first module in the second course of our Intermediate Java Programming Specialization. We'll start with introductions again: to ourselves, the Google engineers, and the structure of the course. After the introduction we'll have a short warm up to get you comfortable with the code you will be building on to this class. But don't worry--no graded programming assignments yet. This week is all about getting comfortable and excited to learn.
7 видео, 9 материалов для самостоятельного изучения, 2 practice quizzes
- Видео: Course Title
- Reading: A Customized Welcome to this Course
- Видео: Welcome (Object Oriented Java Programming: Data Structures and Beyond Specialization)
- Видео: Welcome (Object Oriented Programming in Java Specialization)
- Reading: After completing this course, you will be able to...
- Reading: Is this course right for me?
- Practice Quiz: Pre-Course Quiz
- Reading: Up Next: A short survey
- Practice Quiz: Survey: Your goals for the course
- Reading: If you want more practice before you begin...
- Reading: The structure of this course
- Видео: Your path through the course
- Видео: Concept Challenges
- Видео: In the Real World: Welcome from Google Engineers
- Reading: Project Overview
- Видео: Project Prototype
- Reading: Setting up Java and Eclipse
- Reading: Getting and Working with the Starter Code
Оцениваемый: Quiz about the Starter Code and Course Structure
НЕДЕЛЯ 2
Working with Strings
This week we're going to dive into the course programming project. In the first lesson you'll learn about Strings and Regular Expressions, and in the programming assignment this week you'll apply that knowledge to adding functionality to your text editor so that it can measure the "readability" of text by calculating something called the "Flesch Readability Score". This course is focused on building code that not only does interesting things, but also finishes them quickly. So, let's get started building some code!
15 видео, 6 материалов для самостоятельного изучения, 2 practice quizzes
- Видео: Introduction
- Reading: A note about week numbers
- Reading: By the end of this week, you will be able to...
- Видео: Project Overview
- Видео: Core: Introduction to the Flesch Readability Score
- Видео: Core: Basics of Strings in Java
- Видео: Core: Working with Strings in Java
- Practice Quiz: Where to next?
- Видео: Support: For-Each Loops, part 1 of 5
- Видео: Support: For-Each Loops, part 2 of 5
- Видео: Support: For-Each Loops, part 3 of 5
- Видео: Support: For-Each Loops, part 4 of 5
- Видео: Support: For-Each Loops, part 5 of 5
- Видео: Core: Introduction to Regular Expressions
- Видео: When I struggled: Regular expressions
- Видео: Concept Challenge: Regular Expressions
- Видео: Support: More with Regular Expressions
- Practice Quiz: Strings and Regular Expressions
- Reading: Did you have trouble with any question(s) on the practice quiz?
- Discussion Prompt: What questions do you have about Strings and Regular Expressions?
- Reading: Week 2: Additional Resources
- Видео: Project: Programming Assignment Walk Through
- Reading: Programming Assignment FAQ
- Reading: Week 2: Congratulations and quiz answers
Оцениваемый: How Easy to Read is Your Writing?
Оцениваемый: Module and Programming Assignment Quiz
НЕДЕЛЯ 3
Efficiency Analysis and Benchmarking
Welcome to week 3! The text-editor application you worked with last week does something, but it doesn't do it particularly fast. This week we'll start talking about efficiency. We'll introduce the concept of "Big-O" notation, which sounds a little silly, but is really a powerful (and extremely common) way of analyzing a program's efficiency, independent of the system that it's running on and the exact details of how it's implemented. Then we'll go the other direction and dive into the details, talking about how to measure the actual running time of a piece of code to get an idea of how it really performs in practice.
25 видео, 3 материалов для самостоятельного изучения, 3 practice quizzes
- Видео: Introduction
- Reading: By the end of this week, you will be able to...
- Видео: Project Overview
- Видео: In the Real World: Efficiency
- Видео: Core: Our Motivation for Asymptotic Analysis
- Видео: Core: Counting Operations
- Видео: Core: Introduction to Asymptotic Analysis, Part 1
- Видео: Core: Introduction to Asymptotic Analysis, Part 2
- Видео: Core: Computing Big O with Consecutive Operations
- Видео: Core: Computing Big O with Nested Operations
- Practice Quiz: Where to next?
- Practice Quiz: Practice Quiz
- Видео: Concept Challenge: Classifying Functions using Big O
- Видео: Support: Analyzing Selection Sort
- Видео: Concept Challenge: Estimating Big O from Code
- Видео: Core: Worst, Best, and Average Cases
- Видео: In the Real World: Worst Case Analysis
- Видео: Core: Analyzing Search Algorithms
- Видео: Core: Analyzing Sorting Algorithms
- Видео: When I struggled: Algorithm performance
- Видео: Core: Merge Sort
- Видео: Core: A Summary of Sorting
- Видео: Core: Common Pitfalls in Asymptotic Analysis
- Practice Quiz: Asymptotic Notation and Analysis
- Видео: Core: Introduction to Benchmarking
- Видео: Core: Using Java Time
- Видео: Core: Analyzing Timings
- Видео: Concept Challenge: Relating Timing Data to Algorithm Analysis
- Reading: Week 3: Additional Resources
- Видео: Project: Week 3 Project Walk Through
- Reading: Week 3: Congratulations and quiz answers
Оцениваемый: Making Flesch Score Calculation More Efficient
Оцениваемый: Module and After Programming Assignment Quiz
НЕДЕЛЯ 4
Interfaces, Linked Lists vs. Arrays, and Correctness
This week we'll start talking about some of the basic concepts that one expects to find in a data structures course: the idea of data abstraction, and a data structure called a Linked List. Even though Linked Lists are not very efficient structures (for the most part), they do hit home the idea of "linking" pieces of data together in your computer's memory, rather than storing the data in one contiguous region. This linking idea will be central to many of the more advanced data structures, namely trees and graphs, that are coming up later in this course and in the next course in this specialization. In this module you'll also learn tools and procedures for unit testing your code, which is a way to make sure that what you've written is correct, and a staple practice of any sophisticated software developer.
26 видео, 3 материалов для самостоятельного изучения, 2 practice quizzes
- Видео: Introduction
- Reading: By the end of this week, you will be able to...
- Видео: Project Overview
- Видео: Core: Introduction to Abstraction
- Видео: In the Real World: Data Abstraction
- Видео: Core: Linked Lists vs. Arrays
- Видео: In the Real World: Lists vs. Arrays
- Видео: Core: Generics and Exceptions
- Видео: Core: Java Code for a Linked List
- Видео: Concept Challenge: Implementing linked lists, a first attempt
- Видео: Concept Challenge: Drawing Linked Lists, second attempt
- Видео: Support: Adding to a Linked List
- Видео: When I struggled: Data structures
- Видео: Core: Testing and Confidence
- Видео: In the Real World: How can the compiler help with testing?
- Видео: Core: Testing Practices
- Practice Quiz: Where to next?
- Видео: In the Real World: How do you test the behavior of code?
- Видео: Support: JUnit in Eclipse
- Видео: In the Real World: Unit Testing
- Видео: Core: Testing Linked List's "Get" Method
- Видео: Concept Challenge: Which Tests Should You Run?
- Видео: In the Real World: Test-driven development
- Reading: Week 4: Additional Resources
- Видео: Project: Linked List Assignment Walk Through
- Видео: When I struggled: confidence in code
- Practice Quiz: Where to next?
- Видео: Core: Markov Text Generation
- Видео: Core: Implementing Markov Text Generation
- Видео: Optional Project: Markov Text Generation Walk Through
- Ungraded Programming: (Optional) Markov Text Generation
- Reading: Week 4: Congratulations
Оцениваемый: Implement and Test a Linked List
Оцениваемый: Week 4 Reflective Programming Assignment Quiz
НЕДЕЛЯ 5
Trees! (including Binary Search Trees and Tries)
Welcome to week 4! We know you've been working hard. We hope you tried that optional Markov Text Generation programming assignment last week, but if not, no worries. You can always go back and do it later (spoiler alert: it's pretty amazing that such a simple algorithm can produce such realistic text). This week there's more fun (and hard work) as we learn about trees. Trees rely on the same linked structure idea as Linked Lists, only they're MUCH faster (usually...). In the project this week you'll add auto-complete to your text editor. Believe us when we say it's so cool when you get it working! You'll see... and we bet you can't wait for the programming assignment now. :)
22 видео, 3 материалов для самостоятельного изучения, 1 practice quiz
- Видео: Introduction
- Reading: By the end of this week, you will be able to...
- Видео: Project Overview
- Видео: Core: Trees
- Видео: In the Real World: Trees
- Видео: Core: Defining Trees
- Видео: Core: Binary Trees
- Видео: Core: Pre-Order Traversals
- Practice Quiz: Where to next?
- Видео: Core: Post-Order, In-Order, and Level-Order Traversals (Breadth-first search)
- Видео: When I struggled: Why traverse a tree?
- Видео: Core: Introduction to Binary Search Trees
- Видео: Core: Searching in a BST
- Видео: Support: Code for BST's "Find" Method
- Видео: Core: Inserting into a BST
- Видео: Support: Code for BST's "Insert" Method
- Видео: Core: Deleting from a BST
- Видео: Concept Challenge: BST Shape
- Видео: Core: Performance of BSTs and Balancing, Part 1
- Видео: Core: Performance of BSTs and Balancing, Part 2
- Видео: Core: Introduction to Tries
- Видео: Core: Performance of Tries
- Видео: Core: Implementing a Trie
- Reading: Week 5: Additional Resources
- Видео: Project: Week 5 Project Walk Through
- Reading: Week 5: Congratulations and quiz answers
Оцениваемый: Spell Checking and Autocomplete
Оцениваемый: Week 5 Content and Programming Assignment Quiz
НЕДЕЛЯ 6
Hash Maps and Edit Distance
You made it to the last week! Congratulations on getting this far! In this last week we'll be looking at a fundamental data structure called a Hash Table. If you thought trees were fast, just wait until you see what Hash Tables can do! Your last programming assignment will add spelling correction suggestions to your text editor, and there's an optional assignment that builds on the same ideas as the main assignment too, if you have the time and energy.
14 видео, 3 материалов для самостоятельного изучения
- Видео: Introduction
- Reading: By the end of this week, you will be able to...
- Видео: Project Overview
- Видео: Core: Hash Tables
- Видео: Core: Collisions in Hash Tables
- Видео: When I Struggled: Hash Tables
- Видео: Core: Applications of Hash Tables
- Видео: Support: Modular Arithmetic
- Видео: Concept Challenge: Hash Tables
- Видео: Core: Overview
- Видео: Core: Algorithm
- Видео: Core: Edit Distance
- Reading: Week 6: Additional Resources
- Видео: Project: Spelling Suggestions Walk Through
- Видео: Project: Word Path Walk Through
- Ungraded Programming: Word Paths (Optional but Recommended)
- Reading: Week 6: Congratulations and quiz answers
- Видео: Core: Congratulations!
Оцениваемый: Spelling Suggestions
Оцениваемый: Week 6: Programming Assignment and Content Quiz
Часто задаваемые вопросы
Как это работает
Coursework
Each course is like an interactive textbook, featuring pre-recorded videos, quizzes and projects.
Help from Your Peers
Connect with thousands of other learners and debate ideas, discuss course material, and get help mastering concepts.
Certificates
Earn official recognition for your work, and share your success with friends, colleagues, and employers.
Авторы
University of California, San Diego
UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory.
Стоимость
| Приобрести курс | |
|---|---|
| Получить доступ к материалам курса | Доступен |
| Получить доступ к оцениваемым материалам курса | Доступен |
| Получить итоговую оценку | Доступен |
| Earn a shareable Course Certificate | Доступен |
Рейтинги и отзывы
Fantastic Class, with a fun and engaging project. A lot of great information about data structures and performance!
Excellent. Great examples, projects, explanations of challenging concepts
Excellent for those eager to learn about more advanced data structures in Java, specially tries.
Coursera делает лучшее в мире образование доступным каждому, предлагая онлайн-курсы от ведущих университетов и организаций.
© Coursera Inc., 2018 Все права защищены.
Fantastic topics. Good explanations by Mia (instructor).
Keep doing a great work, guy! I have restored my confidence in programming now!