idk Flashcards

1
Q

Decomposition

A

process of
breaking a complex problem into
smaller component parts

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Abstraction

A

process of removing
unnecessary detail and simplifying.
Generally, abstraction precedes
decomposition

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

subroutines

A

sequence of instructions that perform a
specific task.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Sequence

A

an action, or event, leads to the
next ordered action in a predetermined
order

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Selection

A

In selection, a question is asked,
and depending on the answer, the program
takes one of two courses of action

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Iteration

A

An iteration is a single pass
through a set of instructions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Counts

A

count the number of times a
process has occurred.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Rogue values

A

values that fall outside
the range or type of the ‘normal’ data that
will be processed by a program

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

local variables

A

only exist
for the lifetime of a subroutine and that the
data in those variables is only available to
the subroutine in which it is declared.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

global variables

A

exist
throughout an entire program and that the
data in those variables is available to all
routines within the entire program.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

selfdocumenting identifiers

A

named sensibly so that
a third party can understand their purpose

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Merge sort

A

An unsorted list is divided into n sublists,
each containing 1 element.
The sublists are repeatedly merged to
produce new sorted sublists until there is
only 1 sorted sublist remaining

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Bubble sort

A

The algorithm that repeatedly steps
through the list to be sorted.
The algorithm compares each pair of
adjacent items and swaps them if they are
in the wrong order.
The passes through the list are repeated
until no swaps are needed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

linear searches

A

simple search process where a list
is searched until the required value is
found.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

e binary search

A

The middle value in a list is inspected to
see if it matches the search value.
If the middle value is greater than the
search value, the upper half of the list is
discarded. If it is less than the search
value, the lower half is discarded.
This process is repeated, with the list
halving in size each time until the search
value is found

How well did you know this?
1
Not at all
2
3
4
5
Perfectly