Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

ComSci Java & Ruby > Terms For Midterm > Flashcards

Terms For Midterm Flashcards

You may prefer our related Brainscape-certified flashcards:
Ruby on Rails flashcards
1
Q

+actual parameter

A

The actual value that is passed into the method by a caller.

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

*accessor method

A

A method that accesses and object but does not change it

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

Algorithm*

A

An unambiguous , executable, and terminating, specification of a way to solve a problem.

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

Argument *

A

A value supplied in a method call, or one of the values combined by an operator.

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

Bit*

A

Binary digit; the smallest unit of information, having two possible values: 1 and 0. A data element consisting of n bits had 2^n possible values.

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

Boolean operator *

A

An operator that can be applied to Boolean values. Java has three Boolean operators: &&, ||, and !.

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

byte*

A

A number made up of 8 bits. Most computers use byte as smallest unit of storage in memory.

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

cast*

A

Explicitly converting a value from one type to a different type.

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

class*

A

A programmer-defined data type.

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

constructor*

A

A sequence of statements for initializing a newly instantiated object.

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

encapsulation*

A

The hiding if implementation details.

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

explicit parameter*

A

A parameter of a method other than the object on which the method is invoked.

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

IDE*

A

Integrated developing environment - a programming environment that includes an editor, compiler, and debugger.

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

implicit parameter *

A

The object on which a method is invoked.

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

initialize*

A

Set a variable to a well defined value when it is created.

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

instance variable*

A

A variable defined in a class for which every object of the class has its own value.

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

*address

A

RAM is divided into fixed-sized units called cells, and each cells is associated with a unique identifier called an address.

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

+arithmetic/Logic Unit (ALU)

A

An arithmetic-logic unit (ALU) is the part of a computer processor (CPU) that carries out arithmetic and logic operations on the operands in machine language.

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

ASCII*

A

stands for American Standard code for information interchange. its the international standard for representing textual info in the majority of computers.

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

binary+

A

of, relating to, or written in binary code; programmed or encoded using only the digits 0 and 1

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

bit*

A

A bit is the most basic unit in computing. It is a binary digit that has one of two values; either 0 or 1.

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

boolean+

A

In computer science, the Boolean data type is a data type, having two values (usually denoted true and false), intended to represent the truth values of logic and Boolean algebra.

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

boolean expression*

A

An expression that results in a value of either TRUE or FALSE. For example, the expression 2

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

boolean operator+

A

