EElab4 - EE 1301 Introduction to Computing Systems UMN...

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

View Full Document Right Arrow Icon
EE 1301 UMN Introduction to Computing Systems Spring 2010 Lab # 4 Due Tue. Mar. 2, 2010, at 1:00pm Collaboration is encouraged. You may discuss the problems with other students, but you must write up your own solutions , including all your C programs, by yourself. If you submit identical or nearly identical solutions to someone else, this will be considered a violation of the code on academic honesty. In this lab, we’ll study the run-time complexity of programs . The run-time complexity is a measure of how long it takes a program to execute. It is independent of the machine that the program is actually running on. (Wait until next year and the new PC that you’ll get will likely run twice as fast as the old clunker that you have this year.) It doesn’t measure the actual time. Rather, run-time complexity refers to the number of steps in an algorithm or program. To characterize this, we could track and count every statement (so every line in a C program that’s terminated by a semicolon). We would have to include conditional statements (so count every time the conditional part of an if , else or while statement is executed). But this isn’t always a well-defined task. What about library functions such as
Background image of page 1

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

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

Page1 / 3

EElab4 - EE 1301 Introduction to Computing Systems UMN...

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

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