A Level Computer Science - Paper 2 (All Key Terms)

What is the process of simplifying a problem by only taking into consideration the necessary details required to obtain a solution called?

• Data Abstraction

• Graph Theory

• Caching

• Abstraction

Which term refers to the storage and representation of data in a computer system along with its logical description and interaction with operators?

• Abstraction

• Data Abstraction

• Graph Theory

• Caching

What is the branch of mathematics that can be used to abstractly represent problems using a collection of nodes connected by edges?

• Data Abstraction

• Graph Theory

• Caching

• Abstraction

What is the temporary storage of data by the system in cache or memory for the benefit of faster retrieval if it is needed again in future called?

• Abstraction

• Data Abstraction

• Caching

• Graph Theory

What term is used for any information relevant to a problem that is required for processing according to an algorithm?

What is the result returned by a system for a given input after running the entire or part of a process called?

• Inputs

• Preconditions

• Outputs

• Caching

What is a prerequisite or state of a system and its surroundings required to run a use case to return a valid solution called?

• Inputs

• Outputs

• Preconditions

• Reusable Program Components

What are components that have already been written, debugged, and tested that can be transplanted into new systems to save development time in project completion called?

• Preconditions

• Outputs

• Inputs

• Reusable Program Components

What is Procedural Abstraction?

• Achieving a task by relying on a procedure of sequential steps.

• Breaking down a problem into smaller, simpler tasks.

• A diagrammatic representation of the flow of a program.

• A programming control structure for selecting alternative paths.

What are Components of a Problem?

• Achieving a task by relying on a procedure of sequential steps.

• Breaking down a problem into smaller, simpler tasks.

• A diagrammatic representation of the flow of a program.

• A programming control structure for selecting alternative paths.