Brainscape's Knowledge GenomeTM

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


See full index

COMS W1004 Introduction to Computer Science and Programming in Java > Final Terms to Know > Flashcards

Final Terms to Know Flashcards

Study these terms before the final for COMS W1004: Introduction to Computer Science and Programming in Java

You may prefer our related Brainscape-certified flashcards:
Biology 101 flashcards
1
Q

accessor method

A

a method that accesses an object but does not change it

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

ACK

A

in data networking, an acknowledgement (or acknowledgment) is a signal passed between communicating processes or computers to signify acknowledgement, or receipt of response, as part of a communications protocol

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

actual parameter

A

Formal parameters are the parameters as they are known in the function definition. Actual parameters (also known as arguments) are what are passed by the caller.

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

address

A

the code that identifies where a piece of information is stored

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
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
6
Q

API

A

(Application Programming Interface) a code library for building programs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
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
8
Q

arithmetic/Logic Unit (ALU)

A

a digital circuit that performs integer arithmetic and logical operations

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

ARQ Algorithm

A

Automatic Repeat reQuest (ARQ), also known as Automatic Repeat Query, is an error-control method for data transmission that uses acknowledgements (messages sent by the receiver indicating that it has correctly received a data frame or packet) and timeouts (specified periods of time allowed to elapse before an acknowledgment is to be received) to achieve reliable data transmission over an unreliable service. If the sender does not receive an acknowledgment before the timeout, it usually re-transmits the frame/packet until the sender receives an acknowledgment or exceeds a predefined number of re-transmissions

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

ASCII

A

the American Standard Code for Information Interchange is a character-encoding scheme originally based on the English alphabet that encodes 128 specified characters - the numbers 0-9, the letters a-z and A-Z, some basic punctuation symbols, some control codes that originated with Teletype machines, and a blank space - into the 7-bit binary integers

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

assembly language

A

an assembly language is a low-level programming language for a computer, or other programmable device, in which there is a very strong (generally one-to-one) correspondence between the language and the architecture’s machine code instructions

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

binary

A

number system, also known as base-2, that represents numeric values using two symbols: typically 0 and 1

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

bit

A

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

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

boolean

A

a type with two possible values: true and false

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

boolean expression

A

an expression in a programming language that produces a Boolean value when evaluated, i.e. one of true or false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
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
17
Q

byte

A

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

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

bytecode

A

instructions for the Java virtual machine

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

cache memory

A

random access memory (RAM) that a computer microprocessor can access more quickly than it can access regular RAM

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

cast

A

explicitly converting a value from one type to a different type. For example, the cast from a floating-point number x to an integer is expressed in Java by the cast notation (int) x.

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

Church-Turing Thesis

A

in computability theory, the Church–Turing thesis (also known as the Turing–Church thesis,[1] the Church–Turing conjecture, Church’s thesis, Church’s conjecture, and Turing’s thesis) is a combined hypothesis (“thesis”) about the nature of functions whose values are effectively calculable; or, in more modern terms, functions whose values are algorithmically computable. In simple terms, the Church–Turing thesis states that a function is algorithmically computable if and only if it is computable by a Turing machine

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

class

A

a programmer-defined data type

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

compiler

A

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

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

computability

A

computability is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within mathematical logic and the theory of computation within computer science. The computability of a problem is closely linked to the existence of an algorithm to solve the problem.

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

computer network

A

a computer network or data network is a telecommunications network that allows computers to exchange data. In computer networks, networked computing devices pass data to each other along data connections. The connections (network links) between nodes are established using either cable media or wireless media. The best-known computer network is the Internet

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

computer science

A

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

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

computing agent

A

any object capable of understanding and executing our instructions.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
28
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
29
Q

control unit

A

unit within the computer that actually carries out the operations of a program

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

DASD

A

in mainframe computers and some minicomputers, a direct access storage device, or DASD, is any secondary storage device which has relatively low access time relative to its capacity

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

DNS

A

the Domain Name System (DNS) is a hierarchical distributed naming system for computers, services, or any resource connected to the Internet or a private network

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

ethernet

A

Ethernet is a family of broadband computer networking technologies for local area networks (LANs). Ethernet was commercially introduced in 1980 and standardized in 1985 as IEEE 802.3. Ethernet has largely replaced competing wired LAN technologies such as token ring, FDDI, and ARCNET

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

encapsulation

A

the hiding of implementation details

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
34
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
35
Q

flops

A

floating-point operations per second

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

formal parameter

A

a variable in a method definition

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

gigabyte

A

2^30, or close to a billion, bytes

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

Halting Problem

A

in computability theory, the halting problem can be stated as follows: “Given a description of an arbitrary computer program, decide whether the program finishes running or continues to run forever”. This is equivalent to the problem of deciding, given a program and an input, whether the program will eventually halt when run with that input, or will run forever.

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

HTTP

A

(Hypertext Transfer Protocol) the protocol that defines communication between web browsers and web servers

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

I/O buffer

A

memory stored in the I/O controller for transfer between RAM and an I/O device

41
Q

I/O controller

A

a device that interfaces between an input or output device and the computer or hardware device. The input/output controller on a computer is commonly located on the motherboard. However, an I/O controller can also be an internal add-on that can either be used as a replacement or to allow for additional input or output devices for the computer.

42
Q

IDE

A

(Integrated Development Environment) a programming environment that includes an editor, compiler, and debugger

43
Q

implicit parameter

A

the object on which a method is invoked. For example, in the call x.f(y), the object x is the implicit parameter of the method f.

44
Q

interface (in Java)

A

an interface in the Java programming language is an abstract type that is used to specify an interface (in the generic sense of the term) that classes must be implement. Interfaces are declared using the interface keyword, and may only contain method signature and constant declarations (variable declarations that are declared to be both static and final). An interface never contains method implementations (ie function “bodies”).

