Topic 4

Question 1

What is the role of sub-procedures in problem solving?

Answer 1

Sub-procedures help break down complex problems into manageable parts.

Question 2

When is decision making required in a specified situation?

Answer 2

When there are multiple options or paths to consider.

Question 3

What decisions are required for the solution to a specified problem?

Answer 3

Decisions related to the steps and methods to be used in solving the problem.

Question 4

What does the term ‘condition’ refer to in decision-making?

Answer 4

The specific circumstances or criteria that must be met for a decision to be valid.

Question 5

What is the relationship between decisions and conditions in a system?

Answer 5

Decisions depend on conditions being met to proceed.

Question 6

What are logical rules in real-world situations?

Answer 6

Rules deduced from observations that guide decision-making.

Question 7

What are inputs and outputs in a solution?

Answer 7

Inputs are the data required to process, and outputs are the results produced.

Question 8

What is pre-planning in problem solving?

Answer 8

Identifying necessary steps before executing a solution.

Question 9

What is the difference between sequential and concurrent tasks?

Answer 9

Sequential tasks occur one after another, while concurrent tasks happen simultaneously.

Question 10

What is a Gantt chart?

Answer 10

A tool used to track events and schedules.

Question 11

Give an example of pre-planning in real life.

Answer 11

Pre-ordering a game before its actual release.

Question 12

Why are pre-conditions important when executing an algorithm?

Answer 12

They ensure that necessary requirements are met before execution.

Question 13

What are pre-conditions and post-conditions in a problem?

Answer 13

Constraints that define the state of the system before and after execution.

Question 14

What is an example of an exception to consider in a problem solution?

Answer 14

Calculating the end-of-year bonus when not all employees have worked the entire year.

Question 15

What does it mean for parts of a solution to be implemented concurrently?

Answer 15

It means two or more processes occur at the same time.

Question 16

How can concurrent processing solve a problem?

Answer 16

By increasing computation speed and allowing simultaneous task handling.

Question 17

What factors should be evaluated when deciding on concurrent processing?

Answer 17

1) Time savings
2) Cost implications
3) Physical feasibility
4) Consequences of non-concurrency

Question 18

What is the definition of abstraction in computer science?

Answer 18

The process of simplifying complex systems by focusing on essential characteristics.

Question 19

Why is abstraction necessary in computational solutions?

Answer 19

It helps manage complexity and allows focus on essential aspects of a problem.

Question 20

What are the four key standard algorithms for linear arrays?

Answer 20

1) Sequential search
2) Binary search
3) Bubble sort
4) Selection sort

Question 21

What is a sequential search?

Answer 21

An algorithm that finds an item in a list by checking each element in order.

Question 22

Describe how a binary search works.

Answer 22

It compares the target value to the middle element and eliminates half the array.

Question 23

What is bubble sort?

Answer 23

An algorithm that repeatedly steps through a list, swapping adjacent items if they are in the wrong order.

Question 24

What is selection sort?

Answer 24

An algorithm that divides the list into sorted and unsorted sublists, finding the smallest element to place in the sorted list.

Question 25

What should be discussed when analyzing an algorithm?

Answer 25

The differences between standard and novel algorithms, including their advantages and disadvantages.

Question 26

What does it mean to analyze an algorithm presented as a flow chart?

Answer 26

It involves tracing the algorithm and assessing its correctness.

Question 27

What is the definition of algorithm complexity?

Answer 27

A measure of the time and/or space required by an algorithm for a given input size.

Question 28

What is the difference between best case, worst case, and average case in algorithm analysis?

Answer 28

Worst Case: Maximum run time
Best Case: Optimistic scenario
Average Case: General behavior measure

Question 29

What are iterations in the context of algorithms?

Answer 29

The number of times a particular step in an algorithm is performed.