Start learning →

B.Sc IT Problem Solving and Algorithms — practice questions

Explore 28 free Problem Solving and Algorithms questions in B.Sc IT Computer Science. Open each question or exercise to read its content, reference answers and available explanation.

Practise Problem Solving and Algorithms with Quill →

Problem Solving and Algorithms questions and exercises with answers

Showing questions 1–28 of 28.

A finite sequence of steps required to get the desired output is called an:Read the answer and worked solution →An algorithm has a definite beginning, a definite end and consists of:Read the answer and worked solution →The two common methods of representing an algorithm are pseudocode and:Read the answer and worked solution →A flowchart is a diagram made of boxes, diamonds and shapes connected by:Read the answer and worked solution →In programming, repetition is also known as a loop or:Read the answer and worked solution →A solution represented in natural language is called an:Read the answer and worked solution →Problem solving begins with the precise identification of the problem and ends with a:Read the answer and worked solution →Analysing a problem tells us what inputs the program should accept and what it should:Read the answer and worked solution →For a given problem, how many algorithms are possible?Read the answer and worked solution →If a program has syntactical errors, what will be obtained?Read the answer and worked solution →If the output generated is incorrect, the program should be checked for:Read the answer and worked solution →Errors found in the testing phase are rectified and the program is:Read the answer and worked solution →Writing an algorithm is mostly considered the first step to:Read the answer and worked solution →Which characteristic of a good algorithm requires precisely stated steps?Read the answer and worked solution →Which characteristic says the algorithm always stops after a finite number of steps?Read the answer and worked solution →The purpose of using an algorithm is to increase reliability, efficiency and:Read the answer and worked solution →The word pseudo in pseudocode means:Read the answer and worked solution →Decision making involves selecting one alternative based on the outcome of a:Read the answer and worked solution →The spirit of problem solving by decomposition is to:Read the answer and worked solution →An algorithm is refined from a tentative plan until it captures all aspects of the:Read the answer and worked solution →Order the problem solving stepsRead the answer and worked solution →Flip and match the termsRead the answer and worked solution →Pick the right errorRead the answer and worked solution →Tap the algorithm characteristicsRead the answer and worked solution →Complete the algorithm factsRead the answer and worked solution →Group the problem solving ideasRead the answer and worked solution →Stack the correct answersRead the answer and worked solution →Send each idea down its chuteRead the answer and worked solution →

Worked practice questions

A finite sequence of steps required to get the desired output is called an:

  1. Algorithm
  2. Allotment
  3. Alignment
  4. Allowance
Show answer and solution

Correct answer: A. Algorithm

1. A task is completed by following steps in order. 2. When those steps are finite and produce the wanted output, they get a name. 3. Such a finite sequence of steps is called an algorithm. 4. So the answer is an algorithm. _Source: syllabus Computer Science, Ch 4 'Introduction to Problem Solving'_

Open this question →

An algorithm has a definite beginning, a definite end and consists of:

  1. Fixed prices
  2. Finite steps
  3. Fine steps
  4. Filed steps
Show answer and solution

Correct answer: B. Finite steps

1. An algorithm cannot run forever and still be an algorithm. 2. Its length is bounded as well as its ends. 3. An algorithm has a definite beginning and end and consists of a finite number of steps. 4. So the answer is finite steps. _Source: syllabus Computer Science, Ch 4 'Introduction to Problem Solving'_

Open this question →

The two common methods of representing an algorithm are pseudocode and:

  1. Floorplan
  2. Flowmeter
  3. Flowchart
  4. Flashcard
Show answer and solution

Correct answer: C. Flowchart

1. An algorithm has to be written down before it is coded. 2. Two standard ways of writing it are named. 3. There are two common methods of representing an algorithm, flowchart and pseudocode. 4. So the other one is a flowchart. _Source: syllabus Computer Science, Ch 4 'Introduction to Problem Solving'_

Open this question →

How to practise

  1. Choose a Problem Solving and Algorithms question and try to work out your answer.
  2. Open the question to check the correct answer and read its worked solution.
  3. Continue in the app for bite-sized lessons, explanations and review with Quill. You can start without creating an account.

More Computer Science topics

Computer NetworksPython Programming