Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
63 Cards in this Set
- Front
- Back
|
problem solving techniques (5) |
-google it/ask others -break it down -debugging/isolating the problem -trial and error -divide and conquer |
|
|
definition of an algorithym |
a solution to a problem expressed as a well defined sequence of steps |
|
|
explain universality applied to computers |
program + data + control operates on [program|data] |
|
|
duality |
"this is not a pipe" |
|
|
self reference |
[print this twice|print this twice] careful coordination between program explaining copying and data to describe same program |
|
|
definition of a computer (4) |
a device that: accepts input stores data processes data produces output a computer executes machine instructions |
|
|
hardware components (7) |
CPU, RAM, bus, prefetch, L1 cache, L2 cache, ALU |
|
|
RAM |
random access memory |
|
|
Bus |
communicates w/ram carries data |
|
|
prefetch |
ensures info is being handled correctly eg. eg word processor uses ASCII |
|
|
L1 cache |
between ALU, prefetch, and decode unit |
|
|
L2 cache |
between bus interface and ram |
|
|
processor speed (4) |
system clock bus speed word size architecture |
|
|
CPU |
central processing unit, handles transformations
lithiography - how many transistors max TDP - max heat # cores clock speed L2 cache - speed of cache FSB - front side bus instruction set - word size |
|
|
registers (4) |
every arithmetic operation has 1+ result operands are contained in registers a "black box" of circuits performs the operation result goes into register |
|
|
how are logic functions implemented? |
logic functions are implemented using gates |
|
|
order of operation of logic funtions? |
brackets not and or |
|
|
AND |
|
|
|
OR |
|
|
|
XOR |
|
|
|
how is memory represented? |
as an array [0000|1010] [address|data] data, instructions, other addresses, ect. |
|
|
number systems (4) |
base 10 base 2 base 16 2's compliment |
|
|
3 types of binary representation |
unsigned 2's compliment signed magnitude |
|
|
define recursion |
something that refers to itself recursion: see recursion |
|
|
autological |
words that apply to themselves |
|
|
heterological |
words that do not apply to themselves |
|
|
undecidable problems |
there is no terminate function -things you cant write a program for |
|
|
-base 10 to -base 2 |
take abs value of base 10 convert to base 2 invert each bit add 1
reverse process to go the other way |
|
|
subtraction of binary numbers |
dont subtract, add negative number instead -2's compliment to invert 2nd int add to first int discard leftmost 0/1 past 1 byte |
|
|
undecidable problem |
does it terminate on given data? |
|
|
reduction |
reduce to some known, solvable problem |
|
|
examples of undecidable problems |
tiling problems (can I tile this on an infinite plane?) virus detection (can only test for known) |
|
|
conflict graph |
follows logical rules |
|
|
growth rate examples |
O(n^2) O(2^n) O(n) O(nln(n)) |
|
|
graph definitons (3) |
node - vertex edge - connector degree - number of edges from a node |
|
|
djikstras shortest path |
assigns costs to each node to find shortest path |
|
|
breadth first |
row by row |
|
|
depth first |
reach bottom, move over and bottom |
|
|
examples of class P |
-greatest common divisor -primality -sorting |
|
|
NP examples |
traveling salesperson halting problem foctorization |
|
|
3 steps of AI searching in graphs |
1 formulate goal 2 formulate 3 find path |
|
|
machine learning (3 +2) |
memory, averaging and generalization
-compare to average past cases -large amounts of data |
|
|
accidental vs essential complexity |
accidental - problems that engineers complete essential - problems created by the problem itself |
|
|
software processes (4) |
specification design and implementation validation evolution |
|
|
specification (SE) |
what should it do? |
|
|
design and implementation (SE) |
designs the solutions and produces the source code to meet the specification |
|
|
validation (SE) |
checks that the software produced what the customer wanted |
|
|
evolution (SE) |
changes made to meet user's changing needs |
|
|
software development models (3) |
build and fix waterfall spiral |
|
|
build and fix (SD) |
1st version, fix until customer is happy |
|
|
waterfall (SD) |
analysis, required specifications, design, implement, test, operate and maintain |
|
|
spiral (SD) |
determine objectives, identify & resolve risks, development & test, plan next iteration, repeat |
|
|
what is agile development? |
development method based on feedback and communication |
|
|
test first (SD) |
prepared for all inputs |
|
|
refactoring |
write code for who comes next, not compiler |
|
|
pair programming |
higher quality code, only slightly slower |
|
|
4 affordances of design |
visibility - can i see it? mapping - where am i and where can I go? feedback - what is it doing now/why cant i do that? conceptual model - user model vs design model |
|
|
user interface |
consists of metaphors |
|
|
what is geomatics? |
discipline that deals with geographic or spatially referenced information |
|
|
4 steps of geomatics |
gathering storage analytics delivery |
|
|
applications of geomatics |
remote sensing lidar satellites movement data land cover surveilance |
|
|
crows foot notation |
|
|
|
what do databases consist of? |
multivalued attributes candidate key identifier -selected key to be used as an identifying characteristic |
