Hard 10 questionsAI-generated
★★★★★★★★★★Not rated yet

Advanced Algorithms Quiz: Dijkstra, AVL, NP and Turing

A demanding quiz on complexity, AVL and red-black trees, counting sort, Dijkstra, dynamic programming, the NP class and the Turing machine.

Start the quiz Created by lecouze13

Question preview

  1. What is the auxiliary memory complexity of a classic merge sort on n elements?
  2. What is the main prerequisite of counting sort?
  3. In Dijkstra's algorithm, what condition must the edge weights satisfy?

… and 7 more questions to discover by playing.

See questions and answers : Algorithms & Data Structures

More Algorithms & Data Structures quizzes