AP Computer Science A Vocabulary Review

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/127

flashcard set

Earn XP

Description and Tags

Flashcards to assist in reviewing important vocabulary for AP Computer Science A.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

128 Terms

1
New cards

software engineer

A person who designs, develops, and tests software for home, school, and business use.

2
New cards

class header

Consists of the class keyword and the name of the class.

3
New cards

comment

A text note to explain or annotate the code that is ignored when the program is run.

4
New cards

source code

A collection of programming commands.

5
New cards

syntax

The rules for how a programmer must write code for a computer to understand.

6
New cards

syntax error

A mistake in the code that does not follow a programming language's syntax.

7
New cards

attribute

A characteristic of an object.

8
New cards

behavior

An action that an object can perform.

9
New cards

class

A programmer-defined blueprint from which objects are created.

10
New cards

object

An instance of a class.

11
New cards

object-oriented programming

An approach to creating and using models of physical or imagined objects.

12
New cards

constructor

A block of code that has the same name as the class and tells the computer how to create a new object.

13
New cards

instantiate

To call the constructor to create an object.

14
New cards

dot operator

Used to call a method in a class.

15
New cards

method

A named set of instructions to perform a task.

16
New cards

argument

The specific value provided when a method or constructor is called.

17
New cards

parameter

Defines the type of value to receive when a method or constructor is called.

18
New cards

string literal

A sequence of characters enclosed in quotation marks (" ").

19
New cards

algorithm

A finite set of instructions that accomplish a task.

20
New cards

condition

Determines whether or not to execute a block of code.

21
New cards

iteration statement

A control structure that repeatedly executes a block of code.

22
New cards

inheritance

An object-oriented programming principle where a subclass inherits the attributes and behaviors of a superclass.

23
New cards

subclass

A class that extends a superclass and inherits its attributes and behaviors.

24
New cards

superclass

A class that can be extended to create subclasses.

25
New cards

tester class

The class that contains the main method and from where the program starts running.

26
New cards

method signature

Consists of a name and parameter list.

27
New cards

return

To exit a method and go back to the point in the program that called it with the requested value or information.

28
New cards

return type

The value returned before a method completes its execution and exits.

29
New cards

void

Specifies that a method should not have a return value.

30
New cards

code review

The process of examining code and providing feedback to improve the quality and functionality of the program.

31
New cards

commit

An operation which saves the latest changes of the code and represents a snapshot of a project.

32
New cards

documentation

Written descriptions of the purpose and functionality of code.

33
New cards

programming style

A set of guidelines and best practices for formatting program code.

34
New cards

selection statement

A statement that only executes when a condition is true.

35
New cards

data type

The format of the data that can be stored in a variable.

36
New cards

declaration

Giving a name and data type to a variable.

37
New cards

variable

A container that stores a value in memory.

38
New cards

decomposition

The process of breaking a problem down into smaller parts to write methods for each part.

39
New cards

efficient

Getting the best outcome with the least amount of waste.

40
New cards

pseudocode

A plain language description of the steps in an algorithm.

41
New cards

redundant

Code that is unnecessary.

42
New cards

logical operator

An operator that returns a Boolean value.

43
New cards

two-way selection statement

Specifies a block of code to execute when the condition is true and a block of code to execute when the condition is false.

44
New cards

DRY principle

A software development principle that stands for "Don't Repeat Yourself," aiming to reduce repetition in code.

45
New cards

access modifier

A keyword used to set the visibility of classes, variables, constructors, and methods.

46
New cards

encapsulation

An object-oriented programming concept where the instance variables of a class are hidden from other classes and can be accessed only through the methods of the class.

47
New cards

instance variable

A variable defined in a class that represents an attribute of an object.

48
New cards

refactor

To improve the readability, reusability, or structure of program code without altering its functionality.

49
New cards

constructor signature

The first line of the constructor which includes the public keyword, the constructor name, and any parameters.

50
New cards

default value

A predefined value that is used by a program when the user does not provide a value.

51
New cards

no-argument constructor

A constructor with no parameters.

52
New cards

actual parameter

The value to assign to the formal parameter.

53
New cards

call by value

Copying the value of the actual parameter to the constructor's formal parameter.

54
New cards

formal parameter

The value to be passed to a constructor or method.

55
New cards

local variable

A variable declared and accessible within a specific block of code.

56
New cards

overloading

Defining two or more constructors or methods with the same name but different signatures.

57
New cards

parameterized constructor

A constructor that has a specific number of arguments to be passed to assign values to an object's instance variables.

58
New cards

state

The attributes of an object that are represented by its instance variables.

59
New cards

scope

Where a variable can be used.

60
New cards

assignment

Using the assignment operator (=) to initialize or change the value stored in a variable.

61
New cards

initialization

Giving a starting value to a variable using the assignment operator (=).

62
New cards

literal

A source code representation of a value, such as a number or text.

63
New cards

primitive type

A basic data type that Java predefines.

64
New cards

reference type

A data type that contains a pointer to the memory location of an object.

65
New cards

accessor method

Gives the value that is currently assigned to an instance variable.

66
New cards

application program interface (API)

A library of prewritten classes.

67
New cards

library

A collection of methods or reusable components of code.

68
New cards

return by value

A copy of the value is given to where the method is called.

69
New cards

compound assignment operator

Shortcut syntax to perform an operation on both operands and assign the result into the variable on the left.

70
New cards

compound expression

A combination of expressions.

71
New cards

concatenation

When two Strings are joined together.

72
New cards

expression

A combination of data and operators that evaluates to a single value.

73
New cards

operand

The data that is operated on.

74
New cards

truncate

To cut off data from the end.

75
New cards

Boolean expression

A logical statement that gives either a true or false value.

76
New cards

mutator method

Changes the value assigned to an instance variable.

77
New cards

relational operator

An operator used to compare values or expressions.

78
New cards

escape sequence

Starts with a \ to indicate how to display a String.

79
New cards

override

To define a method in a subclass with the same method signature as a method inherited from a superclass.

80
New cards

data structure

A structure for organizing, processing, retrieving, and storing data.

81
New cards

element

A single value or object in a data structure.

82
New cards

one-dimensional (1D) array

A data structure that holds multiple values of the same data type.

83
New cards

index

An integer value that indicates the position of a value in a data structure.

84
New cards

initializer list

A comma-separated list of values or objects given inside curly braces ( { } ).

85
New cards

traverse

To access elements in a data structure one by one.

86
New cards

decrement

To decrease a value by one.

87
New cards

increment

To increase a value by one.

88
New cards

loop control variable

A variable that is changed by a constant value and determines the end of a loop.

89
New cards

off-by-one error

An error that occurs when a loop repeats one time too many or one time too few.

90
New cards

postcondition

A condition that must always be true just after the execution of a code segment.

91
New cards

precondition

A condition that must always be true just before the execution of a code segment.

92
New cards

text file

A file that contains letters, numbers, and/or symbols but has no special formatting.

93
New cards

polymorphism

Where the same object or method has more than one form.

94
New cards

column

A vertical (up and down) series of data in a two-dimensional (2D) array.

95
New cards

inner array

An array that is nested inside another array.

96
New cards

outer array

The outermost array of a two-dimensional array.

97
New cards

row

A horizontal (left to right) series of data in a two-dimensional (2D) array.

98
New cards

two-dimensional (2D) array

An array of arrays often represented as a table with rows and columns.

99
New cards

row-major order

Traversing a 2D array by accessing each row from top to bottom.

100
New cards

column-major order

Traversing a 2D array by accessing each column from left to right.