Programing and Problem Solving Quiz
1. What is the time complexity of the following code snippet?
python
Copy
for i in range ( n ):
for j in range ( i , n ):
k = 1
while k < n :
k *= 2
Options:
A) O(n)
B) O(n²)
C) O(n² log n)
D) O(n³)
2. Which of the following is NOT a valid heuristic for the A search algorithm?*
Options:
A) Manhattan Distance
B) Euclidean Distance
C) Hamming Distance
D) Breadth-First Distance
3. What does the following dynamic programming recurrence relation solve?
