Y9CY1 - L6 - Midpoint Assessment

What is abstraction?

• Simplifying a problem by removing unnecessary detail

• Simplifying a problem by providing additional detail

• Simplifying a problem by removing important details

• Simplifying a problem by breaking it down into smaller problems

• Simplifying a problem by breaking it down into smaller problems and then removing some of these

Which of the following are examples of abstraction?

• The London Underground Map

• A photograph of a tree

• Key pieces of information about a person in a database

• A railway engine

What is decomposition?

• Breaking a large problem down into smaller problems to each be solved separately

• Removing unnecessary detail from large problems so they are easy to solve

• Taking many small problems and turning them into one larger problem

• Solving one small problem at a time

What is an algorithm?

• The steps taken to solve a problem

• Where a computer is used to compose a piece of music

• The code of a computer program

• A type of programming construct

What searching algorithm begins by comparing the middle item of a data set with what is being searched for?

• Binary Search

• Linear Search

• Bubble Search

• Insertion Search

• Merge Search

What searching algorithm works by comparing each item of a data set, one after another, against the value being searched for?

• Binary Search

• Linear Search

• Bubble Search

• Insertion Search

• Merge Search

A binary search algorithm is looking for a 9 and the middle item looked at is a 5. Along with the 5, what side of the data set is discarded?

• Left Side

• Right Side

What is the only search algorithm that can be used on an unordered set of data?

• Linear Search

• Binary Search

What must be done to a data set before we can use a binary search on it?

• It needs to be sorted

• It needs to be unsorted

• It needs to be made odd; so there is a middle item

• It needs to be made even; so there is a middle item to the right of the middle

Which is the most efficient sorting algorithm for a large, ordered set of data?

• Binary Search

• Linear Search