CPA Data Structures & Algorithms 4

Question 1

In Big-O notation, what does O(1) indicate about an algorithm?

Accepted Answer

Its runtime is constant regardless of input size

Answer

O(1) means the algorithm's running time does not grow with the size of the input.

Question 2

A deque (double-ended queue) supports efficient insertion and deletion at:

Accepted Answer

Both the front and the rear

Answer

A deque allows O(1) insertions and deletions at both the front and the rear of the structure.

Question 3

Which graph algorithm is used to detect a cycle in a directed graph?

Accepted Answer

Depth-first search with coloring

Answer

DFS with three-color marking (white/gray/black) detects back edges that indicate cycles in directed graphs.

Question 4

What is the minimum number of nodes in a complete binary tree of height h?

Accepted Answer

2^h

Answer

A complete binary tree of height h has at least 2^h nodes (all levels full except possibly the last).

Question 5

Which of the following operations on a balanced BST (e.g., AVL or Red-Black tree) runs in O(log n) time?

Accepted Answer

Search, insert, and delete

Answer

Balanced BSTs maintain height O(log n), guaranteeing search, insert, and delete operations in O(log n) time.

(CPA) Certified Associate Programmer Practice Test