Algorithm Analysis, AVL Trees, and B-Trees Quiz

What is the worst-case time complexity of linear search?

• O(1)
• O(log n)
• O(n)
• O(n log n)

What is the balance factor of a node in an AVL tree?

• Height(left) - Height(right)
• Height(node)
• Depth of node
• none of the above

Maximum number of children for a B-Tree node of order m is

• m-1
• m
• m+1
• 2m

Which of the following is not an asymptotic notation?

• Big-O
• Theta
• Alpha
• Omega

The best-case complexity of linear search is:

• O(1)
• O(n)
• O(log n)
• O(n log n)

What is space complexity?

• Amount of time an algorithm takes
• Amount of memory an algorithm uses
• Complexity of nested loops
• Recursion depth

Which notation denotes the lower bound?

• O
• θ
• Ω
• o

If f(n) = 3n² + 2n + 1, then f(n) is:

• O(n)
• O(n²)
• O(n³)
• O(log n)

Which of the following is not a valid asymptotic notation?

• O(n)
• Ω(n)
• α(n)
• θ(n)

If an algorithm has a complexity of O(n!), it is considered:

• Linear
• Polynomial
• Exponential
• Factorial