AP CSA exam full vocab review Flashcards

(36 cards)

1
Q

softwhere fevelopement

A

writing a program

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

object oriented programming (oop)

A

uses interacting objects

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

program specification

A

description of a task

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

program design

A

a written plan, an overview of the solution

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

program implementation

A

the code

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

test data

A

input to test the programb

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

program maintenance

A

keeping the program working and up to date

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

top-down development

A

implement main classes first. sub classes later

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

independent class

A

doesn’t use other classes of the program in its code

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

bottom up development

A

implements lowest level, independent classes first

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

driver class

A

used to test other classes; contains main method

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

inheritance relationship

A

is-a relationship between classes

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

composition relationship

A

has-a relationship between classes

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

inheritance hierarchy

A

inheritance relationship shown in tree-like diagram

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

UML diagram

A

tree-like representation of relationship between classes

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

data structure

A

java construct for storing a data field (eg array)

17
Q

dara encapsulation

A

hiding data fields and methods in a class

18
Q

stepwise refinement

A

breaking methods into smaller methods

19
Q

procedural abstraction

A

using separate methods to encapsulate each task

20
Q

algorithm

A

step-by-step process that solves a problem

21
Q

stub method

A

dummy method called by another method being tested

22
Q

debugging

A

fixing errors

23
Q

robust program

A

screens out bad input

24
Q

compile-time error

A

usually a syntax error; prevents program from compiling

25
syntax error
bad language usage (eg missing { )
26
run time error
occurs during execution (after code is complied) (eg int division by zero, index out of bounds)
27
exception
run time error thrown by java method
28
logic error
program runs and complies but does not do what you want it to
29
assertion
a precise statement about a program given at any point.
30
pre condition
a statement of what is true immediately before execution of that code
31
post condition
a statement of what is true immediately after execution of that code
32
CPU time
the number of machine operations required to carry out the algorithm (arithimic operations, comparisons, data movement, etc)
33
memory
the number and complexity of the variables used
34
matrix
a 2-D array
35
when should you use row-column traversal
for accesing elements, modifying elements that are class objects, or replacing elements
36
when should you use enhanced for loop traversal for a 2d array
for accessing elements or modifying elements that are clsss objects but, no replacements