Programming Basics Quiz: Algorithms and Pseudocode

📚 Quick Study Guide

• 🔍 Algorithm: A step-by-step procedure for solving a problem. Think of it as a recipe for your computer.
• 💡 Pseudocode: An informal way of writing algorithms that resembles code but doesn't require strict syntax. It's like planning your code in plain English.
• 📝 Key Elements of Algorithms: Input, Output, Definiteness, Finiteness, Effectiveness.
• 🧮 Control Structures: Sequence (do this, then that), Selection (if/else), and Iteration (loops).
• 🧭 Flowcharts: Visual representations of algorithms using symbols like rectangles (processes), diamonds (decisions), and ovals (start/end).
• ⏱️ Time Complexity: A measure of how the execution time of an algorithm grows as the input size increases, often expressed using Big O notation (e.g., $O(n)$, $O(log n)$).
• 💾 Space Complexity: A measure of how much memory an algorithm uses as a function of the input size.

🧪 Practice Quiz

1. Question 1: Which of the following is the correct definition of an algorithm?
   1. A) A computer program written in a high-level language.
   2. B) A step-by-step procedure for solving a problem.
   3. C) A hardware component of a computer system.
   4. D) An operating system.
2. Question 2: What is pseudocode primarily used for?
   1. A) Executing code directly on a computer.
   2. B) Writing code in a specific programming language.
   3. C) Planning an algorithm in a human-readable format.
   4. D) Compiling code into machine language.
3. Question 3: Which of the following is NOT a key characteristic of an algorithm?
   1. A) Input
   2. B) Output
   3. C) Ambiguity
   4. D) Finiteness
4. Question 4: Which control structure involves repeating a block of code?
   1. A) Sequence
   2. B) Selection
   3. C) Iteration
   4. D) Recursion
5. Question 5: In a flowchart, what shape represents a decision?
   1. A) Rectangle
   2. B) Oval
   3. C) Diamond
   4. D) Circle
6. Question 6: What does Big O notation primarily describe?
   1. A) The exact execution time of an algorithm.
   2. B) The memory usage of an algorithm.
   3. C) The growth rate of an algorithm's execution time.
   4. D) The programming language used.
7. Question 7: Which of the following is an example of pseudocode?
   1. A) `int x = 5;`
   2. B) `for i in range(10): print(i)`
   3. C) `BEGIN SET x to 5 DISPLAY x END`
   4. D) `#include `