45
Q

inheritance (in Java)

A

The is-a relationship between a more general superclass and a more specialized subclass.

46
Q

initialize

A

set a variable to a well-defined value when it is created

47
Q

instance

A

(of a class) an object whose type is that class

48
Q

instance variable

A

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

49
Q

instantiation

A

(of a class) construction of an object of that class

50
Q

Internet Protocol

A

The network layer of the internet. Delivers packages from the source host to a destination based on IP addresses, and defines addressing methods.

51
Q

instruction register

A

Holds a copy of the instruction fetched from memory, which includes the op code and addresses. Instruction decoders interpret op codes to find the corresponding functions, and the address tells the computer where to do this function.

52
Q

instruction set

A

an instruction set, or instruction set architecture (ISA), is the part of the computer architecture related to programming, including the native data types, instructions, registers, addressing modes, memory architecture, interrupt and exception handling, and external I/O.

53
Q

kilobyte

A

2^10, or around 1000, bytes

54
Q

LAN

A

Local Area Network. Connects hardware devices such as computers, printers, and storage devices. There are many types: bus, ring, star, etc.

55
Q

local variable

A

a variable whose scope is a block (it can only be accessed within that block)

56
Q

logic gate

A

an idealized or physical device implementing a Boolean function, that is, it performs a logical operation on one or more logic inputs and produces a single logic output

57
Q

loop

A

a sequence of instructions that is executed repeatedly

58
Q

MAC

A

Medium Access Control. Determine how to arbitrate ownership of a shared communication line when multiple nodes want to send messages at the same time. Node listens to see if the line is busy before it sends. If two messages are sent at the same time they collide and are lost. Retransmission selects a random waiting time to resend the messages.

59
Q

machine language

A

(machine code) instructions that can be executed directly by the CPU

60
Q

mass storage

A

nonvolatile means of storing information, can store a great deal of memory, don’t require a power source in order to persist, two distinct forms - direct access storage devices (DASDs) and sequential access storage devices (SASDs)

61
Q

megabyte

A

2^20, or around a million, bytes

62
Q

memory

A

fundamental unit of a computer that stores and retrieves the instructions and the data being executed

63
Q

Memory Address Register (MAR)

A

holds the address of the cell to be fetched or stored

64
Q

Memory Data Register (MDR)

A

contains the data value being fetched or stored

65
Q

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

66
Q

mutator method

A

a method that changes the state of an object

67
Q

object

A

a value of a class type

68
Q

object reference

A

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

69
Q

object-oriented programming

A

designing a program by discovering objects, their properties, and their relationships

70
Q

op code

A

3-bits, has 8 possible output line. They are fed into an instruction decoder to find the corresponding operation that goes with the 3 bits.

71
Q

operating system

A

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

72
Q

overloading a method

A

giving more than one meaning to a method name

73
Q

overriding a method

A

redefining a method in a subclass

74
Q

parameter

A

an item of information that is specified to a method when the method is called

75
Q

parameter passing

A

specifying expressions to be arguments for a method when it is called

76
Q

portability

A

a program that will run, without change, on multiple platforms. The java compiler is ale to achieve this because it does not translate Java programs into CPU instructions, but compiles for the Java virtual machine, a program that simulates a real CPU.

77
Q

primitive data type

A

in Java, a number type or boolean

78
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

79
Q

protocol stack

A

five layers (from top to bottom): application, transport, network, logical link control, medium access control, and physical. This hierarchy is called the TCP/IP protocol.

80
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

81
Q

Random Access Memory

A

RAM, electronic circuits in a computer that can store code and data of running programs

82
Q

register

A

a storage cell that holds the operands of an arithmetic operation and that, when the operation is complete, holds its results

83
Q

SASD

A

Sequential Access Storage Devices. Does not require that all units of data be identifiable by unique addresses; searches all data sequentially. It is very, very slow.

84
Q

scope

A

the part of a program in which a variable is defined

85
Q

software

A

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

86
Q

static variable

A

a variable defined in a class that has only one value for the whole class, and which can be accessed and changed by any method of that class

87
Q

static method

A

a method with no implicit parameter

88
Q

stored program concept

A

central characteristic of Von Neumann Architecture and the design of all modern computers, in which the instructions to be executed by the computer are represented as binary values and stored in memory

89
Q

syntax

A

rules that define how to form instructions in a particular programming language

90
Q

terabyte

A

2^40, or around 1 trillion, bytes

91
Q

time complexity

A

the amount of time taken by an algorithm to run as a function of the length of the string representing the input. Often denoted by the big O notation: O(n).

92
Q

transistor

A

the elementary building block of all modern computers, a solid-state device with no moving parts that can be in either an on or off state, transistors as well as electrical conducting paths to them are printed photographically on a wafer of silicon to produce an integrated circuit or chip

93
Q

TCP

A

Transport Control Protocol. Also called protocol stack, has five layers (from top to bottom): application, transport, network, logical link control, medium access control, and physical.

94
Q

truth table

A

a mathematical table used to compute the functional values of logical expressions on each possible combination of their logical variables

95
Q

Turing machine

A

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

96
Q

Von Neumann architecture

A

theoretical model for nearly all modern computers, such computers are composed of four major subsystems (memory, input/output, the ALU or arithmetic/logic unit, and the control unit), the stored program concept, and the sequential execution of instructions

97
Q

white space

A

any sequence of only space, tab, and newline characters

98
Q

WAN

A

Wide Area Networks. Connects devices that are not in close proximity (across the country, for example). They use dedicated, point to point links and a store and forward, packet-switched tech to send messages.

COMS W1004 Introduction to Computer Science and Programming in Java (1 decks)

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