Algorithm Analysis and Data Structures Quiz

What is an algorithm?

• A programming language

• A type of data structure

• A finite set of instructions to accomplish a task

• A method of sorting data

Which of the following is NOT a criterion for algorithms?

• Input

• Output

• Definiteness

• Complexity

What does time complexity measure?

• The amount of memory used by an algorithm

• The number of steps an algorithm takes to complete

• The speed of the computer running the algorithm

• The efficiency of the algorithm in terms of input size

In the context of algorithm analysis, what does 'best case' refer to?

• The average performance of the algorithm

• The theoretical maximum performance of the algorithm

• The scenario where the algorithm performs optimally

• The scenario where the algorithm performs the worst

What is the balance factor in an AVL tree?

• The difference between the heights of left and right subtrees

• The total number of nodes in the tree

• The height of the tree

• The number of leaves in the tree

Which operation is NOT performed on AVL trees?

• Insertion

• Deletion

• Traversal

• Sorting

What is the primary purpose of B-Trees?

• To store data in a linear format

• To manage memory allocation

• To perform quick sorting of data

• To allow efficient disk access and storage of large amounts of data

Which of the following is a property of B-Trees?

• All leaf nodes must be at different levels

• The root node can have no children

• Every node can have at most m children

• All nodes must have the same number of children

What is the time complexity of insertion in an AVL tree?

• O(1)

• O(n log n)

• O(log n)

• O(n)

Which notation represents the upper bound of an algorithm's runtime?

• Big Oh (O) notation

• Omega (Ω) notation

• Little Oh (o) notation

• Theta (θ) notation