Midterm Study Guide 3

2
Compiled vs. Interpreted Language o Analysis of the tools is a lot stronger in compiled so we can write larger programs. o Interpreted (Python, JavaScript) require the language interpreted, a lot more interactive in term of development of the program (make statement, test it, add new line, test it again). Tend to be much slower than compiled, however a lot more powerful for interactive programs. o Java – compiled but compiled to a machine code that is machine independent which is interpreted by JVM. Java program will run on anybody’s JVM. Text Queries vs. QBE (Query By Example) o Text Queries – data base figures out what you want by typing o QBE - giving the database examples by filling out a form that says I want this field, this field, and give examples of what you want. o Practical difference, TQ needs a modest hardware (slow comp.), QBE needs a lot more computing power, more hardware. Relational Databases Self Organizing Lists o Lists where the order of the items changes depending on what it is you are looking for o Goal: The things that you look for commonly migrate to the front of list so you find quickly (Linear, things that don’t have any sorting orders) Swap to Front – swapping front to somewhere, bad Move to Front – move everything to the front, bad Promote 1 Slot – Long time to converge Promote by half or promote by N (however many items) Running Speed of Binary Search Log (2) (N) Running Speed of Sort N Log (2) (N)

description

Yup

Transcript of Midterm Study Guide 3

Page 1: Midterm Study Guide 3

Compiled vs. Interpreted Language o Analysis of the tools is a lot stronger in compiled so we can write larger

programs. o Interpreted (Python, JavaScript) require the language interpreted, a lot

more interactive in term of development of the program (make statement, test it, add new line, test it again). Tend to be much slower than compiled, however a lot more powerful for interactive programs.

o Java – compiled but compiled to a machine code that is machine independent which is interpreted by JVM. Java program will run on anybody’s JVM.

Text Queries vs. QBE (Query By Example) o Text Queries – data base figures out what you want by typingo QBE - giving the database examples by filling out a form that says I want

this field, this field, and give examples of what you want. o Practical difference, TQ needs a modest hardware (slow comp.), QBE

needs a lot more computing power, more hardware. Relational Databases Self Organizing Lists

o Lists where the order of the items changes depending on what it is you are looking for

o Goal: The things that you look for commonly migrate to the front of list so you find quickly (Linear, things that don’t have any sorting orders)

Swap to Front – swapping front to somewhere, bad Move to Front – move everything to the front, bad Promote 1 Slot – Long time to converge Promote by half or promote by N (however many items) Running Speed of Binary Search

Log (2) (N) Running Speed of Sort

N Log (2) (N) Develop an algorithm Hashing HTML

o Give a set of code and have you write the output. Assembler Language

o A language for writing programs where the statements that we write correspond with the programs that a computer can execute.

o C = A + B Compiled or Interpreto C = A + B MOV Ax, A – MOV Bx, B – ADD Ax ,Bx – MOV C, AX

Net Neutrality o If each piece of data, NN = each piece of data travels at the same speed, you can’t

create a fast lane for certain packets to be delivered faster. o You can’t privilege some packets over other packets.

Scratch