All expressions that contain relational operators , such as the less than sign (

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

*byte

A

A number made up of eight bits. essentially all currently manufactured computers use a byte as the smallest unit of storage memory.

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

+cache memory

A

Cache memory is a type of memory used to hold frequently used data. Cache memory is relatively small but very fast.

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

computer science*

A

The study of algorithms including, their formal and mathematical properties (math theory), their hardware realizations (comp engineering), their linguistic realizations (program languages), and their applications (web browsers/apps).

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

control unit+

A

the part of a CPU that interprets the instructions in programs and directs the operation of the entire system.

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

flops*

A

In computing, FLOPS or flops (an acronym for Floating-point Operations Per Second) is a measure of computer performance, useful in fields of scientific calculations that make heavy use of floating-point calculations.

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

formal parameter+

A

formal parameter — the identifier used in a method to stand for the value that is passed into the method by a caller. For example, amount is a formal parameter of processDeposit

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

gigabyte+

A

1024 killobytes

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

I/0 buffer *

A

the small amount ofmemory for an I/O controller

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

I/O controller*

A

is like a special purpose computer whose responsibility is to handle details of input/output and compensate for any speed differences.

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

initialize *

A

Set a variable to a well defined value when it’s created.

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

instance variable *

A

A variable defined in a class for which every object in the class has it own value.

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

instantiation+

A

In programming, instantiation is the creation of a real instance or particular realization of an abstraction or template such as a class of objects or a computer process. To instantiate is to create such an instance by, for example, defining one particular variation of object within a class, giving it a name, and locating it in some physical place.

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

instruction set*

A

The set of all operations that can be executed by a processor is called its instruction set.

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

kilobyte -

A

One kilobyte is technically 1,000 bytes, kilobytes are often used synonymously with kibibytes, which contain 1,024 bytes.

39
Q

local variable*

A

A variable whose scope is a block.

40
Q

logic gate +

A

A logic gate is an elementary building block of a digital circuit. At any given moment, every terminal is in one of the two binary conditions 0 or 1.

41
Q

loop*

A

A sequence of instructions that is executed repeatedly.

42
Q

machine language*

A

instructions for the processing of data in a binary, octal, or hexadecimal code that can be understood and executed by a computer

43
Q

Computer Science (simplified)*

A

The study of algorithms, including 1. Their formal and mathematical properties 2. Their hardware realizations 3. Their linguistic realizations 4. Their applications

44
Q

primitive data type +

A

an unambiguous operation

45
Q

loop*

A

A sequence of instructions that is executed repeatedly.

46
Q

method*

A

A sequence of statements that has a name, may have parameter variables, and may return a value.

47
Q

mutator method*

A

A method that changes the state of an object.

48
Q

object*

A

A value of a class type.

49
Q

Object oriented programming *

A

Designing a program by discovering objects, their properties, and their relationships.

50
Q

object reference *

A

A value that denotes the location of an object in memory.

51
Q

parameter passing *

A

Specifying expressions to be arguments for a method when it is called.

52
Q

Pseudocode *

A

A high level description of the actions of a program or algorithm, using a mixture of English and informal programming language syntax.

53
Q

scope*

A

The part of the program in which a variable is defined.

54
Q

syntax*

A

Rules that define how to form instructions in a particular programming language.

55
Q

white space *

A

Any sequence of only space, tab, and newline characters.

56
Q

Von Neumann architecture *

A

a theoretical model named after Von Neumann that specifies the structure and organization of virtually all modern computers. -4 major subsystems memory, input/output, ALU, and control unit -stored program concept -sequential execution instructions

57
Q

truth table -

A

a diagram in rows and columns showing how the truth or falsity of a proposition varies with that of its components

58
Q

transistor -

A

a device that is used to control the flow of electricity

59
Q

stored program concept*

A

part of von neuman architecture in which the instructions to be executed by the computer are represents as binary values and stored as memory.

60
Q

memory*

A

is the functional unit of a computer that stores and retrieves the instructions and the data being executed.

61
Q

RAM *

A

random access memory is the memory unit of a computer divided into cells with addresses. All accesses to memory are specified to an address and we always fetch or store a complete cell. The time it takes to fetch or store the contents of a cell is the same for all the cells in memory.

62
Q

software*

A

The intangible instructions and data that are necessary for operating a computer or another device.

63
Q

MAR*

A

one of memory units two special registers. MAR holds the address of the cell to me accessed.

64
Q

MDR*

A

memory data register contains the data being fetched or stored by computer.

65
Q

Mass Storage -

A

Nonvolitile storage where data can be saved after shutting down a device. ex. discs and tapes.

66
Q

computer network*

A

a set of independent computer systems connected by telecommunication links for the purpose of sharing information and resources

67
Q

ethernet*

A

Developed in mid 70’s, its the most broadly used commercial broad band technology. It transmits at 100 Mbps across coaxial cable, fiber-optic cable, or regular twisted-pair copper wire.

68
Q

LAN*

A

local area network. this connects hardware devices such as computers, printers, and storage devices that are all in close proximity.

69
Q

WAN*

A

a wide area network connects devices that are not in close proximity but rather are across town, across the country, or across the ocean.

70
Q

protocol*

A

in networking a protocol is a mutually agreed-upon set of rules, conventions, and agreements for the efficient and orderly exchange of information.

71
Q

protocol stack*

A

The Internet protocol hierarchy, also called a protocol stack, has five layers. 1 Physical, 2a Medium access Control 2b Logical Link control, 3 Network, 4 Transport, 5 Application.

72
Q

ARQ algorithm*

A

automatic repeat request, is the basis for all Data Link Control protocols in current use.

73
Q

ACK*

A

Is a special acknowledgement message used by ARQ algorithm to ensure successful data transfer.

74
Q

Internet Protocol*

A

This is the network layer in the internet sometimes abbreviated as IP.

75
Q

DNS*

A

Domain Name Systems is a special internet application with the tasked to convert from a symbolic host name to its equivalent 32-bit IP address.

76
Q

HTTP*

A

hypertext transfer protocol. this is the most common format of information protocol contained on a page.

77
Q

API*

A

(application programming interface) A code library for building programs.

78
Q

bytecode*

A

instructions for the java virtual machine

79
Q

compiler*

A

A program that translates code in a high - level language (such as java) to machine instructions (such s bytecode for the Java virtual machine).

80
Q

*operating system

A

The software that launches application programs and provides services (such as a file system) for those programs.

81
Q

*overloading a method

A

Giving more than one meaning to a method name.

82
Q

*overriding a method

A

Redefining a method in a subclass

83
Q

TCP* (IP)

A

(transmission control protocol / internet protocol) the pair of communication protocols that is used to establish reliable transmission of data between two computers on the internet.

84
Q

Turing machine*

A

a very simple model of computation that is used in theoretical computer science to explore computability of problems

85
Q

Assembly language*

A

New language designed for humans as well as computers that created a more productive, user oriented environment and assemblers were the first pieces of system software to be widely used.

86
Q

Church-Turing Thesis*

A

Thesis of Alan Turing that makes the claim that if there exists an algorithm to do a symbol manipulation task then there exists a Turing Machine to do the task.

87
Q

Computability*

A

That which can be done by symbol manipulation algorithms.

88
Q

Computing Agent*

A

In computer science terminology it refers to the machine, robot, person or thing carrying out the steps of the algorithm.

89
Q

DASD*

A

A form of mass storage device where every unit of information still has a unique address, but the time needed to access that information depends on its physical location and the current state of the device.

90
Q

Halting Problem*

A

Clear and unambiguous problem stating that if given a collection of Turing machine instructions together with any initial tape contents, whether that Turing Machine will ever halt if started on that tape.

91
Q

Interface*

A

Type that declares methods but does not provide their implementations. They make code more reusable.

92
Q

Inheritance*

A

Relationship between a more general superclass and a more specialized subclass.

93
Q

Instruction Register*

A

A special register that holds a copy of the instructions fetched from memory. It holds both op code portion of instructions and the addresses.

94
Q

Op Code*

A

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

ComSci Java & Ruby (2 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions