placeholder image to represent content

Algouniversity Quiz

Quiz by Suraj Kumar

Feel free to use or edit a copy

includes Teacher and Student dashboards

Measure skills
from any curriculum

Tag the questions with any skills you have. Your dashboard will track each student's mastery of each skill.

With a free account, teachers can

edit the questions
save a copy for later
start a class game
automatically assign follow-up activities based on students’ scores
assign as homework
share a link with colleagues
print as a bubble sheet

Q 1/5
Score 0
In order traversal of binary search tree will produce ?
29
unsorted list
sorted list
none of the above
reverse of input

Our brand new solo games combine with your quiz, on the same screen

Correct quiz answers unlock more play!

New Quizalize solo game modes

5 questions

Show answers

Q1
In order traversal of binary search tree will produce ?
unsorted list
sorted list
none of the above
reverse of input
30s
Q2
push() and pop() functions are found in
queues
trees
stacks
lists
30s
Q3
Minimum number of queues required for priority queue implementation?
5
2
4
3
30s
Q4
The minimum number of edges required to create a cyclid graph of n vertices is
n+1
n-1
2n
n
30s
Q5
What about recursion is true in comparison with iteration?
all of the above are true!
low performance.
every recursive program can be written with iteration too.
very expensive in terms of memory.
30s

Teachers give this quiz to your class