# Chapter 7 Algorithms, Psuedocode, etc Flashcards

1
Q

Stages of the program development life cycle

A

Analysis
Design
Coding
Testing

2
Q

What is Analysis (PDLC)

A

Analysis is a process of investigation, which leads to finding out the purpose and specifications of the program

3
Q

What is Design (PDLC)

A

Shows how the program should be developed using the program specifications from analysis

4
Q

What is Coding (PDLC)

A

Writing the program(s) itself and iterative testing

5
Q

What is Testing (PDLC)

A

testing program code with the use of test data

6
Q

What is abstraction - analysis

A

Key elements for a solution are kept and unnecessary info is discarded.

7
Q

What is decomposition - analysis

A

A complex problem is broken down into smaller parts that can be solved easily.

8
Q

Methods used for design

A

Structure diagram
Flowcharts
Pseudocode

9
Q

What is a top-down design

aka

A

Constant breaking down of a computer system into a set of smaller sub-systems until each sub-system only performs 1 operation.

aka stepwise refinement

10
Q

Components of a computer system (decomposition)

A

Inputs
Processes
Outputs
Storage

11
Q

What is input - decomposition

A

Data used by the system that needs to be entered while the system is active

12
Q

What is processes- decomposition

A

Tasks that need to be performed by a program using the input data and prev. stored data.

13
Q

What is output - decomposition

A

Information that needs to be displayed or printed for the users.

14
Q

What is storage - decomposition

A

Data that needs to be stored in files on an appropriate media for use in the future.

15
Q

What is linear search

A

An algorithm that inspects each item in a list in turn to see if the item matches the value searched for

16
Q

What is bubble sort

A

Makes multiple passes through a list comparing each element with the next element and swapping them, until no more passes/swaps can occur.

17
Q

What is validation

A

Automated checks carried out to ensure that data is reasonable before it is accepted.

18
Q

Types of validation

A

Range checks
Length checks
Type checks
Presence checks
Format checks
check digits

19
Q

Range checks

A

Checks that the value of a number is between an upper and lower bound.

20
Q

explain Length checks

syntax om
pseudocode
python

A

Ensures that the data entered is a specific number of characters long.

pseudo: LENGTH()
py: len()

21
Q

Type checks

A

Checks that the data entered is of a specific type

22
Q

Presence checks

A

Checks if data has been entered

23
Q

Format checks

A

Checks if the characters entered follow the pre-defined pattern

24
Q

Check digits

A

An additional digit that is added to the number to make sure the entered number is error-free.

25
Q

What is verification

A

Makes sure that has been accurately copied/transferred from another sources and input into a computer

26
Q

What is double entry

A

Makes users enter data twice

27
Q

What is screen/visual check

A

Manual check that is completed by the user that enters the data.

28
Q

What is a trace table

A

Used to record results from each step in an algorithm

29
Q

What is normal data

A

Data that is accepted by a program

30
Q

What is abnormal data

A

Data rejected by a program

31
Q

What is extreme data

A

smallest/largest data value that is accepted by a program

32
Q

What is boundary data

A

smallest/largest data value accepted by a program along with smallest/largest data value rejected by a program

33
Q

What is pseudocode

A

Simple method of showing an algorithm. Describes what the algorithm does by using English key words that are similar to those used in high-level programming language without the strict syntax rules.

34
Q

what is an algorithm

A

Ordered set of steps to solve a problem

35
Q

what is a flowchart

A

a diagram that shows the steps required for a task and the order in which steps are performed.

36
Q

What is a structure diagram

A

Shows the design of a CS in a hierarchical way, which each level giving a detailed breakdown of the system into sub systems.

37
Q

What is iterative testing

A

modular tests are conducted, code amended, and tests repeated until the module performs as required.

38
Q

How is top-down design used for large computer systems

what does this do

A

t several programmers can work independently to develop and test different sub-systems for the same system at the same time.

This reduces the development
and testing time.

39
Q

What are the begin/end symbols called in flowcharts
shape

A

terminator flowchart symbols

elliptical

40
Q

What is the process symbol called in flowcahrts

shape

A

Process flowchart symbols

rectangle

41
Q

Shape of input/output

A

Parallelogram

42
Q

Shape of decision in pseudocode

A

diamond

always 2 flow lines - one YES one NO

a question mark
eg
x > b ?

43
Q

What does a flow line show

A

direction of flow

44
Q

What to use for linear search in psuedocode

A

repeat until loop

found variable - boolean
counter - integer

45
Q

What is a computer system made out of

A