Informações sobre o curso: How does Google Maps plan the best route for getting around town given current traffic conditions? How does an internet router forward packets of network traffic to minimize delay? How does an aid group allocate resources to its affiliated local partners? To solve such problems, we first represent the key pieces of data in a complex data structure. In this course, you’ll learn about data structures, like graphs, that are fundamental for working with structured real world data. You will develop, implement, and analyze algorithms for working with this data to solve real world problems. In addition, as the programs you develop in this course become more complex, we’ll examine what makes for good code and class hierarchy design so that you can not only write correct code, but also share it with other people and maintain it in the future. The backbone project in this course will be a route planning application. You will apply the concepts from each Module directly to building an application that allows an autonomous agent (or a human driver!) to navigate its environment. And as usual we have our different video series to help tie the content back to its importance in the real world and to provide tiered levels of support to meet your personal needs.
Para quem é direcionado este curso: 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.
Desenvolvido por: Universidade da Califórnia, San Diego
Ministrado por: Leo Porter, Assistant Teaching Professor
Computer Science and Engineering
Ministrado por: Mia Minnes, Assistant Teaching Professor
Computer Science and Engineering
Ministrado por: Christine Alvarado, Associate Teaching Professor
Computer Science and Engineering
| Informações básicas | |
| Nível | Intermediate |
| Compromisso | 5 weeks of study, 1-3 hours/week |
| Idioma | English |
| Como ser aprovado | Seja aprovado em todas as tarefas para concluir o curso. |
| Classificação do usuário |
Programa
SEMANA 1
Introduction to the Course
Welcome to the first week in the third course of our Intermediate Java Programming Specialization. Once again start with introductions, and in particular introduce the unique structure of this course. Also, if you're not sure if this course is right for you, we've got an optional pre-course quiz coming right up that can help you figure out if you're in the right place. If you decide to stay with us (and we really hope you will!) we've got a great backbone project for you: your very own mapping application, inspired by Google Maps! The core data structure throughout this course is graphs, which may very well be the most fundamental data structure in all of computer science. Ready to begin? So are we!
4 vídeos, 10 leituras, 2 questionários de prática
- Vídeo: Welcome
- Leitura: After completing this course, you will be able to ...
- Leitura: Is this course right for me?
- Teste para praticar: Pre-course quiz
- Leitura: Up Next: A short survey
- Teste para praticar: Survey: Your goals for the course
- Leitura: If you want more practice before you begin...
- Leitura: The structure of this course
- Vídeo: Your path through this course
- Vídeo: Concept challenges
- Leitura: Welcome from the Google engineers
- Prompt de discussão: Introduce Yourself!
- Leitura: Project Overview
- Vídeo: Project Prototype
- Leitura: Setting up Java and Eclipse
- Leitura: Getting and Setting up the Starter Code
- Leitura: Project: Orientation to the Starter Code, Data Files and Front-end
Nota atribuída: Course Structure and Starter Code Quiz (make sure you can run the starter code first)
SEMANA 2
Introduction to Graphs
This week we'll start getting technical, introducing you to the central data structure in the course: Graphs. You'll learn the basics and then have a chance to dive in a little deeper into the code, getting ready to start building that Google Maps-like application.
17 vídeos, 7 leituras, 2 questionários de prática
- Vídeo: Introduction
- Leitura: A note about week numbers
- Leitura: By the end of this week, you will be able to...
- Vídeo: Project: Introduction to Graphs Project Overview
- Vídeo: Core: What's a graph?
- Vídeo: Core: Graph definitions
- Vídeo: In the real world: Graphs at Google
- Vídeo: In the real world: More graphs at Google
- Teste para praticar: Graphs
- Leitura: (Read only AFTER finishing Graphs Quiz)
- Vídeo: Core: Implementing graphs in Java
- Vídeo: Core: Adjacency matrix
- Vídeo: Core: Adjacency list
- Teste para praticar: Where to next?
- Vídeo: Concept Challenge: Comparing implementations of graphs
- Vídeo: In the real world: Performance considerations
- Vídeo: When I struggled: Analyzing implementations
- Vídeo: Core: Neighbors
- Vídeo: Support: Coding getNeighbors
- Vídeo: Support: Coding 2-Hop Neighbors
- Vídeo: Support: Multiplying Adjacency Matrices
- Leitura: Graph definitions and implementation: a glossary
- Leitura: Week 2: Additional Resources
- Vídeo: Project: Programming Assignment Walkthrough
- Leitura: Programming Assignment FAQ
- Leitura: Graph definitions and implementations Quiz Answer explanations (Read ONLY after you pass the quiz)
Nota atribuída: Project: Implementing Graphs
Nota atribuída: Graph definitions and implementation
SEMANA 3
Class design and simple graph search
This week you'll get the backbone of your map search engine up and running. In previous courses, including the previous courses in this specialization, you've probably been given most of the classes you needed to complete the assignments. But learning how to design classes from scratch is a key skill that you will need as you become a more sophisticated Java programmer. This week we'll give you the tools you need to create a robust and elegant class design for your map search engine. We'll introduce a similar problem and show you how it can be represented as a graph. Then we'll introduce two core search algorithms: depth-first search and breadth-first search. Finally, we'll turn our graph problem into a set of Java classes. Your task on the programming assignment this week will be to do the same thing, but in the context on the map search engine!
20 vídeos, 3 leituras, 1 questionário de prática
- Vídeo: Introduction
- Leitura: By the end of this week, you will be able to ...
- Vídeo: Project: Route Finding Project Overview
- Vídeo: Core: Intro to Class Design
- Vídeo: When I struggled: Building useful classes
- Vídeo: In the Real World: Design patterns
- Vídeo: Core: DFS, Part 1
- Vídeo: Core: DFS, Part 2
- Vídeo: Core: BFS
- Vídeo: Support: Developing Small Examples to Test Your Code
- Teste para praticar: Where to next?
- Vídeo: When I struggled: Data structures jargon
- Vídeo: When I struggled: The right data structure for the job
- Vídeo: Concept Challenge: Performance of DFS and BFS
- Vídeo: Core: Class Design
- Vídeo: When I struggled: If you fail to plan ...
- Vídeo: When I struggled: ... but don't forget to start!
- Vídeo: In the real world: Planning ahead with design
- Vídeo: Core: Refactoring
- Vídeo: Support: Where to start the project design?
- Vídeo: In the Real World: Why is code refactored?
- Leitura: Week 3: Additional Resources
- Vídeo: Project: Programming Assignment Walk-through
- Leitura: End of Week Quiz Answers
Nota atribuída: Project: Class Design and Graph Search
Nota atribuída: Code Design Peer Review
Nota atribuída: End of Week Quiz (complete project and peer review first)
SEMANA 4
Finding shortest paths in weighted graphs
In the past two weeks, you've developed a strong understanding of how to design classes to represent a graph and how to use a graph to represent a map. In this week, you'll add a key feature of map data to our graph representation -- distances -- by adding weights to your edges to produce a "weighted graph". Although this might seem like a small change, the algorithms that work for unweighted graphs may prove ineffective for weighted graphs. To address this problem, you'll explore more advanced shortest path algorithms. First, you'll see how to find the shortest path on a weighted graph, then you'll see how to find it more quickly. In the project, you'll apply these ideas to create the core of any good mapping application: finding the shortest route from one location to another.
10 vídeos, 4 leituras
- Vídeo: Introduction
- Leitura: By the end of this week, you will be able to ...
- Vídeo: Project: Shortest Path Overview
- Vídeo: Core: Shortest Path with BFS
- Vídeo: Core: Geographic Maps
- Vídeo: Core: Dijkstra's Algorithm
- Vídeo: Concept Challenge: Performance of Dijkstra's Algorithm
- Vídeo: Core: A* Search Algorithm
- Vídeo: When I struggled: Tackling large programming projects
- Vídeo: When I Struggled: Remembering classical algorithms
- Leitura: Week 4: Additional Resources
- Vídeo: Project: Shortest Path Programming Assignment Walkthrough
- Leitura: Test cases and debugging guide for the quiz
- Leitura: End of Week Quiz Answers
Nota atribuída: Project: Shortest Path
Nota atribuída: End of Week Quiz (very short, do programming assignment first)
SEMANA 5
Route planning and NP-hard graph problems
In this week, we'll go beyond the problem of finding a path between two points, and focus on problems requiring overall path planning. For example, if you wanted to go on errands and visit 6 different locations before returning home, what is the optimal route? This problem is actually a really well known problem in computer science known as the Travelling Salesperson Problem (TSP). Attempting to solve the problem will lead us to explore complexity theory, what it means to be NP-Hard, and how to solve "hard" problems using heuristics and approximation algorithms. We'll end the week by showing how reformulating a problem can have a huge impact: making something which was effectively unsolvable before, now solvable!
11 vídeos, 3 leituras
- Vídeo: Introduction
- Leitura: By the end of this week, you will be able to ...
- Vídeo: Core: Traveling Salesperson Problem (TSP)
- Vídeo: Concept Challenge: An algorithm for TSP
- Vídeo: Core: TSP Brute-Force Algorithm
- Vídeo: Core: TSP Algorithm Running Time
- Vídeo: Core: NP Hard
- Vídeo: Core: Approximations and Heuristics
- Vídeo: Core: Hamiltonian Graphs
- Vídeo: Core: Eulerian graphs
- Vídeo: Core: Eulerian graphs, an algorithm
- Vídeo: Core: An application in bioinformatics
- Leitura: Week 5: Additional Resources
- Leitura: End of Week Quiz Answers
Nota atribuída: End of Week Quiz
SEMANA 6
End of Course Project Extension
You made it to the last week of our course! We're glad you're still with us. As a reward, there's no new content to learn this week. Instead you'll get the opportunity to extend your project in a direction of your own choosing. We hope you've got some neat ideas for personalizing your map application, and we look forward to seeing them in the peer review gallery. Submitting to the peer review gallery is optional (though the extension is required), but we hope you'll choose to participate.
1 vídeo, 2 leituras
- Leitura: Week 6 Introduction
- Leitura: Project: Week 6 Description -- REQUIRED EXTENSION
- Avaliação entre colegas: Project Extension Feedback
- Vídeo: End of course message
Nota atribuída: Week 6 Project Quiz (Complete your project extension first)
Perguntas frequentes
Como funciona
Trabalho
Cada curso é como um livro didático interativo, com vídeos pré-gravados, testes e projetos.
Ajuda dos seus colegas
Conecte-se com milhares de outros aprendizes, debata ideias, discuta sobre os materiais do curso e obtenha ajuda para dominar conceitos.
Certificados
Obtenha reconhecimento oficial pelo seu trabalho e compartilhe seu sucesso com amigos, colegas e empregadores.
Desenvolvedores
Universidade da Califórnia, 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.
Custo
| Comprar curso | |
|---|---|
| Acesso aos materiais do curso | Disponível |
| Acesso a materiais valendo nota | Disponível |
| Receba uma nota final | Disponível |
| Obtenha um Certificado de Curso compartilhável | Disponível |
Classificações e avaliações
Very Good!
Really hated "Just guess the closest of the multiple choice if your answers don't match. It's not always exact." as quiz instructions. That was just horrible. Figure out some better way of grading it.
The rest of the course was lovely, challenging and fun. I especially enjoyed the NP section.
Excellent !!
O Coursera proporciona acesso universal à melhor educação do mundo fazendo parcerias com as melhores universidades e organizações para oferecer cursos on-line.
© 2018 Coursera Inc. Todos os direitos reservados.
JS
This was a fun and interesting course. The most challenging but rewarding course of this specialization. Learning about graphs and their search algorithms was really interesting, I want to look into graphs and TSP problems more. Basically building a graph from scratch was an amazing and rewarding experience. I definitely recommend this course!