Quizalize logo
placeholder image to represent content

DAA W3

Quiz by Theresia V.

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

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

Correct quiz answers unlock more play!

New Quizalize solo game modes
8 questions
Show answers
  • Q1

    Faster growth means better efficiency

    False

    True

    45s
  • Q2

    When the input sizes are large enough, only the order of growth of the running time is relevant

    True

    False

    45s
  • Q3

    An algorithm that is asymptotically more efficient will be the best choice for all inputs, including very small inputs

    True

    False

    45s
  • Q4
    120s
  • Q5
    45s
  • Q6

    Which is FALSE about the O-notation?

    It may NOT be asymptotically tight

    It may be asymptotically tight

    2n^2=O\left(n^2\right)is asymptotically tight

    2n=O\left(n^2\right) is asymptotically tight

    60s
  • Q7

    Which of the following is FALSE? (Read carefully, don't rush)

    If g(n)=o(f(n)) then f(n) = \omega\left(g\left(n\right)\right)

    If \lim_{n\to∞}\frac{f\left(n\right)}{g\left(n\right)}=0then g(n)=o(f(n))

    2n^{ }=o\left(n^2\right)

    n=\omega\left(1\right)

    120s
  • Q8

    The iterated logarithm function is a very fast-growing function

    True

    False

    120s

Teachers give this quiz to your class