1.
Algorithms are independent of:
A
Problem
B
Programming language
C
Logic
D
Steps
2.
Errors found during dry run are mostly:
A
Syntax errors
B
Logical errors
C
Hardware errors
D
Network errors
3.
An error in an algorithm means:
A
Correct output
B
Unexpected or wrong result
C
Fast execution
D
Hardware failure
4.
Counting principles are mainly used in:
A
Decision making
B
Finding number of possible outcomes
C
Debugging
D
Error handling
5.
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
6.
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
7.
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
8.
Which principle helps in solving basic counting problems?
A
Logical fallacy
B
Counting principle
C
Flowchart principle
D
Debugging principle
9.
Which of the following is an example of logical reasoning?
A
Guessing
B
Random selection
C
If-then decision making
D
Copying data
10.
Which concept improves program readability?
A
Errors
B
Modular design
C
Counting
D
Randomization
11.
Counting problems are mainly used to:
A
Store data
B
Calculate the number of possible outcomes
C
Design hardware
D
Write algorithms
12.
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
13.
Which error prevents a program from running?
A
Logical error
B
Syntax error
C
Output error
D
Design error
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
15.
A generalized solution means:
A
Solution for one case only
B
Solution that works for many similar problems
C
No solution
D
Hardware solution
16.
Which property ensures same output for same input?
A
Generality
B
Definiteness
C
Finiteness
D
Modularity
17.
What is the first step in solving a computational problem?
A
Writing code
B
Understanding the problem
C
Testing output
D
Debugging
18.
Which of the following is NOT a step in algorithm design?
A
Understanding problem
B
Designing solution
C
Executing hardware
D
Testing
19.
Which step comes after designing an algorithm?
A
Problem identification
B
Testing and verification
C
Ignoring errors
D
Data deletion
20.
If a restaurant offers 4 types of main courses and 3 types of drinks, how many different meal combinations can be made?