u1

Question 1

computational problem

Answer 1

a problem that is expressed sufficiently precisely that it is possible to attempt to build an algorithm to solve it

Question 2

algorithm

Answer 2

a solution to a problemthat consists of a precisely stated, step-by-step list of instructions.

Question 3

computable

Answer 3

if it is possible to build an algorithm that solves in a finite number of steps every instance of the problem that might arise

Question 4

decidable

Answer 4

decision problem that is computable

Question 5

effective procedure

Answer 5

If a decision problem is decidable then an algorithm exists which solves every instance of that problem: such an algorithm is called an effective procedure

Question 6

abstraction

Answer 6

a simplification, with irrelevant details removed.

Question 7

abstraction as modelling,

Answer 7

Model->ignores detail of->part of reality

Reality->modelled by-> model

Question 8

abstraction as encapsulation

Answer 8

Implementation-> hides detail from->Interface
Interface->Depends on-> implementation.
the interface is the layer users interact with
the implementation is the layer that implements the model

Question 9

abstract data type

Answer 9

a logical description of the data used to solve a problem. An ADT is a description of a data structure purely in terms of the operations that can be carried out on it.AnADT provides an encapsulation of the data;the datais hidden inside the ADTcan only be accessed through the operations it offers —its interface

Question 10

data structure

Answer 10

When an ADT is implemented