Cs1316-Java

Front 1

abstract (super) class

Back 1

A class that cannot be instantiated, but can be extended (subclassed). Can be used to define methods and behaviors that subclasses use.

Front 2

abstract data type

Back 2

A data type that has a description of how it works, but not how it is implemented. Abstract data types such as Stacks and Queues can be implemented in multiple different ways.

Front 3

anonymous inner class

Back 3

A class that has no name which can be quickly created and used to perform small jobs. An example is using an anonymous inner class to be the ActionListener for GUI components.

Front 4

Array

Back 4

A homogeneous linear collection of objects which are stored together in memory.

Front 5

binary search tree

Back 5

A Binary tree that is sorted so that items within it can be found quickly. Elements that are greater than a node are to the right of the node; elements that are smaller are to the left.

Front 6

Block

Back 6

A section of code, typically enclosed with curly brackets {} that makes up the body of a loop, function, or conditional.

Front 7

Boolean

Back 7

A data type that has only two possible values

Front 8

Boolean Expression

Back 8

A logical statement that evaluates to either True or False

Front 9

Cast/Casting

Back 9

The process of forcing Java to convert data from one data type to another

Front 10

Child node

Back 10

In a class hierarchy, they indicate that the class represented by the parent node is a superclass of the class represented by the child node

Front 11

circular linked list

Back 11

A linked list where the end points to the head. Can be used to store cyclical animations such as walking motion.

Front 12

class

Back 12

The blueprint or “framework” from which objects are instantiated. Classes define variables (fields) and behaviors (methods) that every object will have, and sometimes also define static fields/methods that are stored in the class (shared by all objects).

Front 13

Class hierarchy

Back 13

representing the inheritance relationship among classes

Front 14

Constructor

Back 14

A method that is called when a new instance is created

Front 15

Continuous simulation

Back 15

all agents acting simultaneously

Front 16

Data Encapsulation

Back 16

The process of hiding internal state from direct access by outsiders, and instead requiring that all accesses to the internal state be done through methods that can act as gatekeepers

Front 17

Definition vs implementation

Back 17

By separating the definition of the data structure from the implementation, we can use the new data structure in programs without regard for Implementation. No matter how something is implemented, it should work as long as the definition is correct

Front 18

Discrete simulation

Back 18

stop and pause before calling the next

Front 19

double

Back 19

A data type that holds numbers with fractional components

Front 20

dynamic data structure

Back 20

A data structure that can grow and change. Examples include linked lists and trees.

Front 21

field

Back 21

These contain state within an object, sometimes called object variables

Front 22

FIFO

Back 22

first in first out. A queue is an example of this

Front 23

final

Back 23

A keyword that means that a field will not change

Front 24

final static variable

Back 24

A constant variable that can't be changed

Front 25

Generalization-specialization relation

Back 25

we are saying that one class is a “kind of” another class

Front 26

graph (directed, undirected, acyclic)

Back 26

A data structure made up of nodes and connections between nodes (lines). Connections can be unidirectional or bidirectional and can sometimes have associated weights.

Front 27

inheritance

Back 27

The process of extending a superclass, gaining its behaviors and state The process of inheriting behavior (methods) and data (fields/variables) from a superclass to a child or subclass. Inheritance is the main way that code reuse is achieved in OOP.

Front 28

inorder traversal (of a tree)

Back 28

Visiting all elements of a tree recursively: At each node, visit the left subtree, then visit the node itself, then visit the right subtree.

Front 29

int

Back 29

A data type that holds numbers without a fractional component

Front 30

interface

Back 30

A list of method names (and signatures) that a class must implement to be said to “implement” the interface. Multiple interfaces can be implemented by the same class

Front 31

iterate

Back 31

To (potentially) repeat the execution a block of code multiple times, as with a for or while loop.

Front 32

layout manager

Back 32

In charge of controlling how GUI elements (widgets) are displayed/arranged/laid out in a panel. Examples include Border, Flow, and Box layout

Front 33

leaf node

Back 33

A node in a tree that has no children. (Located at the edges of the tree, hence the “leaf” name.)

Front 34

LIFO

Back 34

An acronym that stands for Last In First Out. A Stack is LIFO

Front 35

linked list

Back 35

A data structure made up of a collection of nodes, where each node points to the next node in line.

Front 36

linked list of lists

Back 36

All nodes will have a next, and branches will also have a children link

Front 37

method

Back 37

a function that is associated with an object and implements behavior

Front 38

method signature

Back 38

The unique collection of method name and parameter number and type that define a method. Multiple methods may share the same name as long as the type or number of their parameters differ

Front 39

model

Back 39

A detailed description of structure and behavior.

Front 40

object

Back 40

An object is a collection of fields (variables) and behaviors (methods) that can be “instantiated” based upon a “blueprint” or “plan” from a class. The instantiation of a class, they have fields that store state and methods (functions) that encode behavior.

Front 41

object oriented programming

Back 41

you care about who (or what) does the process, and how the overall process emerges from the interaction of different objects

Front 42

overriding

Back 42

We override methods in order to define new, differentiated behavior... when a method in a subclass has the same name and type signature as a method in its superclass, then the method in the subclass is said to override the method in the superclass. When an overridden method is called from within a subclass, it will always refer to the version of that method defined by the subclass

Front 43

parent node

Back 43

There is a root at the top of the tree that everything is connected to. Each node has at most one parent node

Front 44

private

Back 44

A keyword that indicates that a field or method can only be accessed by the current class/object.

Front 45

public

Back 45

A keyword that means that anybody can see and manipulate a particular field or method.

Front 46

queue

Back 46

abstract data type-FIFO

Front 47

resursion

Back 47

– When a method that calls itself. (Should have a terminating condition and work towards that terminating condition to be “good” recursion.)

Front 48

refactor(ing) code

Back 48

moving replicated code up in the class hierarchy, and making sure that everything still works afterward.

Front 49

reference

Back 49

a pointer to a specific object

Front 50

resursive traversal of a tree

Back 50

traversing through a tree using recursion

Front 51

root node

Back 51

top most node in a tree

Front 52

Sample sound

Back 52

sounds made up of samples (thousands per second)

Front 53

scene graph

Back 53

A graph used to organize and lay out elements in a 2D or 3D animation. By manipulating a node in the scene graph, you can affect all of its child nodes at the same time

Front 54

simulation

Back 54

execution of a model

Front 55

spanning tree

Back 55

a graph without cycles

Front 56

stack

Back 56

abstract data type- LIFO

Front 57

static

Back 57

A keyword that means a field or method belongs to the class, and not specific objects that are instantiated from it.

Front 58

static field (variable)

Back 58

A variable owned by the “class” instead of any particular (object) instance of the class. All instances of an object share one static class variable, although a static field can be accessed without creating even one instance of the class.

Front 59

static method

Back 59

A method owned by the class. See static field definition. Cannot access object variables.

Front 60

string

Back 60

a data type that holds sequences of characters

Front 61

subclass

Back 61

A class that inherits behaviors and state (methods and fields) from a superclass

Front 62

superclass

Back 62

The class that the current class inherited from (extended). Sometimes called the “Parent” class. A class that is extended by subclasses

Front 63

this

Back 63

A special keyword that always contains a reference to the object that “holds” the currently active code.

Front 64

traverse

Back 64

To move through a linear data structure (or a sequence) doing something to or with each individual element

Front 65

type declaration

Back 65

process of telling the compiler what type of data a variable will hold

Front 66

user interface events

Back 66

Event that is dispatched when the user does something to a GUI, like clicking a button, or moving the mouse.

Front 67

void

Back 67

A keyword that indicates that a method will not return anything