OCR Computer Science A
Level - 2.2.2 Computational
methods With complete
verified solutions already
graded A+
Computational Methods - answer Describes any method which does something
related to computation, such as sorting, merging, searching, indexing etc.
Problem Recognition - answer The acknowledgement and definition of an issue that
does or may arise during the performance of a process.
Problem Decomposition - answer The process by which a complex problem or
system is broken down into parts that are easier to conceive, understand, program
and maintain.
Divide and Conquer - answer 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.
Backtracking - answer 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.
Data Mining - answer 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.
Level - 2.2.2 Computational
methods With complete
verified solutions already
graded A+
Computational Methods - answer Describes any method which does something
related to computation, such as sorting, merging, searching, indexing etc.
Problem Recognition - answer The acknowledgement and definition of an issue that
does or may arise during the performance of a process.
Problem Decomposition - answer The process by which a complex problem or
system is broken down into parts that are easier to conceive, understand, program
and maintain.
Divide and Conquer - answer 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.
Backtracking - answer 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.
Data Mining - answer 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.
