Cs Exam 2

Front 1

Abstraction

Back 1

the concept of hiding details. Can help control complexity and focus attention on appropriate issues

Front 2

accessor method

Back 2

code that is exclusively associeted with a class or with an object.

Front 3

actual parameter

Back 3

the value passed to a method as a parameter

Front 4

ALU

Back 4

arithmetic logic unit. subsystem that performs such mathematical and logical operations as addition, sutraction, comparison for equality.

Front 5

argument

Back 5

variable passed to method when it is invoked

Front 6

arithmetic operator

Back 6

an operator that performs a basic arithmetic computation, such as addition/multiplication

Front 7

array

Back 7

a programming language construct used to store an ordered list of primitive values or objects.

Front 8

assignment

Back 8

sets or resets a value assigned to a variable

Front 9

assembly language

Back 9

a low-level language that uses mneomonics to represent program commands

Front 10

binary

Back 10

the base-2 number system. modern computer systems store info as strings of binary digits (bits)

Front 11

bit

Back 11

a binary digit, either 0 or 1

Front 12

block

Back 12

a group of programming statements and declarations delimited by braces {}

Front 13

boolean

Back 13

a Java reserved word representing a logical data type that can only take the values true or false.

Front 14

boolean expression

Back 14

an expression that evaluates to a true or false result, primarily used as conditions in slection and repetition statements

Front 15

boolean operator

Back 15

any of the bitwise operaters AND OR or NOR when applied to boolean operands.

Front 16

byte

Back 16

a unti of binary stores equal to 8 bits

Front 17

bytecode

Back 17

low-level format into which the java compiler translates Java source code. interpreted and executed by the Java interpreter

Front 18

cache

Back 18

a memory area where frequently accessed data can be stored for rapid access.

Front 19

cast

Back 19

a java operation expressed using a type or class name in parantheses to eplicity convert and return a vlue of one data type into another.

Front 20

central processing unit (CPU)

Back 20

the hardware component that controls the main activity of a computer, including the flow of information and the execution of commands.

Front 21

class

Back 21

the blueprint of an object the model that defines the variables and methods an object will contain when instantiated

Front 22

class library

Back 22

a set of classes that define useful services for a programmer

Front 23

class method

Back 23

static method - invoked thru class name, cannot reference instance variables

Front 24

class variable

Back 24

a variable shared among all instane of a class. only one copy for all objects of the class (like count)

Front 25

compiler

Back 25

a program that translates code from one language to equivalent code in another language. The Java compiler translates java source code into java bytecode (interpreter)

Front 26

computer science

Back 26

study of algorithms including their formal/mathematical properties, hardware realizations, and applications

Front 27

control unit

Back 27

coordinates the processing steps - controls the interaction between a computer sstem and a particular kind of peripheral

Front 28

constructor

Back 28

a special method in a class that is invoked when an object is instantied form a class. used to initialize the object

Front 29

DASD

Back 29

direct access storage device (like cd) has addresses to located specific data, much faster @ accessing info (used for mass storage)

Front 30

data type

Back 30

a designation hat speifies a set of values. each variable has a data type that specifies the kinds of values that can be stored in it.

Front 31

encapsulation

Back 31

the characteristic of an object that limits access to the variables and methods contained in it.

Front 32

file

Back 32

a named collection of data stored on a secondary storage device such as a disk.

Front 33

flops

Back 33

floating pt operations per second. measure of a computer's performane (number crunching)

Front 34

formal parameter

Back 34

an identifier (dummy variable) that serves as a parameter name in a method. It receives its initial value from the actual parameter passed to it.

Front 35

high level language

Back 35

a programming language in which each statements represents many machine-level instructions

Front 36

HTML

Back 36

Hypertext Markup Language. The notation used to define Web pages

Front 37

immutable

Back 37

the characteristic of something that does not change. For example, the contents of a Java character strings are immutable once defined.

Front 38

implementation

Back 38

the process of translating a design into source ode. The source code that defins a method, lass, abstrct data type, or other programming entity.

Front 39

implicit paramenter

Back 39

The object on which a non-static method is invoked. For example in the method invocation myAccount.deposit(100), myAccount is the implicit parameter.

Front 40

initialize

Back 40

togive an intial value to a variable

Front 41

instance

Back 41

an object created from a class. Multiple objects can be instantiated from a single class

Front 42

instance variable

Back 42

each instance of a class has its own ersion of the variable.

Front 43

instantiation

Back 43

the act of creating an object from a class

Front 44

interpreter

Back 44

a program that translates and executes code on a particular machine

Front 45

instruction register

Back 45

holds a copy of the instruction fetched from memory.

Front 46

instruction set

Back 46

