AQA A Level: 4.4.1 Abstraction

AQA A Level: 4.4.1 Abstraction

12th Grade

10 Qs

quiz-placeholder

Similar activities

Сpp 1_3

Сpp 1_3

9th - 12th Grade

10 Qs

Los periféricos del computador

Los periféricos del computador

1st Grade - Professional Development

9 Qs

BTEC Level 3 Nat Ext Dip in Computing - Unit 2.1 Hardware and Software

BTEC Level 3 Nat Ext Dip in Computing - Unit 2.1 Hardware and Software

11th - 12th Grade

10 Qs

Bài 6_Lớp 11_Tại lớp

Bài 6_Lớp 11_Tại lớp

12th Grade

10 Qs

Internet seguro

Internet seguro

8th Grade - University

10 Qs

Parcial Electiva Profesional

Parcial Electiva Profesional

12th Grade

11 Qs

Program Efficiency 2

Program Efficiency 2

12th Grade

15 Qs

AQA A Level: 4.4.1 Abstraction

AQA A Level: 4.4.1 Abstraction

Assessment

Quiz

Computers

12th Grade

Practice Problem

Medium

Created by

Alex Hemming

Used 6+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the definition of: Algorithm

“Fake code. A language-independent, syntax-loose representation of computer code. Allows a programmer to lay out the logic and steps of a problem in a code like way without worrying about the specific syntax of any particular language.”

“The process of separating ideas from specific instances of those ideas at work. Computational structures are defined by their meanings while hiding away the details of how they work."

“A sequence of steps designed to perform a particular task. An algorithm may be constructed to describe the operation of a complete system or to describe a particular part of it.”

“The result of a procedural abstraction is a procedure, not a function. To get a function requires yet another abstraction, which disregards the particular computation method"

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the definition of: Pseudocode

“Fake code. A language-independent, syntax-loose representation of computer code. Allows a programmer to lay out the logic and steps of a problem in a code like way without worrying about the specific syntax of any particular language.”

“Provides mechanisms for abstracting well-defined procedures or operations as entities. The implementation of the procedure requires several steps to be performed."

“A sequence of steps designed to perform a particular task. An algorithm may be constructed to describe the operation of a complete system or to describe a particular part of it.”

“The reduction of a particular body of data to a simplified representation of the whole. For example, a stack could be implemented as an array and a pointer for the top of the stack.”

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the definition of: Test data

“Fake code. A language-independent, syntax-loose representation of computer code. Allows a programmer to lay out the logic and steps of a problem in a code like way without worrying about the specific syntax of any particular language.”

“Provides mechanisms for abstracting well-defined procedures or operations as entities. The implementation of the procedure requires several steps to be performed."

“A sequence of steps designed to perform a particular task. An algorithm may be constructed to describe the operation of a complete system or to describe a particular part of it.”

“Data which has been specifically identified for use in testing a computer program.”

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the definition of: Abstraction

“Fake code. A language-independent, syntax-loose representation of computer code. Allows a programmer to lay out the logic and steps of a problem in a code like way without worrying about the specific syntax of any particular language.”

“Provides mechanisms for abstracting well-defined procedures or operations as entities. The implementation of the procedure requires several steps to be performed."

“A sequence of steps designed to perform a particular task. An algorithm may be constructed to describe the operation of a complete system or to describe a particular part of it.”

“The process of separating ideas from specific instances of those ideas at work. Computational structures are defined by their meanings while hiding away the details of how they work."

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the definition of: Procedural abstraction

“Fake code. A language-independent, syntax-loose representation of computer code. Allows a programmer to lay out the logic and steps of a problem in a code like way without worrying about the specific syntax of any particular language.”

“Provides mechanisms for abstracting well-defined procedures or operations as entities. The implementation of the procedure requires several steps to be performed."

“A sequence of steps designed to perform a particular task. An algorithm may be constructed to describe the operation of a complete system or to describe a particular part of it.”

“The process of separating ideas from specific instances of those ideas at work. Computational structures are defined by their meanings while hiding away the details of how they work."

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the definition of: Functional abstraction

“Provides mechanisms for abstracting well-defined procedures or operations as entities. The implementation of the procedure requires several steps to be performed."

“A sequence of steps designed to perform a particular task. An algorithm may be constructed to describe the operation of a complete system or to describe a particular part of it.”

“The process of separating ideas from specific instances of those ideas at work. Computational structures are defined by their meanings while hiding away the details of how they work."

“The result of a procedural abstraction is a procedure, not a function. To get a function requires yet another abstraction, which disregards the particular computation method."

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the definition of: Data abstraction

“Provides mechanisms for abstracting well-defined procedures or operations as entities. The implementation of the procedure requires several steps to be performed."

“A sequence of steps designed to perform a particular task. An algorithm may be constructed to describe the operation of a complete system or to describe a particular part of it.”

“The reduction of a particular body of data to a simplified representation of the whole. For example, a stack could be implemented as an array and a pointer for the top of the stack.”

“The result of a procedural abstraction is a procedure, not a function. To get a function requires yet another abstraction, which disregards the particular computation method."

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?