10 Computer Science Chapter 2: Computational Thinking & Algorithms

10th Class Computer Science · Federal Board (FBISE)

Federal Board 10 Computer Science Chapter 2 (Unit 2), Computational Thinking & Algorithms: 12 topics, 60 MCQs with answers, notes with short and long questions.

This chapter covers 2.1 Computing Problems, 2.2 Basics of Counting Problems, 2.3 Basic Counting Principles, 2.4 Algorithms and their Characteristics, 2.5 Logical Reasoning, 2.6 Standard Algorithms, 2.7 Steps in Algorithms / Core Computational Thinking Concepts, 2.8 Abstraction, 2.9 Creating Generalized Solutions, 2.10 Modular Design, 2.11 Algorithm Dry Run, 2.12 Errors. Read the notes, revise the short and long questions, and practise the MCQs to prepare it fully.

Sample MCQs from Chapter 2

  1. Q1

    A computing problem in computer science is best described as one that is solved through what process?

    1. ARandom guessing
    2. BStep-by-step computation
    3. CManual trial only
    4. DVisual inspection only
    Show answer

    Correct answer: B. Step-by-step computation

    Computing problems are solved step-by-step through computation, with well-defined inputs and outputs.

  2. Q2

    "Given a number n, is n even?" is an example of which type of computing problem?

    1. ASearch problem
    2. BCounting problem
    3. CDecision problem
    4. DSorting problem
    Show answer

    Correct answer: C. Decision problem

    Decision problems typically require a yes-or-no answer, such as checking if a number is even.

  3. Q3

    Finding a route from Islamabad to Lahore on a map is an example of which type of computing problem?

    1. ADecision problem
    2. BSearch problem
    3. CCounting problem
    4. DSorting problem
    Show answer

    Correct answer: B. Search problem

    Search problems involve finding a solution, such as a route, that satisfies certain criteria.

  4. Q4

    If there are two roads (G.T. Road and Motorway) from Islamabad to Lahore, finding how many possible routes exist is an example of which type of problem?

    1. ADecision problem
    2. BSearch problem
    3. CCounting problem
    4. DSorting problem
    Show answer

    Correct answer: C. Counting problem

    Counting problems ask for the number of possible solutions to a search problem.

  5. Q5

    Which structural approach is most effective for solving Counting Principle problems?

    1. ATable-based
    2. BTree-based
    3. CGraph-based
    4. DList-based
    Show answer

    Correct answer: B. Tree-based

    Tree-based structures represent available options as branches, making counting problems easier to understand.

All 60 MCQs for Chapter 2

Topics in Chapter 2

All 10 Computer Science chapters

10 Computer Science overview

Frequently asked questions

What topics are in 10 Computer Science Chapter 2?

2.1 Computing Problems; 2.2 Basics of Counting Problems; 2.3 Basic Counting Principles; 2.4 Algorithms and their Characteristics; 2.5 Logical Reasoning; 2.6 Standard Algorithms; 2.7 Steps in Algorithms / Core Computational Thinking Concepts; 2.8 Abstraction; 2.9 Creating Generalized Solutions; 2.10 Modular Design; 2.11 Algorithm Dry Run; 2.12 Errors.

A little trouble connecting

We could not reach IlmiDunya. Your connection may be slow or interrupted. Check your connection and try again.

If you were saving or submitting, check the result before trying again.

Account blocked

You are blocked from using IlmiDunya. Contact support to unblock your account.