Inside Algorithms Quiz

Test

Jugadas 0

Crear copia

Quick checks on core algorithms concepts.

Shilo Duran

Estados Unidos

Todavía no hay resultados para este juego. ¡Sé el primero en aparecer en el ranking! Inicia sesión para identificarte.

Crea tu propio juego gratis desde nuestro creador de juegos

Compite contra tus amigos para ver quien consigue la mejor puntuación en esta actividad

Crear reto

Imprime tu juego

Inside Algorithms Quiz


Inside Algorithms QuizVersión en línea Quick checks on core algorithms concepts. por Shilo Duran 1 What is the time complexity of binary search on a sorted list? a O(n log n) b O(1) c O(n) d O(log n) 2 Which data structure is optimal for implementing a priority queue? a Binary heap b Queue c Linked list d Array list 3 Dijkstra's algorithm is used to find: a Topological order b Cycle detection c Shortest paths from a source d Minimum spanning tree 4 Dynamic programming is best when problems have: a No subproblems b Independent steps c Overlapping subproblems d Random access memory 5 Which sort has average time complexity O(n log n) and is in-place? a Insertion sort b Quicksort (worst-case) c Heapsort d Mergesort 6 What is a graph with no cycles called? a Acyclic graph b Directed graph c Cyclic graph d Weighted graph 7 In Big-O notation, which term dominates for large n? a Highest-order term b Lowest-order term c Coefficient term d Constant term 8 Breadth-first search explores a graph in: a Always from the end b Depth only c Random order d Layers by distance from the source 9 Which problem is commonly solved with a greedy algorithm? a All-pairs shortest path b Huffman coding c Binary search d Topological sort 10 Which data structure supports push and pop in O(1) amortized? a Graph b Stack c Tree d Queue