Brainscape's Knowledge GenomeTM

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


See full index

compsci > New Microsoft Excel Worksheet. > Flashcards

New Microsoft Excel Worksheet. 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

actual parameter

A

the expression supplied for a formal parameter of a method by the caller

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

ACK

A

acknowledgment message. message containing the sequence number of the correctly received packet sent by the receiver back to the sender to acknowledge correct receipt of the message

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

address

A

a location in memory at which a binary number (usually a byte, or value of 8 bits) is stored. The location in memory can itself be identified by a binary number this number, the absolute or explicit address, gives the absolute location of the address in memory, while a relative address specifies a location memory (some other address only in relation to the current, or base, address. All access to memory is access to to a cell of memory found at a specified address.

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

algorithm

A

a well-ordered collection of unambiguous and effectively computable operations that, when executed, produces a result and halts in a finite amount of time (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. Another way to think of it is as the specification of the interface for how to make use of libraries or software interfaces. The API documentation for Java provides information about each class in the Java library

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

argument

A

an actual parameter 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

the arithmetic/logic unit is the subsystem that performs such mathematical and logical operations as addition, subtraction, and comparison for equality. IN modern machines, the ALU and the control unit are integrated in the CPU. The ALU is made up of the registers, interconnections between components, and the ALU circuitry, which are together called the data path.

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

ARQ Algorithm

A

automatic repeat request the basis for all data link control protocols, transforms a bit pipe into a message pipe by a series of rules guaranteeing the correct transmission of packets of information between senders and receivers through the use of acknowledgment messages

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 Exchange - a character-encoding scheme based on the English alphabet used to represent text in computers. It uses 8 bits to represent each character, so it is able to encode a total of 2^8 = 256 different characters. These are assigned the integer values 0 to 255. Only 32 to 126 have been assigned to printable characters. The ASCII has been largely supplanted by UNICODE and the UCS (universal character set), which are backwards compatible with it (commonly encoded using UTF-8, UTF-16, and UTF-32 representing character sets using 8, 16, and 32 bits respectively. UTF-16 can represent 65,536 characters.)

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

assembly language

A

low-level programming language for computers that implements a symbolic representation of the machine codes and other constants needed to program a given CPU architecture. It is specific to a certain physical or virtual computer architecture. Each symbolic assembly language instruction is translated into exactly one binary machine-language instruction.

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

binary

A

the binary, or the base-2, positional numbering system represents numerical values using only two symbols, 0 and 1

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

bit

A

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

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

boolean

A

a data type with two possible value representing 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., 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 3 boolean, or logical, 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 8 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

a special, super-high-speed memory unit. Operating on the principle of locality, which says that when the computer uses something it will probably use it again very soon, when the computer references a piece of data for the first time, it stores that data in cache memory, and when it needs to fetch a piece of information, it first looks in cache memory before performing a memory fetch. Since accessing cache memory is so much faster (typically 5 to 10 times faster) than accessing RAM, it is still faster to access cache memory first and then look in RAM if the data is not found (the cache hit rate tells us just how much faster).

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

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

Church-Turing thesis

A

If there exists an algorithm to do a symbol manipulation task, then there exists a Turing machine to do that task.

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

class

A

a programmer defined data type (that is, the type of an object), the blueprint or template for creating an object

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

solvable by a computing device/that which can be done by symbol manipulation algorithms

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

computer network

A

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

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

idealized computing machine that can: 1. Accept input. 2. Store information in and retrieve it from memory. 3. Take actions according to alogorithm instructions; the choice of what action to take may depend on the present state of the computing agent, as well as on the input item presently being processed. 4. Produce output.

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

constructor

A

A set of statements initializing the instance variables of an 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. the control unit does three things: fetches from memory the next instruction to be executed, decodes it, and executes it by issuing the appropriate command to the ALU, memory, or I/O controllers. It halts when the last instruction in the program is reached.

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

DASD

A

Direct Access storage device. Mass storage system in which every unit of information has a unique address but where the time needed to access that information depends on its physical location and the current state of the device (includes hard disks, floppy disks, CDs, DVDs, etc. Access time depends on seek time, latency, and transfer time

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

DNS

A

Domain Name System. Special internet applications that converts from a symbolic host name (www.thisismysymbolichostname.com) to its IP address (141.140.1.5).

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

encapsulation

A

a fundamental concept in the strategy of information hiding (and of object-oriented programming more generally) The hiding of implementation details

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

ethernet

A

broadband technology originally designed at Xerox PARC in the 70s to operate at 10 Mbps. Fast ethernet operates at 100 Mbps

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; it is initialized with an actual parameter value when the method is called

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

gigabyte

A

1 billion bytes. In binary, technically 2^30 bytes, or 1 073 741 824 bytes

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

Halting Problem

A

the Halting Problem, which is meant to demonstrate the limits of computation, is as follows: Decide, given any collection of Turing machine instructions together with any initial tape contents, whether that Turing machine will ever halt if started on that tape.

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/0 buffer

A

memory stored in the I/O controller for transfer between RAM and an I/O device (such as characters from memory to a screen, or from a mass storage device to memory).

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

I/O controller

A

a device that handles the details of input/output and compensates for any speed differences between I/O devices and other parts of the computer. Contains a small amount of memory, called an I/O buffer, and enough I/O control and logic processing capability to handle the mechanical functions of the I/O device, such as the read-write head, paper feed mechanism, and screen display. It is also able to transmit to the processor a special hardware signal, called an interrupt signal, when an I/O operation is done.

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

IDE

A

Integrated development environment, such as Eclipse: A software application that provides comprehensive facilities to computer programmers for software development. An IDE normally consists of: a source code editor, a compiler and/or an interpreter, build automation tools, a debugger

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

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

interface (in Java)

A

a type with no instance variables, only abstract methods and constants, used to express common operations or services so that a variety of types can make use of them

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

inheritance (in Java)

A

the is-a relationship between a more general superclass and a more specialized subclass. hierarchical relationship between classes in Java where all subclasses inherit the properties of their superclass. Inheritance enables a class to reuse the fields and methods of the existing class without having to write (and debug!) them over. A subclass inherits all the members (fields, methods, and nested classes) from its superclass. Constructors are not members, so they are not inherited by subclasses, but the constructor of the superclass can be invoked from the subclass.

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

initialize

A

to set a variable to a well-defined value when it is created. int x = 0; initializes the variable x with a value of 0.

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

construction of an object of a given class

50
Q

Internet Protocol

A

the network layer in the Internet, also called IP. The glue that holds the internet together. Its job is to deliver a message from the site where it was created to its destination. IP consists of an addressing scheme for identifying each and every node on the internet

51
Q

instruction register

A

(IR) holds a copy of the instruction fetched from memory. holds botht he opcode portion of the instruction abbreviated IRop, and the address(es), abbreviated IRaddr.instruction set All of the machine-language commands that a particular CPU is designed to understand.

52
Q

kilobyte

A

1000 bytes, technically 2^10, or 1024 bytes in binary

53
Q

LAN

A

local area network. connects hardware devices such as computers, printers, and storage devices that are all in close proximity. the owner of the computers in a LAN is also the owner of the means of communications. located entirely on private property

54
Q

local variable

A

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

55
Q

logic gate

A

A logic gate is 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. Depending on the context, the term may refer to an ideal logic gate, one that has for instance zero rise time and unlimited fan-out, or it may refer to a non-ideal physical device.

56
Q

loop

A

a sequence of instructions that is executed repeatedly

57
Q

MAC

A

medium access control, access control protocols which determine how to arbitrate ownership of a shared line when multiple nodes want to send messages at the same time, MAC address is the unique identifier assigned to network interfaces for communications on the physical network segment

58
Q

machine language

A

instructions that can be executed directly by the CPU

59
Q

mass storage

A

nonvolatile means of storing information. There are two distinct forms: direct access storage devices (DASDs) and sequential access storage devices (SASDs). These devices can store a great deal of memory and, because they are nonvolatile, do not require a power source in order to persist. They are used for archival storage, and for storage of information that is not needed immediately by the computer.

60
Q

megabyte

A

a million bytes, technically 2^20, or 1 048 576 bytes

61
Q

memory

A

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

62
Q

Random access memory

A

has the following 3 characteristics: 1. Memory is divided into fixed-size units called cells, and each cell is associated with a unique identifier called an address. These addresses are the unsigned integers 0, 1, 2, … , MAX. 2. All accesses to memory are to a specified address, and we must always fetch or store a complete cell - that is, all the bits in that cell. The cell is the minimum unit of access. The time it takes to fetch or store the contents of a cell is the same for all the cells in memory.

63
Q

memory registers

A

the two registers used to implement the fetch and store operations. Fetch and store operations require two operands, the address of the cell being accessed and either the value being stored by the store operation or the value returned by the fetch operation.

64
Q

Memory Address Register (MAR)

A

holds the address of the cell to be fetched or stored. Because the MAR must be capable of holding any address, it must be at least N bits wide, where 2^N is the address space of the computer.

65
Q

Memory Data Register (MDR)

A

contains the data value being fetched or stored. Typically a multiple of 8 bits, since it it is used to hold the data to be fetched or stored and all data must be stored in cells that are 8 bits wide.

66
Q

method

A

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.

67
Q

method signature

A

the name of a method and the type of its parameters

68
Q

mutator method

A

a method that changes the state of its objects, as opposed to an

69
Q

object

A

a value of a class type

70
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 this class.

71
Q

object-oriented programming

A

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

72
Q

op code

A

the portion of a machine language instruction that specifies the operation to be performed. an opcode mnemonic allows an assembly language programmer to refer to an op code by a symbolic name such as LOAD X or STORE X rather than by a binary number (the op code itself)

73
Q

operating system

A

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

74
Q

overloading a method

A

giving more than one meaning to a method name. a class can declare two methods with the same name and different parameter types.

75
Q

parameter

A

an item of information that is specified to a method when the method is called. For example, in the call System.out.println(“Hello, World!”), the parameters are the implicit parameter System.out and the explicit parameter “Hello, World!”.

76
Q

parameter passing

A

specifying expressions to be actual parameter values for a method when it is called.

77
Q

primitive data type

A

primitive data type in Java, A primitive type is predefined by the language and is named by a reserved keyword. There are 8 in Java: byte, short, int, float, double, long, boolean, char

78
Q

protocol

A

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

79
Q

protocol stack

A

also called a protocol hierarchy. The internet protocol hierarchy has five layers: application, transport, network, logical link control, medium access control, and the physical layer. This hierarchy is also referred to as TCP/IP after two of its most important protocols

80
Q

protocol stack (long)

A

The protocol stack is an implementation of a computer networking protocol suite. The terms are often used interchangeably. Strictly speaking, the suite is the definition of the protocols, and the stack is the software implementation of them. Individual protocols within a suite are often designed with a single purpose in mind. This modularization makes design and evaluation easier. Because each protocol module usually communicates with two others, they are commonly imagined as layers in a stack of protocols. The lowest protocol always deals with “low-level”, physical interaction of the hardware. Every higher layer adds more features. User applications usually deal only with the topmost layers

81
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

82
Q

Random Access Memory

A

RAM, electronic circuits in a computer that can store code and data of running programs. random access is the ability to access any value directly without having to read the values preceding it.

83
Q

register

A

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

84
Q

SASD

A

Sequential Access Storage Device

85
Q

scope

A

the part of a program in which a variable is defined

86
Q

software

A

is a collection of computer programs and related data that provide the instructions for telling a computer what to do and how to do it. In other words software is a set of programs, procedures, algorithms and its documentation

87
Q

static variable

A

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

88
Q

static method

A

a method with no implicit parameter

89
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

90
Q

syntax

A

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

91
Q

terabyte

A

1 trillion bytes - in binary actually 1099511627776, or 2^40 bytes

92
Q

time complexity

A

quantification of the amount of time taken by an algorithm to run as a function of the size of the input to the problem.

93
Q

time complexity (long)

A

quantification of the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O notation, which suppresses multiplicative constants and lower order terms. When expressed this way, the time complexity is said to be described asymptotically, i.e., as the input size goes to infinity. For example, if the time required by an algorithm on all inputs of size n is at most 5n3 + 3n, the asymptotic time complexity is O(n3). Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, where an elementary operation takes a fixed amount of time to perform. Thus the amount of time taken and the number of elementary operations performed by the algorithm differ by at most a constant factor. Since an algorithm may take a different amount of time even on inputs of the same size, the most commonly used measure of time complexity, the worst-case time complexity of an algorithm, denoted as T(n), is the maximum amount of time taken on any input of size n. Time complexities are classified by the nature of the function T(n). For instance, an algorithm with T(n) = O(n) is called a linear time algorithm, and an algorithm with T(n) = O(2n) is said to be an exponential time algorithm.

94
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, along with electrical conducting paths to them, are printed photographically on a wafer of silicon to produce an integrated circuit, or chip (currently about 1 billion transistors can be printed in a space of 1 sq cm)

95
Q

TCP

A

Transfer Control Protocol the primary transport layer protocol whose job is to create a high-quality error-free, order-preserving end-to-end delivery service on top of the unreliable delivery provided by IP

96
Q

truth table

A

a mathematical table used to compute the functional values of logical expressions on each possible combination of their logical variables. Often the variables used are 0s and 1s but they may be Ts and Fs as well

97
Q

Turing machine

A

an idealized computing devices consisting of a tape that extends infinitely in both directions. The tape is divided into cells each of which contains one symbol. The symbols come from a finite set of symbols called the alphabet. The Turing machine can only carry out on primitive type of operation and is designed to show the limits of computing. Any algorithm that can be carried by any kind of computing device whatsoever can in theory be carried out by a Turing machine, and anything which a Turing machine cannot compute is theoretically uncomputable - that is, it represents a problem that cannot be solved algorithmically

98
Q

variable

A

a named storage location that can hold a data value

99
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 (in which the instructions to be executed by the computer are represented as binary values and stored in memory), and the sequential execution of instructions (in which one instruction at a time is fetched from memory and passed to the control unit, where it is decoded and executed).

100
Q

white space

A

any sequence of only space, tab, and newline characters

101
Q

WAN

A

wide area network connects devices that are not in close proximity. WAANs cross public property, require the purchase of telecommunication services, and are typically dedicated point-to-point lines directly connecting two machines. Most use a store-and-forward, packet-switched technology

102
Q

circuit (combinatorial circuit)

A

collection of logic gates that transform a set of binary inputs into a set of binary outputs and which the values of the outputs depend only on the current values of the inputs.

103
Q

gate

A

an electronic device that operates on a collection of binary inputs to produce a binary output

104
Q

Scientific notation

A

+-M X B^+-E, where M is the mantissa, B is exponent base and E is the Exponent, 5.75 = 101.11 X 2^0 = .10111 X 2^3 (normalized) REPRESENTATION USING 16 BITS 0 101110000 0 00011 Sign of Mantissa is 1 bit, mantissa is 9 bits, sign of exponent is 1 bit, and

105
Q

input operation

A

operation which submits data values to the computing agent from the outside world that may it may use in later instructions

106
Q

output operation

A

operation which sends results from the computing agent to the outside world

107
Q

sequential or straight-line algorithm

A

executes instructions in a straight line from top to bottom and then stops

108
Q

control operations

A

conditional and iterative operations

109
Q

conditional statements

A

if/then/else statements that determine what steps to execute based on whether certain conditions are true or false.

110
Q

lossless compression

A

scheme for reducing the amount of data required to represent information without losing any information, such that the original data can be reproduced exactly

111
Q

lossy compression

A

compression of data in a way that does not guarantee the original data can be fully and completely recreated, they trade a loss of accuracy for a higher compression ratio.

112
Q

nondestructive fetch

A

basic memory operation that fetches a copy of the contents of the memory cell with the specified address and returns those contents as the result of the operation

113
Q

store

A

also called destructive store, operation by which content is stored in a cell, overwriting its previous contents.

compsci (1 decks)

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