{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

L02 - CSE310 Lecture02 The Computing Model and Asymptotic...

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

View Full Document Right Arrow Icon
[email protected] CSE310 Lecture02: CSE310 Lecture02: The Computing Model and Asymptotic Notations The Computing Model and Asymptotic Notations Guoliang (Larry) Xue Department of CSE Arizona State University http://optimization.asu.edu/~xue
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
[email protected] 2 Topics of this lecture Topics of this lecture The RAM constant access of memory constant time for basic operations Counting and Four Important Summations Big Oh, Big Omega, Theta Notations definitions examples properties
Background image of page 2
[email protected] 3 RAM: Random Access Machine RAM: Random Access Machine RAM stands for R andom A ccess M achine , which is a very useful model of computation. basic instruction can be performed in one unit of time. running time is equivalent to the number of operations required. We will study function f(n) that is asymptotically positive, i.e., f(n)>0 for n large enough.
Background image of page 3

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

View Full Document Right Arrow Icon
[email protected] Counting Techniques and Proof by Induction Counting Techniques and Proof by Induction 1+2+3+4+...+n=?
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}