GLOBAL SCHOOL SYSTEM

Multiple-Choice Questions (MCQs):

Topic 2.6: Standard Algorithms

1 .In computational thinking standard algorithms are fundamental method used to solve ------
problems.
A. Generic B. Special
C. Common D. Complex

2. ------ algorithms are used to arrange data in specific order.

A. Selection sort B. bubble sort
C. Sorting algorithm D. all of these

3. In which standard algorithms list divides into a sorted and an unsorted part?
A. Sorting algorithm B. Merge sort
C. bubble sort D. Selection sort

4. In bubble sort steps repeat compares adjacent elements and swaps them if they are in.____ order
A. Right B. Wrong
C. Both of these D. None of these

2.7: Steps in algorithm to solve computational problems

5. ________ breakdown larger problem into smaller ones and working on them one by one.
A. Abstraction B. Pattern recognition
C. Decomposition D. Algorithms design

6._______examine the problem for a pattern or similarities between previously solved problem.
A Decomposition B. Abstraction
C. Pattern recognition D. None of these

7 .In _________unnecessary components should not be given more attention.

A. Algorithm B. Pattern recognition
C. Abstraction D. All of these

8.________ are step by step solution of a problem?

A. Decomposition B. Algorithms
C. Abstraction D. Pattern recognition

2.8: Abstraction

9. Examples of abstractions in the field of computing are .

A.Programming variables. B. Functions

C. Object-Oriented Programming. D .All of these

2.9 Creating Generalized Solutions:

10. The problems could be specific but the best solution needs to be _______

A. limited B. Generic
C. Common D. Special

11.________ is the first step to create generalized solutions.

A. Identify the core problem. B. Develop a generic solution

C. Test with different scenarios. D. Extract common patterns.

12. Different algorithms used different strategies to sort the list of items however end result of each
algorithm is _________.

A. Opposite B. Same

C. Both of these D. Generic

13. For calculating the rectangle area we use the formula?

A. Base× height B. Base × width

C. Length × width D. All of these

2.10: Modular Design

14. Breaking down system into smaller, manageable and interchangeable parts known as?
A. Algorithms B. Abstraction
C. Modules D. Symbols

15. In-_______ modules complete solution of the whole complex problem is solved
A.Define modules B. Integrate modules
C. Design interfaces D. Test modules.

16. In which module both type of testing is necessary?

A. Implement module B. Integrate module
C. Test module D. Allah of these

2.11. Algorithm Dry run

17. To test an algorithm first step is the selection of specific set of ______values?
A. Output B. Variable
C. Input D. None of these

2.12: Errors

18. There are ________types of errors?

A. One B.Three
C. Two D. Five

19. Mistakes related to the structure of an expression similar to grammatical error in writing
A .Logical error B. Both of these
C. syntax error D. None of these

20. Mistakes in reasoning or planning that lead to incorrect conclusion?

A. Logical error B. Syntax error

C. Semantic error D. All of these

Questions and Answers:

Q: What is standard algorithm in computational thinking?

A : In computational thinking standard algorithms are fundamental methods used to solve
common problems.

Q: Name some standard algorithms?

A: Sorting algorithms and searching algorithms are included in standard algorithms.

Q: What is difference between sorting algorithm and searching algorithm?

A: Sorting is the process of arranging items in a specific order while searching is the process of finding a
particular item within a set

Q: How many types of searching algorithms are there?

A: Linear search algorithm that sequentially checks each element in a list until the target element is found or
end of the list is reached. Binary searching algorithm that works on sorted arrays by repeatedly dividing the
search interval in half. It efficiently find the position of a target value within the array.

Q: Discuss the core concept of computational thinking?

A: Decomposition: Complex problems are broken down into sub problems and these sub problems are solved
one at a time .By this process it becomes understandable and simple.
Pattern Recognition: Examine the problem for a pattern or similarities between previously solved problems.
Abstraction: Abstractions helps in reducing complexity and make it easier to develop solutions.
Algorithms: algorithms are the step by step solution of a problem. Each step define some rule to follow that
can solve the problems. For automation and efficiency of a system Algorithms are considered essential parts of
problem solving.
Q: Explain that process by which we make a problem simple to solve and easy to understand.
A: While solving problems, specifically complex problems, the concentration should be on core idea and
unnecessary component should not be given more attention. By doing this we are making our problems
simple to solve and easy to understand.

Q: What are some examples of abstraction in the field of computing?

A: Programming variables:
In Programming chapter we have dealt with data and it is abstractly represented by using different
variables rather than working with constants we use variables that make our solution generic and
easier.
Object- oriented programming:
In object oriented programming actual entities are represented with objects. By doing this we can
conceal the complex details of their implementation.

Q: What is the difference between specific solution and generic solution?

A: The specific solution could only handle that particular situation that is being faced at any particular time
however the generic solution could be any time to handle similar problems.

Q: What are the steps to create generalized Solutions?

A: Identify the core problem: To understand the core problem, first you need to understand specific cases of
problems. Among these specific cases of problems, identify the essential components that are common across
different cases.
Extract common patterns: Identify repeated patterns, in problems, there are some elements that occur
periodically, identify such elements. Bifurcate the elements whether they are specific to the examples or
would be applied more broadly.
Develop a generic solution: Create such a social that are addresses both core and common elements of the
problem. It is better to use variable instead of constant this will help you testing various inputs or conditions.
Test with different scenarios: Test the solution with a wide range of inputs to ensure validity of solution in
different scenarios. If needed, modify your solution based on test results.

Q: Define modules.
A: Modular design is a fundamental concept in software engineering and computational thinking, focused on
breaking down a system into smaller, manageable, and interchangeable part known as modules.

Q: What steps are included to implement modular design.

A: Define modules
Design interfaces
Implement modules
Integrate modules
Test modules

Q: How we identify logical errors in algorithm dry run?

A: The algorithm dry run means manual checking the execution of an algorithm by providing its specific set
of inputs. This helps not only helps to verify algorithms correctness but also to understand algorithms
behavior on certain input and conditions. By doing this we are also able to identify logical errors, if any.

Q: What is the first step of dry run?

A: Choose an input: To test an algorithm the first step is the selection of specific set of input values.

Q: Explain simulate execution.

A: To test algorithm working, each of the algorithm is manually performed by using the chosen inputs.
however, it also need to keep track of variable states ,that may change on performing specific operation.

Q: What is the final step in algorithm dry run?

A: After performing all the required steps of an algorithm, its final output is observed.

Q: Through which procedure we can check that algorithm answer is correct or not?
A: The final output of the algorithm is crosschecked with the expected result. If it matches then it means
algorithm is correct otherwise we review each step to identify if something have gone wrong.

Q: Explain the types of errors.

A:Syntax Errors: Mistakes related to the structure of an expression or statement, similar to grammatical
errors in writing.
Logical Errors: Mistakes in reasoning or planning that lead to incorrect conclusions or results, akin to flawed
problem solving approaches.