Algorithm
CIS · Quiz · Fall 26
Section A · Batch 24 · shared by Md Shahinur Rahman (স জি ব)
Read the questions as text
Read off the PDF by AI, so it may have mistakes. The PDF is the original.
Class Test (1) Examination: Fall-2026
Course Code: CIS 132
Course Title: Algorithms
Time: 30 Minutes
Total Marks: 15
1. What is algorithm? Discuss the types of algorithms with examples. [5]
2. Calculate the time complexity of the following code: [5]
a) i = 1
while (i < n) :
i /= 2
printf("Hello")
3. Calculate the time complexity of the pseudocode below using the recursive tree method. [5]
fib(n) {
if n==0;
return 0;
else if n==1;
return 1;
else
return fib(n-1) + fib(n-2);
}