2 Creating a solution that works for a wide range of inputs, not just one specific case, is called: A A specific solution B An abstract solution C A modular solution D A generalized solution
3 Which of the following is NOT a characteristic of an algorithm? A Finiteness B Clarity C Ambiguity D Effectiveness
4 Which error occurs due to wrong logic? A Syntax error B Logical error C Hardware error D Network error
5 Which topic focuses on identifying mistakes? A Abstraction B Errors C Counting principles D Modular design
6 What is the main purpose of performing a dry run on an algorithm? A To check the algorithm's logic for errors B To write the code in a programming language C To make the algorithm run faster D To hide the complex details
7 Algorithms should be written in: A Ambiguous language B Clear and simple language C Binary code D Machine language only
8 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
9 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.
10 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
11 Errors found during dry run are mostly: A Syntax errors B Logical errors C Hardware errors D Network errors
12 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
13 Which of the following is NOT a step in algorithm design? A Understanding problem B Designing solution C Executing hardware D Testing
14 What is an algorithm? A A computer program B A flowchart C A step-by-step solution to a problem D A programming language
17 An error in an algorithm means: A Correct output B Unexpected or wrong result C Fast execution D Hardware failure
18 Which principle helps in solving basic counting problems? A Logical fallacy B Counting principle C Flowchart principle D Debugging principle
19 Which approach focuses on solving a class of problems? A Specific solution B Generalized solution C Trial and error D Random solution
20 Which step comes after designing an algorithm? A Problem identification B Testing and verification C Ignoring errors D Data deletion
21 The fundamental counting principle is used when: A Steps are independent B Steps are dependent C There is only one step D There is no solution
22 A problem that can be divided into smaller parts supports: A Abstraction B Modular design C Counting principle D Error handling
23 An error that causes the program to produce an incorrect result, but does not stop it from running, is called a: A Logical Error B Syntax Error C Runtime Error D Compilation Error
24 Which characteristic of an algorithm means it must stop after a certain number of steps? A Input B Output C Finiteness D Effectiveness
25 What is an algorithm dry run? A Writing an algorithm B Executing algorithm step by step manually C Deleting algorithm D Compiling code