set of all operations that can be executed by a processor (what to include)

Front 47

Java

Back 47

programming language that is object oriented, robust, secure, architecture neutral, protable, high-performance, interpreted, threaded, and dynamic

Front 48

JVM

Back 48

Java Virtual Machine - the conceptual device, implemented in software, on which java bytecode is executed.

Front 49

local variabled

Back 49

a variable declared inside a method that does not exist outside of that method.

Front 50

loop control variable

Back 50

break!

Front 51

machine language

Back 51

the native language of a particular CPU

Front 52

mass storagedata

Back 52

data storeage on a system that is non-volatile in nature

Front 53

memory location

Back 53

an individual, addressable cell inside the main memory into which data can be stored.

Front 54

method

Back 54

a named group of declarations and programming statements that can be invoked (executed) when needed. part of a class

Front 55

Method invocation

Back 55

a line of code that causes a method to be executed. It specifies any values that are passed to the method as parameters.

Front 56

mutator method

Back 56

a method that changes the value of the argument variables

Front 57

null

Back 57

a Java reserved word that is a reference literal, used to indicate that a reference does nto currently refer to any object.

Front 58

object

Back 58

an encapsulated collection of data variables and methods. an instance of a classx[

Front 59

OOP

Back 59

an approach to software design and implementation that is centered around objects and classes

Front 60

OOP

Back 60

an approach to software design and implementation that is centered around objects and classes

Front 61

op code

Back 61

unique unsigned integer code assigned to each machine language operation recognized by the hardware.

Front 62

op code

Back 62

unique unsigned integer code assigned to each machine language operation recognized by the hardware.

Front 63

overloading

Back 63

assinging additional meanign to a programming lanuge construct, such as a method

Front 64

overloading

Back 64

assinging additional meanign to a programming lanuge construct, such as a method

Front 65

parameter

Back 65

a value passed from a method invocation to its definition

Front 66

parameter

Back 66

a value passed from a method invocation to its definition

Front 67

pointer

Back 67

a variable that can hold a memory address (references)

Front 68

pointer

Back 68

a variable that can hold a memory address (references)

Front 69

portability

Back 69

the ability of a program to be moved from one hardware platform to another w/o having to change it

Front 70

portability

Back 70

the ability of a program to be moved from one hardware platform to another w/o having to change it

Front 71

primitive data type

Back 71

a data type that is predefined in a programming language

Front 72

primitive data type

Back 72

a data type that is predefined in a programming language

Front 73

procedural programming

Back 73

an approach to software design and implementation that is centered around procedures(or functions) and their interaction

Front 74

procedural programming

Back 74

an approach to software design and implementation that is centered around procedures(or functions) and their interaction

Front 75

program

Back 75

a series of instructions executed by hardware, one after another.

Front 76

program

Back 76

a series of instructions executed by hardware, one after another.

Front 77

pseudocode

Back 77

structured and abbreviated natural language used to express the algorithmic steps of a program.

Front 78

pseudocode

Back 78

structured and abbreviated natural language used to express the algorithmic steps of a program.

Front 79

RAM

Back 79

random access memory a term basically interchangeable with main memory

Front 80

RAM

Back 80

random access memory a term basically interchangeable with main memory

Front 81

reference

Back 81

a variable that holds the address of an object. In java, a reference can be used to interact with an object.

Front 82

reference

Back 82

a variable that holds the address of an object. In java, a reference can be used to interact with an object.

Front 83

register

Back 83

a small area of storage in the CPU of the computer

Front 84

register

Back 84

a small area of storage in the CPU of the computer

Front 85

SASD

Back 85

sequential access storage device - all data must be searched (no addresses) like a tape

Front 86

SASD

Back 86

sequential access storage device - all data must be searched (no addresses) like a tape

Front 87

scope

Back 87

the area within a program in whih an identifier, such as a variable, can be referenced. "where a variable lives"

Front 88

scope

Back 88

the area within a program in whih an identifier, such as a variable, can be referenced. "where a variable lives"

Front 89

static

Back 89

a modifier of methods and variables. can be referenced w/o an instance of a class.

Front 90

stored programming concept

Back 90

the instructions to be executed by the computre are represented as binary values and stored in memory.

Front 91

syntax

Back 91

rules of a language - must follow an order

Front 92

unicode

Back 92

internation character set used to define valid Java characters. Each character is represented using a 16-bit unsigned numeric value

Front 93

variable

Back 93

an identifier in a program that represents a memory location in whcih a data value is stored.

Front 94

Von Neumann architecture

Back 94

programs and data are stored teogether in the same memory devices.

Front 95

white space

Back 95

used to set off sections of source code to make programs more readable.