Computational Methods

Breaking down a problem into smaller component parts is known as?

• Abstraction

• Algorithmic Thinking

• Decomposition

• Data Mining

Advantages of decomposition are?

• Smaller parts are easier to understand and solve

• Multiple coders can work on a big problem in parallel

• It is easier to debug

• It allows programmers to remove irrelevant data

A hierarchical structure chart can be used to map decomposition?

• True

• False

Decomposition can take into account parallel processes?

• True

• False

What are the 3 basic programming constructs that make up structured programming are?

• Selection, Iteration, Decomposition

• Abstraction, Selection, Sequence

• Algorithm, Sequence, Iteration

• Iteration, Sequence, Selection

In OOP, an ‘object’ is a container of?

• Attributes and methods

• Methods and code

• Attributes and data

• Name and Methods

What is an algorithm?

Below is an example of which algorithm?

Search (list[0..N-1], value,low, high) {

if (high < low)

return error_message

mid = (low + high)/2

if (list[mid] > value)

return search (list, value, low, mid-l)

else if (list[mid] < value)

return search(list, value, mid+1, high)

else

return mid

}

• Binary Search

• Bubble Sort

• Linear Search

• Merge Sort

Algorithms must? (tick those that apply)

• be vague

• be correct

• have an end

• must work in any instance of the same problem

What is recursion?