10 Computer Science Chapter 2: Computational Thinking & Algorithms Notes

10th Class Computer Science · Federal Board (FBISE)

Federal Board 10 Computer Science Chapter 2 (Unit 2), Computational Thinking & Algorithms, notes for 10th Class Computer Science: short questions, long questions, MCQs (24 short questions, 7 long questions).

Open any notes below to read or download them, and revise the chapter's important short and long questions listed on this page.

Notes for this chapter

Short Questions

10 Computer Science Chapter 2 Short Questions

Read notes

Long Questions

10 Computer Science Chapter 2 Long Questions

Read notes

MCQs

10 Computer Science Chapter 2 MCQs

Read notes

Exercise Solutions

10 Computer Science Chapter 2 Exercise Solutions

Coming soon

Sign in for free to download notes as PDF.

10 Computer Science Chapter 2 short questions

  1. Consider 3 boys and 3 girls who want to team up as pairs for the 14th August student performance at school. Find the total number of ways these pairs could be formed, using Counting Principle Problems.

    Important
  2. Suppose you have selected a black pant to attend a school function and have three options of shirt to choose. Find the total number of ways you can dress up, using Counting Principle Problems.

    Important
  3. The pen holder on a study table contains 2 blue pens, 1 black pen, and 2 lead pencils. How many options do you have for writing?

    Important
  4. For a sports day race, 6 students are selected from a group of 20 to run in the first race. How many different orders of the six lanes for these students may be chosen?

    Important
  5. What is the inclusion-exclusion principle?

    Important
  6. Explain the Pigeonhole Principle.

    Important
  7. What is the role of algorithms in computational problem-solving?

    Important
  8. Write down the properties of a good algorithm.

    Important
  9. List the characteristics of an algorithm.

    Important
  10. Give examples of applications of algorithms.

    Important
  11. What is logical reasoning?

    Important
  12. Explain what merge sort and insertion sort are.

    Important
  13. What is bubble sort and selection sort?

    Important
  14. Why are standard algorithms important in computational thinking?

    Important
  15. What are the key concepts of Computational Thinking?

    Important
  16. Write down the steps to implement modular design.

    Important
  17. What is dry running of an algorithm?

    Important
  18. What are the steps to dry run an algorithm?

    Important
  19. What is a trace table?

    Important
  20. What are errors and their types?

    Important
  21. What is permutation?

  22. What is combination?

  23. Define an algorithm.

  24. What is Boolean logic?

10 Computer Science Chapter 2 long questions

  1. What are algorithms and write down their properties.

    Important
  2. Explain any 2 standard sorting and searching algorithms.

    Important
  3. What are core concepts of computational thinking.

    Important
  4. What are generalized solutions and write down steps to create generalized solutions.

    Important
  5. What is modular design and write down steps to implement modular design.

    Important
  6. What is algorithm dry run and write steps of dry run.

    Important
  7. Perform dry run of algorithm that finds largest number from a list of numbers. Example input list: [3, 1, 4, 1, 5, 9, 2, 6].

More for this chapter

All 10 Computer Science chapters – notes

10 Computer Science notes

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.