Algorithms Quiz

1. What is an Algorithm?

A computer program A step-by-step procedure to solve a problem A type of data structure A flowchart diagram

2. Which of the following is a real-life example of an algorithm?

Deciding randomly what to eat A recipe for baking a cake A painting A song

3. Why are algorithms important?

They reduce computer power They provide structured problem-solving They only work in programming They remove the need for hardware

4. Why is efficiency important in algorithms?

It reduces memory and execution time It makes code longer It guarantees no bugs It avoids using variables

5. Which flowchart symbol is used for decision-making?

Rectangle Oval Diamond Parallelogram

6. Why is pseudocode useful?

It executes directly on computers It helps design algorithms in plain language It is faster than coding It replaces flowcharts

7. Which strategy involves solving a simpler version of the problem first?

Divide and conquer Guessing Copy-paste Random trial

8. Which statement is correct about variables?

They only hold text They store values that can change during execution They cannot be updated They are always numbers

9. Which pseudocode correctly reads a number and prints its square?

Read x → Print x Input x → Print x * x Input x → Output x Read x → Write x

10. What will this pseudocode print if x = 0?

If x > 0 then
   Print "Positive"
Else If x < 0 then
   Print "Negative"
Else
   Print "Zero"

Positive Negative Zero Error

11. What is the output of this pseudocode when y = 12?

If y > 10 then
   If y < 20 then
      Print "Between 10 and 20"
   End If
End If
                

Nothing Between 10 and 20 Error 12

12. Which loop will always execute at least once?

While loop For loop Do-While loop Infinite loop

13. What does this pseudocode print?

For i = 1 to 3
   Print i
End For
                

123 321 111 Error

14. Which type of loop is best when the number of repetitions is unknown?

For loop While loop Repeat fixed loop Nested loop

15. Which of the following problems is typically solved using recursion?

Multiplying two numbers Factorial calculation Adding two variables Reading input

16. Why is a base case necessary in recursion?

To make recursion faster To stop infinite recursive calls To increase stack size To reduce loops

17. Which data structure follows First In, First Out (FIFO)?

Stack Queue Tree Array

18. If an array has 5 elements, what are the valid index positions (0-based indexing)?

1 to 5 0 to 5 0 to 4 -1 to 4

19. What is the time complexity of this algorithm?

For i = 1 to n
   Print "Hello"
End For
                

O(1) O(n) O(log n) O(n²)

20. If Algorithm A runs in O(n) and Algorithm B runs in O(n²), which one is more efficient for large n?

Algorithm A Algorithm B Both are the same It depends on hardware