1.
Which of the following is NOT a characteristic of an algorithm?
A
Finiteness
B
Clarity
C
Ambiguity
D
Effectiveness
2.
Which approach focuses on solving a class of problems?
A
Specific solution
B
Generalized solution
C
Trial and error
D
Random solution
3.
Which principle helps in solving basic counting problems?
A
Logical fallacy
B
Counting principle
C
Flowchart principle
D
Debugging principle
4.
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
5.
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
6.
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
7.
Which of the following is an example of logical reasoning?
A
Guessing
B
Random selection
C
If-then decision making
D
Copying data
8.
Which is the final step of problem solving?
A
Understanding
B
Designing
C
Testing and evaluation
D
Abstraction
9.
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
10.
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
11.
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
12.
Which step comes after designing an algorithm?
A
Problem identification
B
Testing and verification
C
Ignoring errors
D
Data deletion
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 of the following is NOT a step in algorithm design?
A
Understanding problem
B
Designing solution
C
Executing hardware
D
Testing
15.
Which topic focuses on identifying mistakes?
A
Abstraction
B
Errors
C
Counting principles
D
Modular design
16.
An error in an algorithm means:
A
Correct output
B
Unexpected or wrong result
C
Fast execution
D
Hardware failure
17.
What is an algorithm?
A
A computer program
B
A flowchart
C
A step-by-step solution to a problem
D
A programming language
18.
Logical reasoning in computing helps to:
A
Decorate programs
B
Make decisions correctly
C
Increase hardware speed
D
Avoid algorithms
19.
Breaking down a large, complex problem into smaller, manageable parts is known as:
A
Modular Design
B
Abstraction
C
Dry Run
D
Generalization
20.
Counting principles are mainly used in:
A
Decision making
B
Finding number of possible outcomes
C
Debugging
D
Error handling
21.
Algorithms are independent of:
A
Problem
B
Programming language
C
Logic
D
Steps
22.
Standard algorithms are:
A
User-defined algorithms
B
Algorithms with no rules
C
Well-known and commonly used algorithms
D
Hardware algorithms
23.
A problem that can be divided into smaller parts supports:
A
Abstraction
B
Modular design
C
Counting principle
D
Error handling
24.
Logical reasoning mainly deals with:
A
Facts and rules
B
Hardware
C
Memory
D
Storage devices
25.
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
26.
An algorithm must produce:
A
Infinite results
B
No output
C
At least one output
D
Only input
27.
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
28.
Which tool is commonly used to represent algorithms?
A
Compiler
B
Flowchart
C
Database
D
Browser
29.
Which concept breaks a big problem into parts?
A
Abstraction
B
Modular design
C
Counting
D
Dry run
30.
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
31.
Which property ensures same output for same input?
A
Generality
B
Definiteness
C
Finiteness
D
Modularity
32.
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
33.
Main advantage of modular design is:
A
Increased complexity
B
Easy testing and maintenance
C
More errors
D
Longer code
34.
Which feature helps reuse a solution for different inputs?
A
Hard coding
B
Generalization
C
Errors
D
Debugging
35.
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
36.
Algorithms should be written in:
A
Ambiguous language
B
Clear and simple language
C
Binary code
D
Machine language only
37.
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
38.
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
39.
What is an algorithm dry run?
A
Writing an algorithm
B
Executing algorithm step by step manually
C
Deleting algorithm
D
Compiling code
40.
If a restaurant offers 3 types of bread and 4 types of fillings for a sandwich, how many different sandwiches can be made?