Algoritmos y estructuras de datos
Examen de Plata
Sixteen questions across the whole course: counting steps, searching, hash maps, stacks and queues, recursion, sorting, graphs, trees, heaps, dynamic programming and shortest paths. Trace the code, count the steps and pick the right tool.
- 16 preguntas
- 20 minutos
- Nota mínima 80 %
- Al menos 6 tareas prácticas
Temas Big O and counting stepsSearchingHash maps and setsStacks and queuesRecursion and memoizationSortingGraphs and BFSTreesHeapsDynamic programmingShortest paths
El reloj no se puede pausar, y salir cuenta como un intento.