2.2.2 Computational methods

Question 1

Computational Methods

Answer 1

“Describes any method which does something related to computation, such as sorting, merging, searching, indexing etc.”

Question 2

Problem Recognition

Answer 2

“The acknowledgement and definition of an issue that does or may arise during the performance of a process.”

Question 3

Problem Decomposition

Answer 3

“The process by which a complex problem or system is broken down into parts that are easier to conceive, understand, program and maintain.”

Question 4

Divide and Conquer

Answer 4

“Another term for decomposition which is the process by which a complex problem or system are broken down into parts that are easier to conceive, understand, program and maintain.”

Question 5

Backtracking

Answer 5

“An algorithm for finding a complete solution. This is a refined brute force methodology. It is a very general algorithm for finding all (or some) solutions to computational problems. It incrementally builds to the solution, and abandons each partial success (“backtracks”) as soon as it determines that the partial solution cannot possible be completed to a valid solution.”

Question 6

Data Mining

Answer 6

“The analysis of a large amount of data in a data warehouse to provide new information. For example, by using loyalty cards, which connect purchases to a particular customer, supermarkets can gathering information about the buying habits of individual customers.”

Question 7

Heuristics

Answer 7

“Rules that are not derived purely from logic but are derived from the experience (of a person). These are also known as ‘rules of thumb’.”

Question 8

Performance Modelling

Answer 8

“This is the process of carrying out mathematical approximations of how well models perform. e.g. How efficient they are.”

Question 9

Visualisation

Answer 9

“The process of turning data in a visual representation which is easier for humans to understand, interrupt and work with.”