GoConqr has a new look! Let us know what you think.

Sign up free

Quiz

Computing Quiz 1

R P 24 questions

Take the quiz

This quiz has question types that open in the usual player.

Questions in this quiz (24)

  1. 1A trace table is a way of identifying any...
    1. Asyntax errors
    2. Blogic errors
    3. Cruntime errors
  2. 2A trace table is a way of identifying any [blank_start]logic[blank_end] errors in the [blank_start]algorithms[blank_end]. Each column represents a [blank_start]variable or output[blank_end] and each [blank_start]row[blank_end] a value of that variable.
    1. Aalgorithms
    2. Blogic
    3. Cvariable or output
    4. Drow
  3. 3What is a logic error?
    1. AAn error in an algorithm that results in incorrect or unexpected behaviour
    2. BAn error that occurs when algorithms are being converted into program code
    3. CAn error that occurs when the program is being executed
  4. 4The four ways of sorting an algorithm are b[blank_start]ubble sort[blank_end], m[blank_start]erge sort[blank_end], bi[blank_start]nary search[blank_end] and l[blank_start]inear search[blank_end].
    1. Aubble sort
    2. Berge sort
    3. Cnary search
    4. Dinear search
  5. 5What is a bubble sort algorithm?
    1. AAn algorithm that goes through a list of data a number of times, comparing two items that are side by side to see which is out of order.
    2. BAn algorithm that continually splits a list in half. Once the two halves are sorted, merging takes place combining them into a single, sorted list.
    3. CAn algorithm that takes the data and keeps dividing it in half until it finds the item it is looking for.
    4. DAn algorithm that starts with the first item and then moves to each item in turn until either a match is found or the search reaches the end of the data set with no match found.
  6. 6What is a merge sort algorithm?
    1. AAn algorithm that goes through a list of data a number of times, comparing two items that are side by side to see which is out of order.
    2. BAn algorithm that continually splits a list in half. Once the two halves are sorted, merging takes place combining them into a single, sorted list.
    3. CAn algorithm that starts with the first item and then moves to each item in turn until either a match is found or the search reaches the end of the data set with no match found.
    4. DAn algorithm that takes the data and keeps dividing it in half until it finds the item it is looking for.
  7. 7What is a binary search algorithm?
    1. AAn algorithm that starts with the first item and then moves to each item in turn until either a match is found or the search reaches the end of the data set with no match found.
    2. BAn algorithm that continually splits a list in half. Once the two halves are sorted, merging takes place combining them into a single, sorted list.
    3. CAn algorithm that takes the data and keeps dividing it in half until it finds the item it is looking for.
    4. DAn algorithm that goes through a list of data a number of times, comparing two items that are side by side to see which is out of order.
  8. 8What is a linear search algorithm?
    1. AAn algorithm that goes through a list of data a number of times, comparing two items that are side by side to see which is out of order.
    2. BAn algorithm that takes the data and keeps dividing it in half until it finds the item it is looking for.
    3. CAn algorithm that continually splits a list in half. Once the two halves are sorted, merging takes place combining them into a single, sorted list.
    4. DAn algorithm that starts with the first item and then moves to each item in turn until either a match is found or the search reaches the end of the data set with no match found.
  9. 9Computational Thinking is the [blank_start]thought process[blank_end] involved in [blank_start]formulating[blank_end] problems and their solutions so that the solutions are represented in a form that can be [blank_start]effectively carried out by a computer[blank_end].
    1. Athought process
    2. Bformulating
    3. Ceffectively carried out by a computer
  10. 10Decomposition is the [blank_start]breaking down[blank_end] of a problem into [blank_start]smaller, more manageable[blank_end] parts which are easier to solve. These are called [blank_start]subprograms[blank_end].
    1. Abreaking down
    2. Bsmaller, more manageable
    3. Csubprograms

Information

Description
Trace Tables Sorting Algorithms Improving Algorithms Abstraction and Decomposition Error identification Code readability Pseudo-code
Author
R P
Language
English
Views
3
Rating
No ratings yet
Rate this quiz
Rate this quiz

Feedback

What is it about?

What do you think of the new look?

How do you like it?