Lecture3

Lecture3 - IE 495 Lecture 3 Septermber 5, 2000 Reading for...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: IE 495 Lecture 3 Septermber 5, 2000 Reading for this lecture Primary Miller and Boxer, Chapter 1 Aho, Hopcroft, and Ullman, Chapter 1 Secondary Parberry, Chapters 3 and 4 Cosnard and Trystram, Chapter 5 Chaudhuri, Chapters 2 and 3 Models of Computation Analysis of Algorithms We are interested in the time and space needed to perform an algorithm. There are several ways of approaching this analysis. Worst case Average case Best case Worst case is the most common type of analysis (why?). Generally speaking, time is the most constraining resource. Random Access Machine Model Program Location Counter R R 2 R 1 R 3 Memory Output Input Accumulator A RAM Program At each time step, one elementary operation is completed. Sample list of elementary operations- LOAD- STORE- ADD- SUB- MULT- DIV- READ- WRITE- JUMP- JGTZ- JZERO- HALT Assumptions of the RAM model The program is not stored in memory and hence cannot be modified. The problem is small enough to fit in the memory. Any size integer is allowed. Fundamental operations can be performed in one unit of time. Any memory location can be accessed in one unit of time....
View Full Document

Page1 / 21

Lecture3 - IE 495 Lecture 3 Septermber 5, 2000 Reading for...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online