Acerca de este Curso

27,141 vistas recientes
Certificado para compartir
Obtén un certificado al finalizar
100 % en línea
Comienza de inmediato y aprende a tu propio ritmo.
Fechas límite flexibles
Restablece las fechas límite en función de tus horarios.
Nivel intermedio
Aprox. 22 horas para completar
Inglés (English)

Instructor

Certificado para compartir
Obtén un certificado al finalizar
100 % en línea
Comienza de inmediato y aprende a tu propio ritmo.
Fechas límite flexibles
Restablece las fechas límite en función de tus horarios.
Nivel intermedio
Aprox. 22 horas para completar
Inglés (English)

ofrecido por

Placeholder

Sistema Universitario de Colorado

Programa - Qué aprenderás en este curso

Semana
1

Semana 1

6 horas para completar

Dynamic Arrays and Algorithm Analysis

6 horas para completar
14 videos (Total 80 minutos), 12 lecturas, 1 cuestionario
14 videos
Navigating a Coursera Course (optional)3m
Meet the Instructor (optional)10m
Lesson Introduction1m
Unordered ints7m
Ordered ints8m
Making it Generic5m
Implementing an Interface9m
Lesson Introduction30s
What is Algorithm Analysis?2m
Introduction to Big O4m
Big O Examples9m
Unordered Dynamic Array Analysis5m
Ordered Dynamic Array Analysis5m
12 lecturas
Setting Up Your Development Environment10m
Readings and Lecture Code10m
Exercise Code10m
Dr. T's Book10m
Dynamic Arrays10m
Exercise 1: Still Haven't Found What I'm Looking For10m
Exercise 2: Using the Generic10m
Dynamic Arrays Lecture Code10m
Big O10m
Exercise 3 Trading Time for Space10m
Exercise 4: Wacky Again10m
Ted the RoboCollector Solution10m
Semana
2

Semana 2

5 horas para completar

Linked Lists and Graphs

5 horas para completar
8 videos (Total 61 minutos), 7 lecturas, 1 cuestionario
8 videos
Linked List Implementation14m
Linked List Analysis4m
Lesson Introduction2m
Graph Implementation9m
Graph Analysis9m
Dictionaries6m
Searching a Graph12m
7 lecturas
Linked Lists10m
Exercise 5: Double the Links10m
Graphs10m
Exercise 6: Getting Some Direction10m
Exercise 7: What Does It Cost?10m
Graphs Lecture Code10m
Take the Short Way Home Solution10m
Semana
3

Semana 3

6 horas para completar

Stacks, Queues, and Trees

6 horas para completar
14 videos (Total 79 minutos), 9 lecturas, 1 cuestionario
14 videos
Stack Implementation4m
Stack Analysis3m
Lesson Introduction2m
Queue Implementation3m
Queue Analysis3m
Lesson Introduction1m
Recursion6m
Recursive Binary Search6m
Tree Implementation11m
Tree Analysis7m
Tree Traversal9m
Minimax Search9m
Minimax Implementation9m
9 lecturas
Stacks10m
Exercise 8: Depth-First Search10m
Queues10m
Exercise 9: Breadth-First Search10m
Recursion10m
Trees10m
Exercise 10: Minimax Practice10m
Trees Lecture Code10m
Don't Take the Last Teddy Solution10m
Semana
4

Semana 4

4 horas para completar

Design Patterns

4 horas para completar
13 videos (Total 41 minutos), 3 lecturas, 1 cuestionario
13 videos
Game Loop and Update Method2m
Component1m
Prototype1m
Singleton5m
Observer57s
Mediator3m
Object Pool14m
State3m
Strategy1m
Template Method2m
Finishing Up, Four Course Specialization48s
Finishing Up, Five Course Specialization47s
3 lecturas
Design Patterns Lecture Code10m
Oh, Shmup! Solution10m
Which Finishing Up Video Should I Watch?10m

Reseñas

Principales reseñas sobre DATA STRUCTURES AND DESIGN PATTERNS FOR GAME DEVELOPERS

Ver todas las reseñas

Preguntas Frecuentes

¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.