Pseudocode Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

Description of NOT gate

A

triangle with circle in front

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

WHERE in SQL

A

query/condition of data to be displayed

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

COUNT in SQL (2)

A

counts number of records where field matches condition

used with SELECT

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

RANDOM() Library routine

A

returns a random number between 0 and 1

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

SUM in SQL (2)

A

sum of all values in field

used with SELECT

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

Components of decomposition in analysis stage (4)

A

input - what is put into system

processes - action taken to achieve result

output - what is taken out of system

storage - what needs to be kept in for future use

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

NAND gate rule

A

if both input = 1, then output = 0

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

Case Statement Structure (4)

A

CASE OF “Name”

1:
2:

OTHERWISE OUTPUT

ENDCASE

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

ROUND library routine (2)

A

returns value rounded to specified number of decimal places

rounded to highest or lowest value

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

Validation check meaning (2)

A

checks that data input is reasonable + meets certain criteria

automated check carried out by computer

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

Bubble Sort (8)

A

Swap <– False

REPEAT
if variable 1 > variable 2
then var <– variable 1
variable 1 <– variable 2
variable 2 <– var
Swap <– True
UNTIL Swap = True

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

Range check

A

checks that data is within certain range

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

Coding of Program Development Life Cycle (2)

A

uses design from previous stage

written using IDE

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

Function structure with parameters (3)

A

FUNCTION Name (variable : type) RETURNS type

RETURN (“action”)

ENDFUNCTION

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

OR gate rule

A

output = 1 if either input = 1

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

ORDER BY in SQL

A

sorts results numerically or alphabetically

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

Extreme Data

A

largest and smallest data that algorithm should allow

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

Procedure with parameters structure (6)

A

PROCEDURE Stars (Number : INTEGER)

DECLARE Counter : INTEGER

FOR Counter –> 1 to Number
OUTPUT “*”

NEXT Counter

ENDPROCEDURE

CALL Stars(7) //outputs 7 *

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

Design of Program Development Life Cycle (3)

A

visually representing program before coding

will help to explain how code works

e.g flowchart

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

MOD

A

remainder of division

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

Type check

A

checks that data entered is correct type (e.g integer, string)

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

Substrings code (2)

A

SUBSTRING(STRING, position of start character, length of substring)

string starts at position 1

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

Description of AND gate

A

curved rectangle

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

Description of NOR gate

A

arrowhead with circle in front

25
Q

Analysis of Program Development Life Cycle (4)

A

understand what program will do

abstraction - obtain required input/output information

decomposition - breaking the program down into steps

indentifying requirements - conditions to be carried out to get final outcome

26
Q

Define format check

A

checks that input provided has valid formatting (e.g margins, font)

27
Q

File Handling Structure using WRITE (3)

A

OPENFILE “file name” FOR WRITE
WRITEFILE “filename”, variable
CLOSEFILE “filename”

28
Q

FROM in SQL

A

indentifies table to use

29
Q

Length check

A

checks that number of characters is correct

30
Q

Testing of Program Development Life Cycle

A

ensuring that program works as it should

31
Q

Verification check meaning

A

checks that data is not changed as it is entered from one source to another

32
Q

DIV library routine (2)

A

performs integer division

answer is whole number

33
Q

Boundary data

A

data at the limit and data one value beyond (error)

34
Q

Examples of Design in program development cycle (3)

A

flowchart

pseudocode

structure diagram

35
Q

Declaring a 2D array

A

DECLARE Name : Array[number:number] of integer

36
Q

Order of the Program Development Life Cycle (4)

A

Analysis

Design

Coding

Testing

37
Q

File Handling Structure using READ (3)

A

OPENFILE “file name” FOR READ
READFILE “filename”, variable
CLOSEFILE “file name”

38
Q

XOR gate rule

A

output = 1 if input A is 1 AND input B is 0 OR input A is 0 AND input B is 1

39
Q

AND gate rule

A

output = 1 if both inputs = 1

40
Q

2 types of verification check (2)

A

double-entry check - data is entered twice to check that no changes are made

visual check - user looks through data entered + confirms no changes have been made

41
Q

MOD library routine

A

returns remainder of division

42
Q

Record in grid

A

horizontal rows

43
Q

Description of NAND gate

A

curved rectangle with circle in front

44
Q

Validation checks (6)

A

Length check

Range check

type check

check digit

Prescence check

format check

45
Q

Define abstraction (3)

A

simplifying the problem

selecting elements required

removing irrelevent data from elements

46
Q

Define prescence check

A

checks if user has entered data

47
Q

NOR gate rule

A

output = 1 if neither inputA OR B = 1

48
Q

NOT gate rule

A

output = 1 if input = 0

49
Q

Field in grid

A

vertical collumns

50
Q

How program can be written to make it presentable + maintained (4)

A

use comments to explain purpose of code

use meaningful identifier names - clearly identify purpose

use procedures + functions - shortens code

indentation + space - more readable

51
Q

Description of OR gate

A

arrowhead

52
Q

SELECT in SQL

A

fetches specified fields from table

53
Q

Normal Data

A

data within the algorithm range

54
Q

SQL structure (4)

A

SELECT
FROM
WHERE
ORDER BY field ASC or DSC;

55
Q

Procedure without parameters structure (4)

A

PROCEDURE Name
OUTPUT “action”
ENDPROCEDURE
CALL Name

56
Q

Description of XOR gate

A

arrowhead with line behind

57
Q

Abnormal/Erroneous Data

A

data rejected by algorithm

58
Q

Linear Search (9)

A

Found <– False

REPEAT
IF Name = Student[Count]
THEN
Found <– True
ELSE
Count <– Count + 1
UNTIL Found = True OR Count > ClassSize