Complete List of Terms and Definitions for CS
| Terms | Definitions |
|---|---|
| Narratio | Background |
| ip= | internet protocol |
| Scheme-Preventing evaluation | Use quote |
| Legacy technology | now obsolete shit |
| Define DNS. | Domain Name System |
| >= | greater than or equal to |
| Literals |
Specify a particular value. They include: • string literals: "Your total in cents is:" • are surrounded by double quotes • numeric literals: 25 3.1416 • commas are not allowed! |
| WWW | Implemented in hosts, servers, and routers at "network edge" "on top of" existing network |
| filter | a process that removes unwanted elements from a collection. |
| common mistake will writing code | capital letters |
|
When implementing quicksort, the first element of an interval is always a good choice for the pivot. |
FALSE |
| constantly moving gel- like mixture inside the cell membrane | cytoplasm |
| Master view | used to set presentation defaults- heading, fonts, footers, logos, etc. |
| pointer | a variable containing the address of other data. |
| pivot | in Quicksort, a "center" value using in partitioning the set to be sorted |
| captcha test? |
- reverse turing test - computer testing for human |
| Contradiction | a proposition that always evaluates to false |
| "While" Statement | While ("a true/false condition") do step i to step j |
|
At runtime, a successful downcast from type A to type B changes the dynamic type of the object from A to B. |
FALSE |
| Hardware | All the physical components that make up a computer. |
| DEAR | drop everything and read (or SSR- sustained silent reading)-fixed time and day-students select materials-read silently |
| The file that the computer understands to run a compiled program (i.e. the .exe) | Executable |
| widget reference | anything that has state capable of representing a widget |
| priority queue | a queue in which the highest-priority elements are removed first; without a priority value, the earliest arrival is removed first |
| Linked List | a sequence of records, where each reqcord contains a link to the next one. |
| Adaptive retransmission | TCP monitors current delay on each connection and adapts the retransmission timer to accommodates changing transmissions |
| Deep Binding | Use the environment from the moment when the function was passed/stored/returned |
| program counter | holds the address of the next instruction to be executed |
|
<var> ++; Equivalent to? (for loop updates) |
<var> = <var> + 1; |
| active fault detection? | periodically checking for symptoms of faults, or trying to anticipate when failures will occur. |
| as we stood on the railway tracks looking off into hte distance, the rails seemed to __________ and meeet at some far off point | converge |
| Fanatical Believers | One that believes that their point of view is correct and refuses to change their view |
| path | aka filename logical name used to ID a location in a file system |
| well-founded ordering | an ordering that can be guaranteed to terminate, e.g. starting at a positive integer and counting down to 0. |
| base case | a simple case that can be solved easily, without recursion. |
| antisymmetric | A relation R on set A is antisymmetric if (x, y) ∈ R and x != y, then (y, x) ∉ R, ∀x, y ∈ A. |
| Order of Magnitude | Anything that varies as a constant times n. |
| Procedural Decomposition |
• In general, methods allow us to decompose a problem into smaller subproblems that are easier to solve. • the resulting code is also easier to understand and maintain. |
| So as long aas we remained indoors, we were ________ to the arctic blasts that swept down our snowbound cabin | invulnerable |
| Domain name server | A service that cross references all of registered Domains/IP adresses |
| internal sort | a sort using only the main memory of the computer |
| Transmission Delay | D/R (amount it takes to get the entire message on the wire) |
| symmetry | with big theta if f(n) is big theta of g(n) then g(n) is big theta of f(n) |
| Syntax Template | Used to describe the basic form of a Java construct. |
| What multiplexing technologies are used with WiFi? | DSSS – Direct Sequence Spread Spectrum – similar to CDMA where a sender multiplies the outgoing data by a seque3nce to form multiple frequencies and the receiver multiplies by the same sequence to decode FHSS – Frequency Hopping Spread Spectrum – a sender uses a sequence of frequencies to transmit data, and a receiver uses the same sequence of freque3ncies to extract data OFDM – Orthogonal Frequency Division Multiplexing – A frequency division multiplexing scheme where the transmission band is divided into many carriers in such a way that the carriers do not interfere |
| Declaration (3 types) | Tell Java which names you plan to use and what types of value or object can be associated with each name1. Instance variable declaration2. Local variable declarations3 Formal parameter declarations |
| Data Types |
• A data type is a set of related data values. examples: • integers • strings • characters • Every data type in Java has a name that we can use to identify it. |
| 1 GB is approximately x bytes | 1,000,000,000 bytes or about 500 pages of text |
| Define CSMA/CD and explain briefly how this protocol works | carrier sense multiple access / collision detection. It is the most widely used protocol (i.e. set of rules) for determining how network devices respond in the event of a collision. |
| Describe the Ethernet frame format and its header. Why are there a minimum and a maximum for the payload? | 14 byte Header 6 byte destination address 6 byte source address 2 byte type 46-1500 byte Payload 4 byte CRC A minimum is defined because if the frame is to short the data may go undetected. A maximum is defined because if the frame is to long it will dominate the transmission medium tying it up and not allowing any thing else to use it until it is done transmitting the frame. |
| Referent (or value or content) of a widget reference | the widget value, if any, that the reference's current state represents |
| CDMA encoding: Show the channel output if the data bits are ( -1, 1), and the chipping code is (1, -1, 1, -1,1, -1, 1, -1). | C = (-1,1) V = (1, -1, 1, -1,1, -1, 1, -1) C xV = ((-1,1),(1,-1),(-1,1),(1,-1),(-1,1),(1,-1),(-1,1),(1,-1)) |
| Addition | P/∴pvq |
| \" | quotation mark |
| 3n is O(2n). | FALSE |
| Garbage | Object outlives its binding |
| subdirectory | a dir. within a dir. |
| Interpreter | Stays around at execution time |
| Configuration Management? | "Unique identification, controlled storage, change control, and status reporting of selected intermediate work products, product components, and products during the life of a system." |
| Polymorphism | A concept that consists of Overloading, Abstract Data Types (method overloading, Object-Oriented Programming (method overriding)Note that overloading is performed by the compiler, while overriding happens at run time as a result of vtable mechanisms put in place by the compiler |
| TCP | Transport Control Protocol- a general purpose transport protocol |
| clock cycles | sum of CPIi x Ii |
| Numerical operators include: |
+ addition - subtraction * multiplication / division % modulus or mod: gives the remainder of a division |
| sumptuous | entailing great expense, as from choice materials, fine work, etc.; costly: |
| buses | collections of wires that carry info in form of electrical signals |
| acyclic | describes a graph with no cycles (circular paths) |
| Cons | in Lisp, the function that constructs a pair of pointers, or basic element of a list structure. 2. to make a cons data structure. 3. a cons data structure. |
| constuctor | specifies the actions to be performed when this program is first started ex:public TouchyButton(){ |
| PGPwho designed it | pretty good privacy- paul zimmerman |
| If/Then/Else | If "a true/false condition" is true then first set of algorithmic operationsElse (or otherwise) second set of algorithmic operations |
|
If class A implements interface I, class B extends A, and class C extends B, then C implements I. |
TRUE |
| Statement |
An executable snippet of code that represents a complete command. Each snippet is terminated by a semicolon. (you put together a method by stringing together statements) |
| Only by paying _________ attention to innumerable deails were the invvestigators able to piece together the cause of the accient | scrupulous |
| Free market |
Your choice who to do business with You have the right not to do business with companies that don't protect you privacy Burden is on the consumer to make the choice |
| search | to look through a data structure until a goal object is found. |
| Circular Queue | a queue implemented within an array, where the first element of the array logically follows the last element. |
| Masters Theorem | a recursive funcion in form of T(n)=aT(n/b)+cn^d T(n) is increasing n=b^k a is a real is less then = to 1 b is an integer is less then 1 c is a r number is less then 1 d is a r number is less then = to 0 f(n)= O(n^d) -> a less b^df(n)= O(n^dlog2n) -> a=b^df(n)= O(n^(logba)) -> a greater b^d |
| Desktop | A computer designed for use by an individual, usually incorporating a graphics display keyboard and a mouse |
| chasm | a deep cut or crack or gap, abyss |
| Methods |
• A method is a collection of instructions that perform some action or computation. • Every Java program must include a method called main. • contains the instructions that will be executed first when the program is run |
| I was confident that after Dad had eaten a good meal, he would be more __ to my request for the use of the car | receptive |
| the smallest unit of a living thing that can perform the functions of life | cell |
| Slide sorter view | shows thumbnails of all slides making it easy to rearrange the order. |
| node | an element in a linked list, tree, or graph, often represented by a data structure. |
| null dereference | a runtime error that occurs when an operation such as a method call is attempted on a null pointer. |
| Descendants | All nodes below a given node in a tree. |
| IP packet | Goes in data field of Ethernet or wireless packetIP version/4/Hdr len/4/Service class/8/Packet Length/16/Packet Number/16/ FragmentNumber/16/TTL/8/Protocol/8/Error Check/16/From Addr/32/To Addr/32/DATA (up to 65516 bytes) |
| Dynamically Scoped | Binding depends on the flow of control run timeMost recent active binding |
| A stack is a FIFO structure and a queue is a LIFO structure. | FALSE |
| Test Plan | Describes the system and the plan to exercise all functions and characteristics |
| A __________ is one used to further specify "true or false" in an expression. | Logical Operator |
| absolute path | a path that begins at the root and includes all successive subdirectories |
| directed acyclic graph | a directed graph with no cycles. Every tree is a DAG, but a DAG may be more general. |
| Equivalent (p ≡ q) | Two propositions p and q are (Logically) Equivalent (p ≡ q) when both evaluate to the same result whenpresented with the same input |
| PCSrc | branch AND zero0 - PC + 41 - branch address |
| Wasnt it rather __ of you to offer the soccer coach advice on your very first day as a candidate forthe team?! | brash |
| Lifetimes of Variables static definitions | lasts from its definition till the program exits |
| weak partial order | A relation R on set A is a (reflexive/weak) partial order if it is reflexive, antisymmetric, and transitive |
| What is the purpose of an URL? | A representation standard that specifies the format and meaning of web page identifiers |
| countably infinite (a.k.a. denumerably infinite) | if the bijective mapping is to either of the sets Z* or Z+ |
| The Multiplication Principle (a.k.a. the Product Rule): | If there are s steps in an activity, with n1 waysof accomplishing the first step, n2 of accomplishing the second, etc., and ns ways of accomplishing thelast step, then there are n1 xn2 x. . . xns ways to complete all s steps. |
| Translate into MIPSA[12] = h + A[8]why? | lw $t0, 32($s3) #temp reg $t0 get A[8], alignment restriction, word = 4add $t0, $s2, $t0 #g= h + A[8]sw $t0,48($s3) |
| What is the difference between a server and a server-class computer? | A server is an appliation that runs in a server-class computer. |