Home / FBISE Study Portal

MCQs — Computational Thinking & Algorithms

Practice questions for Computer Science.

← Back to Computational Thinking & Algorithms

Question 61

A program calculates a student's grade. Which detail is NOT needed?

A. Marks in each subject

B. Total marks

C. The student's favourite hobby

D. Passing marks

Question 62

A program is designed to plan a school bus route. Which detail is essential?

A. The locations of the bus stops

B. The colour of the seats

C. The driver's favourite food

D. The brand of the bus tyres

Question 63

Which of the following is an example of abstraction?

A. A weather app showing only the temperature and the chance of rain

B. A list of every reading recorded by the weather station

C. Copying all the data into another file

D. Writing the data in a different colour

Question 64

What may happen if an important detail is removed by mistake during abstraction?

A. The solution may be incomplete or incorrect

B. The solution automatically becomes faster

C. The problem is solved automatically

D. Nothing changes

Question 65

What is an algorithm?

A. A finite set of clear steps used to solve a problem

B. A type of computer hardware

C. A program that never ends

D. A picture stored on a computer

Question 66

Which is a characteristic of a good algorithm?

A. It must contain at least one loop

B. Each step must be clear and unambiguous

C. It must be written in a programming language

D. It must have exactly ten steps

Question 67

Which property means that an algorithm must stop after a limited number of steps?

A. Ambiguity

B. Repetition

C. Selection

D. Finiteness

Question 68

In the algorithm 'input a number, double it, display the result', which control structure is used?

A. Sequence

B. Selection

C. Iteration

D. Decomposition

Question 69

Which control structure is used in this step: 'If marks are 50 or more, display Pass; otherwise display Fail'?

A. Sequence

B. Iteration

C. Selection

D. Abstraction

Question 70

Which control structure repeats one or more steps?

A. Sequence

B. Selection

C. Input

D. Iteration

Question 71

Why must the steps of an algorithm be in the correct order?

A. Changing the order may give a wrong result

B. Order does not matter

C. Correct order makes the algorithm longer

D. Correct order removes the input

Question 72

How does an algorithm differ from a program?

A. An algorithm is the plan of steps, while a program is that plan written in a programming language

B. An algorithm is hardware, while a program is software

C. An algorithm is always longer than a program

D. An algorithm can only be run on a computer

Question 73

Why should an algorithm be checked with sample data before it is coded?

A. To find mistakes in the logic early

B. To make it run on any device

C. To remove the need for a program

D. To reduce the number of inputs

Question 74

Which of the following is a well-written algorithm step?

A. Do something with the numbers

B. Maybe calculate the total

C. Work it out somehow

D. Add the two numbers

Question 75

In an algorithm to find the larger of two numbers, which step uses selection?

A. Input A and B

B. If A is greater than B display A, otherwise display B

C. Start

D. Stop

Question 76

Which is the correct order for an algorithm that adds two numbers and displays the sum?

A. Input two numbers, add them, display the sum

B. Display the sum, input two numbers, add them

C. Add the numbers, input two numbers, display the sum

D. Input two numbers, display the sum, add them

Question 77

An algorithm sets total = 0, adds 5 to total, adds 3 to total and then displays total. What is displayed?

A. 3

B. 5

C. 15

D. 8

Question 78

An algorithm finds the perimeter of a rectangle as 2 x (length + width). What is the output if length = 6 and width = 4?

A. 10

B. 24

C. 20

D. 48

Question 79

Which word in an algorithm step shows that a step is repeated?

A. Otherwise

B. Repeat

C. Display

D. Input

Question 80

Which of the following are common solution design methods?

A. Algorithm, flowchart and pseudocode

B. Keyboard, mouse and monitor

C. Input, output and storage

D. Compiler, interpreter and assembler

🎯 How to get the most out of these questions

Attempt each question before revealing the answer.
Read the explanation even when you answered correctly — it reinforces the concept.
Note down any question you got wrong and revisit it the next day.
Use the pagination below the list to work through every page — do not stop at page 1.

📌 MCQs — FAQs

Are the answers in this section verified?

Yes — every answer on this page has been verified. MCQs also include explanations where available.

Can I print these questions?

Yes — use your browser's print option (Ctrl+P / Cmd+P) to print or save the page as PDF.

How often are questions updated?

New questions are added regularly. If a paper pattern changes, existing questions are reviewed and updated.