A) Solving problems systematically using concepts and methods from computing B) Writing only computer hardware manuals C) Replacing all mathematical reasoning D) Using computers without planning
2. Decomposition means:
A) Combining unrelated problems B) Breaking a complex problem into smaller manageable parts C) Removing all inputs D) Converting every problem to binary
3. A benefit of decomposition is that it:
A) Makes every problem larger B) Removes the need for testing C) Makes complex problems easier to understand and solve D) Prevents the use of algorithms
4. Pattern recognition involves:
A) Ignoring repeated information B) Deleting similar data C) Choosing a programming language first D) Identifying similarities, trends or repeated structures in problems
5. Abstraction means:
A) Focusing on essential details while ignoring unnecessary detail B) Including every possible detail C) Avoiding models D) Writing code without understanding the problem
6. An abstraction is useful because it:
A) Always gives a unique answer B) Reduces complexity by representing important features of a problem C) Eliminates all errors automatically D) Requires no assumptions
7. An algorithm is:
A) A computer component B) A programming language C) A finite, ordered set of steps for solving a problem or performing a task D) A storage device
8. A good algorithm should be:
A) Infinite and ambiguous B) Dependent on one specific keyboard C) Written only in machine code D) Clear, finite and unambiguous
9. The input of an algorithm refers to:
A) Data supplied to the algorithm for processing B) The final result only C) The computer screen D) The programming language used
10. The output of an algorithm is:
A) The initial data B) The result produced after processing C) The keyboard input only D) The algorithm's first step
11. A flowchart represents an algorithm:
A) Using only paragraphs B) Using only source code C) Graphically using standardized symbols and flow lines D) Using only numbers
12. In a flowchart, an oval is commonly used for:
A) A decision B) A process C) Input/output D) Start or end
13. In a flowchart, a rectangle normally represents:
A) A process or operation B) A decision C) A connector only D) Start/end
14. In a flowchart, a diamond normally represents:
A) Input/output B) A decision or condition C) A process D) A comment
15. In a flowchart, a parallelogram commonly represents:
A) A loop B) A decision C) Input or output D) Program termination only
16. Arrows in a flowchart indicate:
A) The data type B) The variable name C) The programming language D) The direction of control flow
17. Pseudocode is:
A) A structured, informal description of an algorithm using programming-like statements B) Executable machine code C) A hardware circuit D) A database table
18. Pseudocode is useful because it:
A) Must follow the syntax of one programming language B) Helps describe program logic without being tied to a specific programming language C) Can only be used after coding D) Eliminates the need for algorithms
19. A sequence structure means instructions are:
A) Executed randomly B) Repeated forever C) Executed in a specified order D) Executed only when an error occurs
20. Selection in an algorithm is used when:
A) Every instruction must execute exactly once B) There are no conditions C) Data cannot change D) Different actions are required depending on a condition
21. Iteration means:
A) Repeating a set of instructions B) Ending a program C) Removing an input D) Converting text to binary
22. A loop is an example of:
A) Selection only B) Iteration C) Decomposition only D) Abstraction only
23. A condition in an algorithm usually evaluates to:
A) A file B) A decimal fraction only C) True or false D) A flowchart symbol
24. An algorithm that repeatedly checks a condition before executing a loop body uses:
A) Only sequence B) Only abstraction C) Only decomposition D) A conditional iteration structure
25. Dry running an algorithm means:
A) Tracing its steps manually with sample input to check its behaviour B) Running it only on a server C) Deleting its variables D) Converting it into a flowchart automatically
26. A trace table is useful for:
A) Drawing computer hardware B) Recording changing values of variables during an algorithm's execution C) Storing images D) Measuring internet speed
27. An algorithm's correctness means that it:
A) Uses the shortest code B) Always runs fastest C) Produces the intended output for valid inputs D) Uses a particular programming language
28. Efficiency of an algorithm can relate to:
A) Only screen resolution B) Only file names C) Only variable names D) Resources such as time and memory used during execution
29. A finite algorithm must:
A) Terminate after a finite number of steps B) Run forever C) Have no output D) Contain a loop
30. Unambiguous instructions are instructions that:
A) Can be interpreted in many conflicting ways B) Have one clear intended meaning C) Contain no verbs D) Must be written in binary
31. A problem statement should identify:
A) Only the programming language B) Only the output C) The problem, relevant inputs, required processing and expected outputs D) Only the computer model
32. A problem-solving strategy often begins by:
A) Writing random code B) Choosing colours for the interface C) Testing without inputs D) Understanding and defining the problem
33. Which is an example of decomposition?
A) Dividing a student-result system into input, calculation, grading and reporting tasks B) Writing the whole system as one instruction C) Ignoring the grading rules D) Deleting the output
34. Which is an example of pattern recognition?
A) Treating every problem as completely unique B) Noticing that several tasks require the same calculation method C) Removing repeated data D) Avoiding examples
35. Which is an example of abstraction?
A) Listing every internal detail of a printer B) Describing every electrical signal C) Representing a car by its important controls and functions rather than every component D) Ignoring the purpose of the car
36. A step-by-step recipe is similar to an algorithm because it:
A) Must use programming syntax B) Requires a computer C) Cannot have inputs D) Provides an ordered sequence of instructions to achieve a result
37. If an algorithm asks for two numbers and then adds them, the two numbers are:
A) Inputs B) Outputs C) Decisions D) Loops
38. In the same addition algorithm, the sum is the:
A) Input B) Output C) Condition D) Decomposition
39. A decision symbol in a flowchart normally has:
A) No possible outcomes B) One mandatory outcome only C) Two or more possible branches depending on the condition D) Only an input branch
40. A flowchart connector may be used to:
A) Calculate a sum B) Represent a decision C) Store a variable D) Connect separated parts of a flowchart
41. The top-down approach to problem solving generally starts with:
A) The overall problem and progressively breaks it into smaller parts B) The smallest code statement only C) The final output only D) Hardware selection
42. Bottom-up development generally involves:
A) Starting with the complete system and ignoring components B) Building larger solutions from smaller components C) Avoiding reusable components D) Removing abstraction
43. A modular solution is one that:
A) Has no separate parts B) Uses only one instruction C) Divides a system into manageable components or modules D) Cannot be tested
44. Reusable components can:
A) Increase duplication in every case B) Prevent decomposition C) Make algorithms infinite D) Reduce repeated work and improve maintainability
45. Testing an algorithm with boundary values is useful for finding:
A) Problems at or near the limits of valid input B) Only spelling mistakes C) Only hardware faults D) Only formatting errors
46. A validation rule checks whether:
A) The algorithm is the fastest possible B) Input data meets specified requirements or constraints C) The computer is switched on D) The screen is large enough
47. An algorithm should handle invalid input by:
A) Ignoring it in every situation B) Always crashing C) Applying appropriate validation or error handling D) Changing the problem statement
48. A decision table can be useful for:
A) Drawing physical circuits B) Replacing all algorithms C) Measuring CPU temperature D) Organizing conditions and corresponding actions systematically
49. Computational thinking can be applied:
A) To problems in many fields, not only computer programming B) Only to coding competitions C) Only to hardware repair D) Only to mathematics exams
50. The relationship between computational thinking and algorithms is that:
A) They are unrelated concepts B) Computational thinking helps formulate problems and algorithms provide step-by-step solutions C) Algorithms replace decomposition D) Computational thinking is only a programming language
These MCQs are prepared with reference to the FBISE HSSC-I Computer Science Assessment Framework and the National Curriculum of Pakistan 2022–23. They focus on computational problem-solving concepts including decomposition, pattern recognition, abstraction, algorithm design, flowcharts, pseudocode, sequence, selection, iteration, tracing, testing, validation and efficient problem-solving approaches.