1 Breaking down a large, complex problem into smaller, manageable parts is known as: A Modular Design B Abstraction C Dry Run D Generalization
2 A problem that can be divided into smaller parts supports: A Abstraction B Modular design C Counting principle D Error handling
3 Which characteristic of an algorithm means it must stop after a certain number of steps? A Input B Output C Finiteness D Effectiveness
4 Which step verifies correctness of an algorithm? A Dry run B Abstraction C Generalization D Modularization
5 Modular design refers to: A Designing a single large program B Dividing a problem into smaller modules C Ignoring problem parts D Hardware design
7 Which of the following best describes computational thinking? A Thinking only about computers B Solving problems step by step logically C Writing long programs D Using calculators only
8 Which of the following is NOT a characteristic of a good algorithm? A It must be finite and stop after some steps. B It must be clear and easy to understand. C It must be complex and difficult to follow. D It must be effective and doable.
9 A well-defined, step-by-step procedure to solve a specific problem is called: A A flowchart B A program C An algorithm D A dry run
10 What is an algorithm dry run? A Writing an algorithm B Executing algorithm step by step manually C Deleting algorithm D Compiling code
11 What is the name of the process where you manually test an algorithm with sample data to check its logic? A Abstraction B Modular Design C Generalization D Dry Run
12 Algorithms should be written in: A Ambiguous language B Clear and simple language C Binary code D Machine language only
13 Which type of reasoning is used to draw a specific conclusion from a general statement or rule? A Inductive Reasoning B Abductive Reasoning C Analogical Reasoning D Deductive Reasoning
14 Which property ensures same output for same input? A Generality B Definiteness C Finiteness D Modularity
15 Which of the following is an example of logical reasoning? A Guessing B Random selection C If-then decision making D Copying data
16 What is the process of hiding complex details and showing only the essential features of a problem? A Modular Design B Abstraction C Dry Run D Generalization
17 Which of the following is a standard searching algorithm that works efficiently on a sorted list? A Bubble Sort B Selection Sort C Binary Search D Linear Search
18 Which of the following is NOT a characteristic of an algorithm? A Finiteness B Clarity C Ambiguity D Effectiveness
19 What is the first and most important step in solving a computational problem? A Writing the code B Testing the algorithm C Designing the algorithm D Understanding and defining the problem
20 An error in the grammar or spelling rules of a programming language is called a: A Logical Error B Syntax Error C Runtime Error D Human Error
21 Which error occurs due to wrong logic? A Syntax error B Logical error C Hardware error D Network error
22 Which approach focuses on solving a class of problems? A Specific solution B Generalized solution C Trial and error D Random solution
23 What is a computing problem? A A problem that can be solved using a computer B A problem related only to hardware C A problem without any solution D A mathematical equation only