# notes24 - Lecture 1 01/07/08 Basic Idea of the Course...

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

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Lecture 1 01/07/08 Basic Idea of the Course Program = Data Structure + Algorithms Course Content- Analysis tool (big-O)- Stack and Queues- Vectors, List and Sequences- Trees- Priority Queues- Dictionaries- Search Trees- Sorting (Sets)- Selection- Text Processing- Graphs Analysis Tools Data Structure- a data structure is a way of representing and storing data in a computer. Algorithms- transformation of the data structure or transformation of input data into output data. Note: - Our goal when programming is to create the best possible data structure and algorithm to represent the problem. Lecture 2 01/09/08 Math Review 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 Floor[x] = largest integer that belongs to x. Ceiling x = smallest integer >= x. Summations Σ€ f(n) = f(s) + f(s+1)+. . . . .+ f(Z) Geometric Progression Σ€ a i =1 + a + a 2 + . . . . . . + a n = s(a,n) as(a,n) = a + a 2 + . . . . . . + a n+1 as(a,n) - s(a,n) = a + a 2 + . . . . . . + a n+1- 1 - a - a 2- . . . . . . - a- ....
View Full Document

## This note was uploaded on 02/02/2012 for the course CS 251 taught by Professor Staff during the Fall '08 term at Purdue University.

### Page1 / 5

notes24 - Lecture 1 01/07/08 Basic Idea of the Course...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online