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
Long Questions
10 Computer Science Chapter 2 Long Questions
MCQs
10 Computer Science Chapter 2 MCQs
Exercise Solutions
10 Computer Science Chapter 2 Exercise Solutions
Sign in for free to download notes as PDF.
10 Computer Science Chapter 2 short questions
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.
ImportantSuppose 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.
ImportantThe 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?
ImportantFor 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?
ImportantWhat is the inclusion-exclusion principle?
ImportantExplain the Pigeonhole Principle.
ImportantWhat is the role of algorithms in computational problem-solving?
ImportantWrite down the properties of a good algorithm.
ImportantList the characteristics of an algorithm.
ImportantGive examples of applications of algorithms.
ImportantWhat is logical reasoning?
ImportantExplain what merge sort and insertion sort are.
ImportantWhat is bubble sort and selection sort?
ImportantWhy are standard algorithms important in computational thinking?
ImportantWhat are the key concepts of Computational Thinking?
ImportantWrite down the steps to implement modular design.
ImportantWhat is dry running of an algorithm?
ImportantWhat are the steps to dry run an algorithm?
ImportantWhat is a trace table?
ImportantWhat are errors and their types?
ImportantWhat is permutation?
What is combination?
Define an algorithm.
What is Boolean logic?
10 Computer Science Chapter 2 long questions
What are algorithms and write down their properties.
ImportantExplain any 2 standard sorting and searching algorithms.
ImportantWhat are core concepts of computational thinking.
ImportantWhat are generalized solutions and write down steps to create generalized solutions.
ImportantWhat is modular design and write down steps to implement modular design.
ImportantWhat is algorithm dry run and write steps of dry run.
ImportantPerform dry run of algorithm that finds largest number from a list of numbers. Example input list: [3, 1, 4, 1, 5, 9, 2, 6].