This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full 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
This note was uploaded on 08/06/2008 for the course IE 495 taught by Professor Linderoth during the Fall '08 term at Lehigh University .
 Fall '08
 Linderoth
 Operations Research

Click to edit the document details