AS9 Flashcards

1
Q

Flow Charts

A
  • Use different shapes to describe different programming structures, with arrows indicating the order of execution.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Algorithm

A
  • A series of steps that can be followed to solve a specific problem.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Variables

A
  • Named spaces in memory.
  • Contain a single piece of data.
  • The data type determines what data the variable can contain.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Constant

A
  • Will always contain the same value during execution.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Identifiers

A
  • A name given to any part of a program that can be named.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Global Variable

A
  • A variable that exists throughout the program execution.
  • Can be written or read from any subroutine.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Local Variable

A
  • Only exists until the subroutine it was created in ends.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Parameter Passing

A
  • Items of data that are passed from one subroutine to another.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Passing by Value

A
  • A copy of the value is passed.
  • The value is changed by the receiving subroutine, but remains the same in the original subroutine.
  • In Python, immutable types are passed by value.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Passing by Reference

A
  • The actual variable is passed.
  • Any changes to the variable will be read and used by both subroutines.
  • In Python, mutable types are passed by reference.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Sorting/Searching

A

SORTING:
- Placing data items into a specified order.
SEARCHING:
- Identifying whether a specified data item exists in a data structure and where it is located.

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

Insertion Sort

A
  • Takes each element in the data set and inserts it into the correct place within the already sorted values.
  • Used for smaller data sets.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Bubble Sort

A
  • Comparing two adjacent values in the data set and swapping if necessary.
  • Used for smaller data sets.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Linear Search

A
  • Starts at one end and works its way to the other.
  • Each element is examined.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Binary Search

A
  • Will only work on sorted data.
  • Begins in the middle, checks if the number is larger or smaller, discards appropriate side, reset.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Sequence

A
  • Lines executed one after another.
17
Q

Selection

A
  • IF, SELECT, CASE and SWITCH.
  • One path will be selected.
18
Q

Repetition

A
  • WHILE, DO, LOOP and UNTIL.
  • Code is executed more than once.
19
Q

Count

A
  • Integer variables keep track of how many time a piece of code is repeated.
20
Q

Rogue Value

A
  • An invalid value to indicate a special case.
  • Often used to exit loop or end program.
21
Q

Compression

A
  • Means making a file occupy less space on a disk, which is beneficial for storage requirements and transmission speed.
22
Q

Testing

A
  • Selecting test data is essential to verifying a program is bug-free.
  • Typical, boundary/extreme, invalid, erroneous.