1 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
2 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
3 Counting problems are mainly used to: A Store data B Calculate the number of possible outcomes C Design hardware D Write algorithms
4 Which principle helps in solving basic counting problems? A Logical fallacy B Counting principle C Flowchart principle D Debugging principle
5 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
6 What is an algorithm? A A computer program B A flowchart C A step-by-step solution to a problem D A programming language
7 Which of the following is NOT a characteristic of an algorithm? A Finiteness B Clarity C Ambiguity D Effectiveness
9 Which feature ensures an algorithm ends after a limited number of steps? A Input B Output C Finiteness D Generality
10 Logical reasoning in computing helps to: A Decorate programs B Make decisions correctly C Increase hardware speed D Avoid algorithms
11 Which of the following is an example of logical reasoning? A Guessing B Random selection C If-then decision making D Copying data
12 Standard algorithms are: A User-defined algorithms B Algorithms with no rules C Well-known and commonly used algorithms D Hardware algorithms
14 What is the first step in solving a computational problem? A Writing code B Understanding the problem C Testing output D Debugging
15 Which step comes after designing an algorithm? A Problem identification B Testing and verification C Ignoring errors D Data deletion
16 Abstraction in computing means: A Adding extra details B Removing unnecessary details C Writing code D Testing software
17 Why is abstraction important? A It makes problems harder B It hides important data C It simplifies complex problems D It increases errors
18 A generalized solution means: A Solution for one case only B Solution that works for many similar problems C No solution D Hardware solution
19 Which feature helps reuse a solution for different inputs? A Hard coding B Generalization C Errors D Debugging
20 Modular design refers to: A Designing a single large program B Dividing a problem into smaller modules C Ignoring problem parts D Hardware design
21 Main advantage of modular design is: A Increased complexity B Easy testing and maintenance C More errors D Longer code
22 What is an algorithm dry run? A Writing an algorithm B Executing algorithm step by step manually C Deleting algorithm D Compiling code
24 An error in an algorithm means: A Correct output B Unexpected or wrong result C Fast execution D Hardware failure
25 Which error occurs due to wrong logic? A Syntax error B Logical error C Hardware error D Network error
26 Which error prevents a program from running? A Logical error B Syntax error C Output error D Design error
27 Debugging is the process of: A Creating errors B Removing errors C Ignoring errors D Copying programs
29 Algorithms should be written in: A Ambiguous language B Clear and simple language C Binary code D Machine language only
30 Which property ensures same output for same input? A Generality B Definiteness C Finiteness D Modularity
31 A problem that can be divided into smaller parts supports: A Abstraction B Modular design C Counting principle D Error handling
32 Which step verifies correctness of an algorithm? A Dry run B Abstraction C Generalization D Modularization
33 Counting principles are mainly used in: A Decision making B Finding number of possible outcomes C Debugging D Error handling
35 Which approach focuses on solving a class of problems? A Specific solution B Generalized solution C Trial and error D Random solution
37 Which of the following is NOT a step in algorithm design? A Understanding problem B Designing solution C Executing hardware D Testing
38 Errors found during dry run are mostly: A Syntax errors B Logical errors C Hardware errors D Network errors
41 Which topic focuses on identifying mistakes? A Abstraction B Errors C Counting principles D Modular design
43 Which concept breaks a big problem into parts? A Abstraction B Modular design C Counting D Dry run
44 Which is the final step of problem solving? A Understanding B Designing C Testing and evaluation D Abstraction
45 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
46 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.
47 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
48 Breaking down a large, complex problem into smaller, manageable parts is known as: A Modular Design B Abstraction C Dry Run D Generalization
49 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
50 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
51 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
52 A solution that can solve many different problems of the same type, not just one specific problem, is called a: A Generalized Solution B Specific Solution C Temporary Solution D Modular Solution
53 If a restaurant offers 4 types of main courses and 3 types of drinks, how many different meal combinations can be made? A 7 B 12 C 4 D 3
54 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
55 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
56 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
57 What is the process of hiding complex details and showing only the essential features called? A Modular Design B Abstraction C Dry Run D Logical Reasoning
58 Which characteristic of an algorithm means it must stop after a certain number of steps? A Input B Output C Finiteness D Effectiveness
59 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
60 Which type of error is the most difficult to find because the program runs but produces incorrect results? A Syntax Error B Runtime Error C Compilation Error D Logical Error
61 What is a finite set of clear, step-by-step instructions to solve a particular problem called? A An Algorithm B A Flowchart C A Program D A Dry Run
62 If a restaurant offers 3 types of bread and 4 types of fillings for a sandwich, how many different sandwiches can be made? A 7 B 12 C 4 D 3
63 Breaking down a large problem into smaller, more manageable sub-problems is known as what? A Abstraction B Generalization C Modular Design D Dry Run
64 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