Search and Sorting Algorithms

A search that involves comparing each item in turn with the required item is called a:

• binary search

• descending search

• quadratic search

• linear search

A sorted list is one of the requirements of a

• binary search

• descending search

• quadratic search

• linear search

Finding the maximum data item in a list is relevant for

• numeric data

• string or text data

• a sorted list

• both A and B

A search of a data list containing 20,000 items takes on average 10,000

comparisons to find a particular item.

The type of search being used is probably a:

• binary search

• linear search

• maximum search

• minimum search

Functions and procedures are used to

implement algorithms.

Which of the following statements is true?

• Procedures always return one

  value; functions can return any

  number of values

• Functions always return one value;

  procedures can return any number

  of values.

• Functions are only able to process

  numeric data

• All functions must include at least

  one input parameter

The largest value in an array of 10,000

items is found to be in position 234.

Which of the following is True?

• The list must be sorted

• Larger items may exist in positions

  235 to 10,000

• The list must be unsorted

• The list only contains numeric data

Any particular item is always found in a

list of 1000 items within 10

comparisons. What can be said about the

1000 items?

• There must be only 10 unique

  items in the list

• The list of items must be sorted

• Most of the list must be empty.

• There is insufficient information to

  answer this question

An algorithm description language:

• is a type of programming language

• provides a method of expressing

  algorithms.

• is either a flowchart or pseudocode.

• provides excellent user

  documentation

A library of routines is:

• a common way of storing the topdown

  design of a program.

• of use to end users who wish to

  modify the original product

• used to store standard modules of

  source code for reuse

• used to store standard algorithms

  for reuse

The process of progressively breaking a

problem down into its component parts

is known as:

• algorithm development

• top-down design

• system modelling

• stepwise refinement