Start learning →

CS Olympiad Models of Computation — practice questions

Explore 30 free Models of Computation questions in CS Olympiad Computer Science. Open each question or exercise to read its content, reference answers and available explanation.

Practise Models of Computation with Quill →

Models of Computation questions and exercises with answers

Showing questions 1–30 of 30.

A system that defines what an algorithm does and how to run it is a:Read the answer and worked solution →The Random Access Machine, the Turing machine and the Lambda calculus are examples of:Read the answer and worked solution →A model used mainly to analyse how efficient an algorithm is, is the:Read the answer and worked solution →An algorithm written in an abstract model has one clear limitation. It cannot be:Read the answer and worked solution →A language in which the programmer must speak in terms the hardware understands is:Read the answer and worked solution →Java and Python are usually classified as languages that are:Read the answer and worked solution →A paradigm where the programmer writes a series of steps to follow in order is:Read the answer and worked solution →A paradigm in which algorithms are written as mathematical functions is:Read the answer and worked solution →Regarding the two paradigms, it is true that all procedural languages are also:Read the answer and worked solution →C++, C#, Java, JavaScript and Swift share one paradigm. They are all:Read the answer and worked solution →A thing that bundles data together with the procedures that act on it is an:Read the answer and worked solution →C is not counted as object oriented because it cannot create objects that are instances of:Read the answer and worked solution →Programs full of jumps that are hard to follow are criticised as messy:Read the answer and worked solution →In an if statement, the line runs only when the condition is:Read the answer and worked solution →Inside a while loop, the statements keep executing only while the condition is:Read the answer and worked solution →In the code x = 10, the item x is the variable and 10 is the:Read the answer and worked solution →Program memory is divided into four blocks: stack, heap, static and:Read the answer and worked solution →The data type of a variable decides how much memory it uses and which operators can:Read the answer and worked solution →A system defined in terms of itself, as when a function calls itself, shows:Read the answer and worked solution →A variable whose value is the memory address of another variable is a:Read the answer and worked solution →The same C source code can be compiled and run on different machines. C is therefore:Read the answer and worked solution →A web client page is commonly built from HTML5, CSS and:Read the answer and worked solution →Catch the abstract modelsRead the answer and worked solution →Pop the paradigmsRead the answer and worked solution →Run the computing gatesRead the answer and worked solution →Slice the computing termsRead the answer and worked solution →Abstract or realRead the answer and worked solution →Sort the computing ideasRead the answer and worked solution →Type the numberRead the answer and worked solution →Computation bingoRead the answer and worked solution →

Worked practice questions

A system that defines what an algorithm does and how to run it is a:

  1. Computational model
  2. Computational mistake
  3. Computational measure
  4. Computational machine
Show answer and solution

Correct answer: A. Computational model

1. Algorithms need a setting in which to run. 2. That setting defines both meaning and execution. 3. It is a computational model. _Source: OpenStax Introduction to Computer Science, Chapter 4, Models of Computation._

Open this question →

The Random Access Machine, the Turing machine and the Lambda calculus are examples of:

  1. Arithmetic models
  2. Abstract models
  3. Assembly models
  4. Automatic models
Show answer and solution

Correct answer: B. Abstract models

1. These are not real pieces of hardware. 2. They exist to help people reason about algorithms. 3. So they are abstract models. _Source: OpenStax Introduction to Computer Science, Chapter 4, Models of Computation._

Open this question →

A model used mainly to analyse how efficient an algorithm is, is the:

  1. Random Access Machine
  2. Rapid Address Manager
  3. Remote Access Monitor
  4. Regular Assembly Method
Show answer and solution

Correct answer: A. Random Access Machine

1. Efficiency is measured by counting simple steps. 2. One abstract model is built for that purpose. 3. It is the Random Access Machine. _Source: OpenStax Introduction to Computer Science, Chapter 4, Models of Computation._

Open this question →

How to practise

  1. Choose a Models of Computation 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 ScienceOlympiad Computer ScienceBooleans and DecisionsData Structures and AlgorithmsInterview PrepProgramming LanguagesPython Strings Lists and Tuples