{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

notes97 - Week 1 Notes for CS251 Goal-You will learn...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Week 1 Notes for CS251- 1/07/02- 1/11/02 Goal -You will learn computer data structures -Introduction to algorithms -You will improve programming skills Program = Data Structures + Algorithms" - Dykstra Content Analysis Tools Stacks and Queues Vectors, Lists, and Sequences Trees Priority Queues Dictionaries Search trees Sorting- Sets, Selection Text Processing Graphs Analysis Tools Data Structure: Representation of a portion of the world inside the computer Algorithm: Transformation of the data structure/ Transformation of input data into output data When programming: -Choose the best data structure to represent the problem -Write algorithms to manipulate data structure Math Review Exponentials: a^(b+c) = a^b * a^c a^(b*c) = (a^b)^c a^b/a^c = a^(b-c) log a b = c <--> a^c = b log b (xy) = log b x + log b y log b (x/y) = log b x - log b y log b (xy) = ylog b x
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Floor[x] = lowest int Cieling = largest int Geometric Progression a^i = 1+ a + a^2 + a^3 + .... + a^n = s(a,n) as(a,n) = a + a^2 + a^3 + .... + a^(n+1) as(a,n) - s(a,n) = a^(n+1) - 1 s(a,n) = (a^(n+1) / (a - 1) Algorithm characteristics (Time) Running Time- how long does the algorithm take?
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}