CS Unit1 : Problem Solving

What is an algorithm?

• A programming language

• A step-by-step set of instructions

• A computer program

• A storage device

Answer explanation

An algorithm is defined as a step-by-step set of instructions designed to perform a task or solve a problem. This distinguishes it from programming languages, computer programs, and storage devices, which serve different purposes.

Which of the following best describes pseudocode?

• A computer programming language

• Human-readable representation of an algorithm

• Flowchart diagram

• Binary representation

Answer explanation

Pseudocode is a human-readable representation of an algorithm, allowing programmers to outline their logic without the syntax of a specific programming language. This makes it easier to understand and communicate algorithms.

Which symbol is used in a flowchart to represent a decision?

• Rectangle

• Diamond

• Circle

• Parallelogram

Answer explanation

In a flowchart, a diamond symbol is used to represent a decision point, where a question is asked and the flow can branch based on the answer. Other shapes like rectangles and circles serve different purposes.

Which flowchart symbol represents input/output?

• Rectangle

• Parallelogram

• Diamond

• Oval

Answer explanation

The parallelogram symbol in flowcharts is used to represent input and output operations, such as reading data or displaying results. This distinguishes it from other symbols like rectangles for processes and diamonds for decisions.

What is the main purpose of decomposition?

• To delete unnecessary steps

• To break down a problem into smaller parts

• To speed up algorithms

• To combine two algorithms

Answer explanation

The main purpose of decomposition is to break down a problem into smaller parts, making it easier to understand and solve. This approach allows for tackling complex issues systematically.

Which of the following is NOT a searching algorithm?

• Binary Search

• Linear Search

• Bubble Sort

• Sequential Search

Answer explanation

Bubble Sort is not a searching algorithm; it is a sorting algorithm. The other options, Binary Search, Linear Search, and Sequential Search, are all methods used to find elements in a dataset.

In binary search, the list must be:

• Random

• Sorted

• Very large

• Indexed

Answer explanation

In binary search, the list must be sorted to allow the algorithm to efficiently eliminate half of the search space at each step. If the list is not sorted, the search will not function correctly.

Which sorting algorithm repeatedly swaps adjacent elements if they are in the wrong order?

• Bubble Sort

• Merge Sort

• Binary Sort

• Quick Sort

Answer explanation

Bubble Sort is the algorithm that repeatedly swaps adjacent elements if they are in the wrong order. It continues this process until the entire list is sorted, making it a simple yet inefficient sorting method.

What is the first step when solving a complex computational problem?

• Writing pseudocode

• Decomposition

• Coding

• Debugging

Answer explanation

The first step in solving a complex computational problem is decomposition. This involves breaking the problem down into smaller, more manageable parts, making it easier to understand and solve.

What is abstraction in problem solving?

• Focusing on unimportant details

• Ignoring details that are not needed

• Writing flowcharts

• Creating pseudocode

Answer explanation

Abstraction in problem solving involves ignoring details that are not needed to focus on the essential aspects of a problem. This helps simplify complex issues and allows for clearer thinking and solutions.