1.1 algorithms Flashcards

1
Q

define unambiguous

A

this means that the instruction cannot be misunderstood.

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

define sequence

A

an ordered set of instructions

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

define algorithm

A

a precise method for solving a problem

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

define high level programming language

A

a programming language that resembles natural human language

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

define flowchart

A

a graphical representation of an algorithm

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

define pseudo- code

A

a structured code like language that can be used to describe an algorithm

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

define variable

A

a ‘container’ used to store data. that data stored in a variable in called as a value.

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

define identifier

A

a unique name given to a variable or a constant

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

define arithmetic operator

A

an operator that performs calculation on 2 numbers

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

define constant

A

a ‘container’ that holds a value that never changes

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

define construct

A

a component from which something is built

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

define selection

A

a construct that allows a choice to be made between different alternatives

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

define iteration

A

a construct that means the repetition of a process

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

the IF…THEN…ELSE statement

A

the IF…THEN…ELSE statement allows a choice to be made between 2 alternatives based whether or not a conditionis met

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

define relational operator

A

an operator that compares 2 values

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

the Nested IF statement

A

a nested IF statement consists of one or more if statements placed inside each other.

17
Q

define indefinite iteration

A

this is used when the number of iterations is not known before the loop is started.

18
Q

define iteration

A

this is used when the number of iterations or turns of the loop, is known in advance.

19
Q

define logical operator

A

a Boolean operator using “and” “or” and “not”

20
Q

define random number

A

a number given in a range of numberws that is generated in such a way that each one has a equal chance of appearing

21
Q

define nested loop

A

a loop that runs inside another loop

22
Q

define concatenation

A

the linking together of two or more items of information

23
Q

define logic error

A

an error in an algorithm that results in incorrect behavior

24
Q

define trace table

A

a technique used to identify any logic errors in algorithms

25
Q

define simulation

A

a program used test someone in computer before doing it in real life

26
Q

define infinite loop

A

a loop that is never ending

27
Q

define array

A

an organized collection of related values that share a single identifier

28
Q

define ascending order

A

the smallest to biggest

29
Q

define descending order

A

the biggest to the smallest

30
Q

define traversal

A

travel across or through something

31
Q

define recursion

A

a process that is repeated

32
Q

define brute force

A

an algorithm design that does not include any techniques to improve performance

33
Q

define divide and conquer

A

an algorithm design that works by dividing a problem

34
Q

define median

A

the middle number when the numbers are put in ascending or descending order

35
Q

define computional thinking

A

the thought process involved in formulating problems and their solutions

36
Q

define decomposition

A

breaking a problem down into a smaller more managable parts

37
Q

define abstraction

A

the process of removing or hiding unnececssary detail so that only the important points remain

38
Q

define subprogram

A

a self contained module of code that performs a specific task