{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

notes99

notes99 - Week1Lecture Content Analysistool(bigO...

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

Week 1 Lecture 1 01/07/2002   Content - Analysis tool (big-O) - Stack and Queues - Vectors, List and Sequences - Trees - Priority Queues - Dictionaries - Search Trees - Sorting (Sets) - Selection - Text Processing - Graphs   #include <assert.h>   assert(i)=0 & I  a[i]=1;   If compiled with CC – DNDEBUG prog.c, assertions are disabled.     Analysis Tools   Data structures: 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 problem - write algorithm to manipulate data structure.

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

View Full Document
Week 1 Lecture 2            01/09/2002   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 (x y )=ylog b x     Floor  x  = the largest integer   x Ceiling  x  = the smallest integer   x   e.g. floor  1.5  = 1       ceiling  1.1  = 2   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 n   as(a,n) – s(a,n) = a n+1  – 1 s(a,n) = (a n+1  – 1)/(a – 1)   Arithmetic Progression
Σ  i = 1 + 2 + 3 + … … … + n = (n 2  + n)/2

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.

{[ snackBarMessage ]}

Page1 / 10

notes99 - Week1Lecture Content Analysistool(bigO...

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

View Full Document
Ask a homework question - tutors are online