| Terms |
Definitions |
|
Lookup
|
resolvefetchread
|
|
Theta(nsquared)
|
Selection Sort
|
|
MemRead
|
into data memorydeassert-noneassert-Data memory contents designated by the address input are put on the Read data output
|
|
boolean
|
variable to measure true/false
|
|
Fanatical Skeptics
|
One that accepts nothing
|
|
Free (a.k.a. Unbound) variables
|
Unquantified variables
|
|
Declaring a Variable
|
• syntax:
<type> <name>;
• Java requires that we specify the type of a variable before
attempting to use it.
• A variable declaration can also include more than one
variable of the same type:
int quarters, dimes;
|
|
Packets
|
Transmission layer breaks up our messages into smaller "packets". Each packet is then addressed and and transmitted. when all of the packets are received at their final destination, the transmission layer reassembles these "packets" according to the protocol used by the sender. A transmission layer is applied to each packet including: where it came from, where its going, total number of packets in the full message, size of this packet, protocol type-verification checks.
|
|
LIFO
|
last-in, first out: describes the order of a stack.
|
|
XSL vs XML
|
XSL interprets XML file
|
|
With Data Validation, the _________ message serves as a reminder message and will display when the cell is selected
|
Input
|
|
______________ Level of importance of operations
|
Precedence
|
|
Overloading
|
multiple functions can have the same name provided that they have distinct signatures (sequences of argument types)
|
|
taxonomy
|
a classification of objects into a tree structure that groups related objects.
|
|
bijective
|
describes a relation that is both injective and surjective (one-to-one and onto)
|
|
Root?
leaf?
parent?
|
no links to it
no links going out
stems to two children
|
|
Ambiguous Grammar
|
One string has multiple parse trees
|
|
Input
|
Submits to the computing agent data values from the outside world that it may then use in later instructions.Get values for "variable," "variable," . . .
|
|
A non-abstract subclass of an abstract class C must provide definitions
for all the abstract methods of C.
|
TRUE
|
|
<var> -= <expr>;
Equivalent to?
(for loop updates)
|
<var> = <var> – (<expr>);
|
|
sequential search
|
simplest, target is compared with every number until found or end of list is reached, does not have to be in order, only option for unsorted lists
|
|
Define analog signal:
|
characterized by a continuous mathematical signal - (Sine wave), when an input changes from one value to the next, it does so by moving through all possible immediate values.
|
|
root directory
|
directory at highest level from which all other branches descend
|
|
greedy algorithm
|
an algorithm that always tries the solution path that appears to be the best
|
|
Random Access
|
describes a data structure or device in which all accesses have the same cost, O(1)
|
|
SYN segment
|
describes messages in in three way handshake used to create a connection
|
|
advantage of using a table
|
neatness, data entry, simple
|
|
Data Transfer
|
move information between of within the different components of the computer
|
|
Operating System
|
The primary piece of software running on a computer.
Provides an environment in which many programs may be run at the same time. Also provides a bridge between those programs, the hardware, and the user.
|
|
trade book
|
a library book- popular fiction or nonfiction paperback for children and adolescents intended for independent reading rather than direction instruction
|
|
The teacher decided to ____ a corner classroom for an exhibition of student science projects
|
allocate
|
|
Negative Rights
|
Right to be left alone; freedom from interference. Usually absolute
EX: Free speech
|
|
input/output devices
|
allow the user to communicate with the computer by entering commands and then viewing the results.
|
|
shortest path
|
the shortest path between a start node and a goal node in a weighted graph
|
|
descendants
|
all nodes below a given node in a tree.
|
|
pre-Order
|
an order of processing a tree in which the parent node is processed before its children.
|
|
Valid argument
|
Any deductive argument of the form (p1 ^ p2 ^ . . . ^ pn) → q is Valid if the conclusion must follow from the hypotheses
|
|
Loop Body
|
The block of operations executed in a "while" statement while the continuation condition is satisfied.
|
|
method call
|
• General syntax for a static method call:
<method-name>();
example:
writeE();
• Calling a method causes the statements inside the method
to be executed
|
|
I knew the dan woudl accept my apology when she caharacterised my behavier thoughtless but ___________
|
supercilious
|
|
DRAM (Dynamic Ram)
|
The type of memory that is constantly refreshed or it will lose its contents
|
|
adjacency matrix
|
a representation of a graph in which a boolean matrix contains a 1 at position (i, j) iff there is an arc from node i to node j.
|
|
Ex of parameter declaration
|
the JButton which in public void buttonClicked(JButton which) {
|
|
Dynamic Stack Allocation
|
Objects are allocated on a stack and bindings are made when entering a subroutine
|
|
Class vis-a-vis objects
|
Every object is an instance of a class, and the
class describes the properties (data and
behaviors) the object will have.
|
|
How does TCP handle packet loss?
|
retransmission if no acknowledgement was received
|
|
carrier sense multiple access with collision detection (CSMA/CD)
|
Transmissions initiated by a station defer to any which may already be in progress. Once started, if interference with other packets is detected, atransmission is aborted and rescheduled by its source station. After a certain period of interference-free transmission,a packet is heard by all stations and will run to completion without interference. Ethernet controllers in colliding stations each generate random retransmission intervals to avoid repeated collisions. The mean of a packet's retransmission intervals is adjusted as a function of collision history to keep Ether utilization nearthe optimum with changing network load.
|
|
Flow of Control
|
• A program's flow of control is the order in which its
statements are executed.
• By default, the flow of control:
• is sequential
• begins with the first statement in the main method
• When we call a method, the flow of control jumps to the method.
• After the method completes, the flow of control jumps back
to the point where the method call was made.
|
|
what kinds of algorithms are infeasable?
|
algorithms that take into account all possibilities
|
|
What is the purpose of HTTP?
|
HyperText Transfer Protocol (HTTP): A transfer protocol that specifies how a browser interacts with a web server to transfer data
|
|
What is NAT? Explain how it works.
|
Network Address Translation Nat runs as an in-line service, which means that NAT must be placed on the connection between the Internet and a site. The technology provides transparent communication in the sense that a hold at the site appears to have a normal Internet connection, and a host in the Internet always appears to receive communication from single computer rather than from one of many computers at the site. That is, hosts at the site run conventional TCP/IP software and applications, and communicate across the Internet as usual.
|
|
How IP can simplify the task of constructing client programs
|
our program will send and receive all of its messages in IP to the software that translates it into either Ethernet or wireless
|
|
How do you convert dB into a signal to noise ration?
|
i.e. 30dB = 30/10 = 3 so the signal to noise ration is 10^3 or 1000
|
|
literals
|
"cortland.cs.williams.edu"300
|
|
terabyte
|
2^40 bits
|
|
log(10n) is O(log(2n)).
|
TRUE
|
|
Division
|
quotient(q) dividend(n) divisor(s) remainder(r)
n=sxq+r
where 00
|
|
IPP
|
Internet presence provider- virtual real estate landlord- Stores our html files, mail, etc.
|
|
Terminals
|
A finite set of symbols
|
|
widget lvalue
|
any widget&-valued expression (an expression that denotes a variable)
|
|
software
|
collection of programs tht instruct comp what to do
|
|
display video from youtube
|
href=url of video
|
|
Memory
|
Stores programs that are being accessed, along with their data.
|
|
How many TCP/IP layers are there?
|
5
|
|
programmability
|
the ability to give a general-purpose computer instructions so it can perform new tasks
|
|
AVL Tree
|
a self-balancing sorted binary tree, in which the heights of subtrees differ by at most 1.
|
|
Encapsilation
|
putting one packet inside the data field of another packet of a different format
|
|
Logically-controlled loops
|
executed until soom boolean condition changes.
|
|
Output
|
Sends results from the computing agent to the outside world.Print the values of "variable," variable," . . .
|
|
<var> %= <expr>;
Equivalent to?
(for loop updates)
|
<var> = <var> % (<expr>);
|
|
Who would have dreamed that the cluttered old attic, with all its darkness dushkm abd ____________ odor contained such a treasure
|
musty
|
|
Normalization Model
|
Rich user adopt first and everyone follows over time
|
|
grammar
|
a formal description of a language in terms of vocab and rules for writing phrases and sentences.
|
|
operator
|
in a search tree, a program that changes a state into a child state, e.g. a move in a game.
|
|
garbage collection
|
the process of collecting garbage for recycling.
|
|
what indexOf will spit out if addr1 which is tom@cortland.edu addr1.indexOf( d, 12);
|
14
|
|
first spreadsheet, who designed it
|
visicalc- birklin and frankston
|
|
Fetch Phase
|
the control unit gets the next instruction from memory and moves it into the information register
|
|
Java’s Integer Types
|
Java’s actually has four primitive types for integers, all of which represent signed integers:
byte (8 bits), short (16 bits), int (32 bits), and long (64 bits).
• We typically use int, unless there’s a good reason not to.
|
|
cell
|
data type in matlab that holds an address, designated by curly braces, no arithmetic or relational operations
|
|
How cna you say that the audience's reaction was ___ when the director held up a sign saying applause
|
spontaneous
|
|
Relative link
|
addresses the link to a file path/name which is relative to your current file path. oftentimes when the image is not displayed, a relative URL has been used but the desired file does not reside in the directory path of the referencing computer.
|
|
scope
|
the area of program text over which a variable can be referenced.
|
|
fold
|
to process a set of items using a specified function; another term for reduce
|
|
Statements (4 types)
|
Tell Java to perfrom a particular action, commands1. mutator method invocations2. assignments3. Compound statements4. if statements
|
|
Fibonacci sequence
|
The nth term of the Fibonacci sequence is the sum of terms n−1 and n−2, where F(0) = 0 and F(1) = 1
|
|
Scheduler
|
keeps a list of programs ready to run on the processor, selects the one that will execute next
|
|
Graphics Window
|
A collection of pixels on the screen which we can
turn on/off/change colors to create images.
|
|
An error that occurs at run time (e.g., incorrect output)
|
Semantic Error
|
|
Minimum Scope Principle
|
varibles should be created as late as possible, and into the innermost scope as possible
|
|
simple path
|
a path between two nodes in a graph that does not revisit any intermediate node
|
|
translation after/for receiving packet
|
In hardware, there will be wireless and Ethernet transmission/wireless then there will be software that translate both forms to IP and then can untranslate IP into the other format
|
|
jon von neumann's contributions
|
storing program on a computer along with its data
|
|
what is mutual suspicion
|
assuming that other modules may have faults
|
|
DDR SDRAM (Double data rate synchronous dynamic RAM)
|
Works twice as fast as SDRAM
|
|
Predicate (a.k.a. Propositional Function)
|
A statement that includes one or more variables and will evaluate to either true or false when the variablesare assigned values
|
|
What is attenuation?
|
As a signal passes across a medium it gets weaker
|
|
How DHCP assigns address
|
if it is important to limit access to authorized users than a list of hardware addresses and IP addresses can be set up so that a when the DHCP server recieves a hardware address they just look at the list. If you don't have to limit access the server can just assign any number not in use. To ensure this number is not in use it put it in a list for a time limit called lease. Once the lease is up, the server sends a message to the machine saying that it must renew its IP address. When the machine leaves the network, once the lease is up the number will be usable once again
|
|
Domain of Discourse(a.k.a. Universe of Discourse)
|
The collection of values from which a variable’s value is drawn is known as the
|
|
wording for conditional proposition
|
if p then q p only if q q unless ~p
|
|
Descibe the concept of modulation with two inputs
|
the two inputs are: a carrier and a signal are needed, first it generates a modulated carrier as output; then a sender must change one of the fundemental characteristics of the wave
|
