Java Final
Order by
99 terms
Terms | Definitions |
|---|---|
accessor method | A method that accesses an object but does not change it. |
ACK | acknowledgment message containing sequence number of correctly received package sent by receiving node to acknowledge having received the correct package to the sending node. |
actual parameter | The expression supplied for a formal parameter of a method by the caller. |
address | the integer identifier of each cell of memory |
algorithm | An unambiguous, executable, and terminating specification of away to solve a problem. |
API | Application programming interface, which contains all classes of the Java library. |
argument | An actual parameter in a method call, or one of the values combined by an operator. |
arithmetic/Logic Unit (ALU) | subsystem of a computer component that performs mathematical and logical operations such as addition, subtraction, and comparison for equality. |
ASCII | widely used code for representing characters with 256 possible representations. |
ARQ Algorithm | Automatic repeat request where the receiver sends an ACK to the sender after receiving the packet. The sender automatically resends the packet to the receiver if an ACK is not forthcoming. |
Assembly language | Language designed for people and computers which is more productive and user-oriented. |
Binary | a method of representing numbers using powers of two. |
Bit | binary digit, the smallest unit of information, having two possible values: 0 and 1. A data element containing n bits will have 2^n possible possible values. |
Boolean | A type with two possible values, true and false |
boolean expression | an expression that evaluates a Boolean variable |
boolean operator | An operator that can be applied to Boolean values, such as &&, | |, and ! |
byte | a number made up of eight bits. Essentially all currently manufactured computer use a byte as the smallest unit of storage in memory |
bytecode | code created by a compiler in Java from source code. |
cache memory | high-speed memory unit which computer uses to store recently used information. |
cast | Explicitly converting a value from one type to another type. |
Church-Turing Thesis | If there exists an algorithm to do a symbol manipulation task, then there exists a Turing machine to do that task. |
Class | a programmer-defined datatype. |
Compiler | Translator of high level programming language into machine language instructions |
Computability | that which can be done by symbol manipulation problems, limits defined by Turing machines |
Computer network | set of independent computer systems connected by telecommunication links for the purpose of sharing information and resources |
computer science | study of algorithms including their formal and mathematical properties, hardware realizations, linguistic realizations, and applications. |
Computing agent | an abstract concept representing any object capable of understanding and executing instructions |
constructor | A method that instantiates a newly constructed object |
control unit | part of computer which fetches from memory for next instruction, decode, and execute by issuing appropriate command to the other subsystems. This process is repeated. |
DASD | Direct Access Storage Device is a mass storage device which each cell requires a unique amount of time for access, dependent on its location and state of the device. |
DNS | Internet application which converts symbolic host name into 32-bit IP address. |
encapsulation | the hiding of implementation details |
Ethernet | most widely used broadband technology through cable modem up to 1 gigabyte per second |
explicit parameter | A parameter of a method other than the object on which the method is invoked. |
flops | the number of floating point operations per second a computer can compute. |
formal parameter | A variable in a method definition; it is initialized with an actual parameter value when the method is called. |
Gigabyte | one billion bytes |
Halting problem | an algorithm which, given any set of Turing instructions, will indicate whether the instructions will halt. |
HTTP | hypertext transfer protocol, hypertext protocol which indicates webpage of text |
I/0 buffer | small amount of memory in the I/O controller |
I/O controller | special purpose computer within a computer which handles the details of input and output and compensates for speed differences between I/O devices and other parts of computers. |
IDE | Integrated Development Environment, a programming environment that includes an editor, compiler, and debugger. |
implicit parameter | The object on which a method is invoked. For example, in the call x.f(y), the object x is the implicit parameter of method f. |
initialize | Setting a variable to a well-defined value when it is created. |
Instance | a property which is characterized by all object of a class |
instance variable | A variable defined in the class for which every object of the class has its own value. The scope of the instance variable is the class. |
Instantiation | Construction of an object of that class. |
instruction set | the set of all operations that can be executed by a processor. |
Interface | operations which allow a service available to wider set of inputs by focusing on essential operations required. |
Inheritance | Creation of subclasses with similar methods and instance variables from a main class. |
Internet Protocol | The network layer which creates a universal address scheme among nodes and delivering messages between any two nodes in a network |
Instruction register | holds a copy of the instruction from memory, both op code and addresses. |
Instruction set | set of all operations that can be executed by a processor |
kilobyte | 1000 bytes |
LAN | local area network is located in a geographically contiguous area, comprised of several rooms. |
local variable | A variable whose scope is a block. |
logic gate | electronic device that operatres on a collection of binary inputs to produce a binary output, generally AND, NOT, and OR. |
loop | A sequence of instructions that is executed repeatedly |
MAC | determines how to arbitrate ownership of shared line when multiple information is being sent over a network. |
machine language | binary instructions used executed tasks in a coputer |
mass storage | the storage of large amounts of data in a persisting and machine-readable fashion. |
megabyte | 1,000,000 bytes |
memory | function unit of a computer that stores and retrieves instructions and the data being executed. |
Memory Address Register (MAR) | register which holds the address of the cell to be fetched or stored. |
Memory Data Register (MDR) | register which contains the data value being fetched or stored. |
Method | A sequence of statements that has a name, may have formal parameters, and may return a value. A method can be invoked any number of times, with different values for its parameters. |
mutator method | a method that changes the state of an object |
object | a value of a class type. |
object reference | a value that denotes the location of an object in memory. In Java, a variable whose type is a class contains a reference to an object of that class. |
object-oriented programming | Designing an object discovering objects, their properties, and their relationships. |
Op code | operation code is an unique unsigned integer code assigned to each machine language operation |
Operating system | program controls overall operation of a computer |
Overloading a method | when a name refers to more than one method, given different method parameters |
Overriding a method | a class method overrides a superclass method when it has the same name and parameter types. The overriding method is executed. |
Parameter | An item of information that is specified to a method when the method is called. |
parameter passing | Specifying expressions to be actual parameter values for a method when it is called. |
Portability | Java can be run on many operating systems. |
primitive data type | a number type or Boolean in Java |
protocol | mutually agreed upon set of rules, conventions, and agreements for the efficient and orderly exchange of information. |
Protocol stack | layers of protocols governing internet, including physical, medium access control, logical link control, network, transport, application |
pseudocode | high-level description of the actions of a program or algorithm, using a mixture of English and informal programming language syntax. |
Random Access Memory | access method of most computers where each memory cell has an address. |
register | components of memory used to implement store and fetch operations. |
SASD | sequential access storage device searches through data sequentially for right data |
scope | The part of the program in which the variable is defined. |
software | collection of computer programs that manage the resources of a computer and facilitate access to these resources |
static variable | a variable which is not associated with an object but with a class. |
static method | method which is not invoked in an object |
stored program concept | where all instructions to be executed by computer are in binary and stored in memory. |
syntax | rules that define how to form commands in a programming language |
terabyte | 1 trillion bytes. |
Time complexity | property of an algorithm which determines how much time the program will run given input. |
transistor | a tiny switch which is switched on and off by electricity. |
TCP | transport control protocol, which in the transport layer creates a reliable delivery of information over internet. Requires connection and uses ARQ algorithm for consistency. |
truth table | a structure where two columns indicate the input values and a third determine whether true or false is outputted. |
Turing machine | includes conceptual tape and set of instructions which executes symbolic manipulation problems |
Von Neumann architecture | structure and organization of modern computers with four major subsystems: memory, input/output, arthimetic/logic unit: stored program concept, and sequential execution of instructions. |
white space | any sequence of only white space, tab, and newline characters |
WAN | wide area network connects devices not in close proximity across large geographic areas. |
First Time Here?
Welcome to Quizlet, a fun, free place to study. Try these flashcards, find others to study, or make your own.