Start learning →

Engineering — Tanzania Algorithms — practice questions

Explore 30 free Algorithms questions in Engineering — Tanzania Computer Science. Open each question or exercise to read its content, reference answers and available explanation.

Practise Algorithms with Quill →

Algorithms questions and exercises with answers

Showing questions 1–30 of 30.

Arranging a collection of elements into a particular order is called:Read the answer and worked solution →An algorithm repeatedly comparing neighbouring elements and swapping them is:Read the answer and worked solution →Exchanging the positions of two elements with each other is called:Read the answer and worked solution →For a list of n elements, bubble sort makes a total number of passes equal to:Read the answer and worked solution →To sort in ascending order, bubble sort places at the end of each pass the element that is:Read the answer and worked solution →The image of the biggest value rising through the list gives bubble sort its:Read the answer and worked solution →After each bubble sort pass, the sorted element is dropped from later passes, so the working list:Read the answer and worked solution →Selection sort divides the list into an unsorted right list and a left list that is:Read the answer and worked solution →At the start of selection sort, the left list contains a number of elements equal to:Read the answer and worked solution →In each selection sort pass, the smallest remaining element is swapped with the element that is:Read the answer and worked solution →For a list of n elements, selection sort makes a number of passes equal to:Read the answer and worked solution →Placing each element into its correct spot among those already sorted describes:Read the answer and worked solution →Insertion sort is compared to arranging a hand of playing:Read the answer and worked solution →The amount of time an algorithm takes to process given data is called its time:Read the answer and worked solution →With huge real-world data sets, comparing algorithms before choosing one becomes:Read the answer and worked solution →An algorithm with no loop at all has a time complexity of:Read the answer and worked solution →An algorithm with a single loop running from 1 to n has a time complexity of:Read the answer and worked solution →Algorithms whose running time grows in step with the input are called:Read the answer and worked solution →A loop placed inside another loop gives a time complexity of:Read the answer and worked solution →Algorithms whose running time follows that nested pattern are called:Read the answer and worked solution →When a program contains both a nested loop and a single loop, complexity is judged from the:Read the answer and worked solution →Bubble sort, selection sort and insertion sort all have a time complexity of:Read the answer and worked solution →Catch the sorting wordsRead the answer and worked solution →Pop the complexity classesRead the answer and worked solution →Run the algorithm gatesRead the answer and worked solution →Slice the algorithm wordsRead the answer and worked solution →Bubble or selectionRead the answer and worked solution →Sort the algorithm wordsRead the answer and worked solution →Type the numberRead the answer and worked solution →Sorting bingoRead the answer and worked solution →

Worked practice questions

Arranging a collection of elements into a particular order is called:

  1. Sorting
  2. Storing
  3. Scaling
  4. Sharing
Show answer and solution

Correct answer: A. Sorting

1. The elements themselves do not change. 2. Only their arrangement is altered. 3. That process is sorting. _Source: syllabus Computer Science Class XII, Chapter 5, Sorting._

Open this question →

An algorithm repeatedly comparing neighbouring elements and swapping them is:

  1. Border sort
  2. Bubble sort
  3. Bucket sort
  4. Barrel sort
Show answer and solution

Correct answer: B. Bubble sort

1. Only adjacent pairs are ever compared. 2. Out of order pairs are exchanged. 3. That algorithm is bubble sort. _Source: syllabus Computer Science Class XII, Chapter 5, Sorting._

Open this question →

Exchanging the positions of two elements with each other is called:

  1. Swapping
  2. Stacking
  3. Splicing
  4. Stamping
Show answer and solution

Correct answer: A. Swapping

1. Neither element leaves the list. 2. They simply trade places. 3. That move is swapping. _Source: syllabus Computer Science Class XII, Chapter 5, Sorting._

Open this question →

How to practise

  1. Choose a 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 ScienceData StructuresSorting Algorithms