A quiz with questions about graph theory and algorithms that I used to study for my Algorithms and Datastructures course.
It's made up of basic facts from trees, graph connectivity, eulerian and hamiltonian tours as well as breadth-first-search and depth-first-search questions that test your intuition.
There is also an excurse on special type of trees we use for datastructures, like AVL and Heaps.
Each quesion comes with short explanations that hopefully make the intuition clear.
More questions will be added and more comprehensive explanations to these I'll add on my blog.
There is also a hardmode putting a timer of 15 seconds on the questions to get you going, just like you would have to on an exam with limited time. By default it's off though, to focus on learning.
Happy traversing!
It's made up of basic facts from trees, graph connectivity, eulerian and hamiltonian tours as well as breadth-first-search and depth-first-search questions that test your intuition.
There is also an excurse on special type of trees we use for datastructures, like AVL and Heaps.
Each quesion comes with short explanations that hopefully make the intuition clear.
More questions will be added and more comprehensive explanations to these I'll add on my blog.
There is also a hardmode putting a timer of 15 seconds on the questions to get you going, just like you would have to on an exam with limited time. By default it's off though, to focus on learning.
Happy traversing!
Show More
