Computer Science 501
Data Stuctures and Algorithm Analysis
Fall 2013, The College of Saint Rose
Lecture 4: Analysis Details
Date: Wednesday, September 18, 2013
Agenda
- Announcements
- Programming Project 1: Timing Java [HTML] [PDF] continues
- Lab 2 recap
- Lecture 3 assignment recap
- Lab 3: Analysis [HTML] [PDF] out
- Basic efficiency classes
- Analyzing non-recursive algorithms
- Empirical analysis
Lecture 4 Assignment
Due at the start of class, Wednesday, September 25.
Please submit answers to these questions
in Submission
Box under "LA4" by the start of our next
class. We will discuss these questions at the start of class, so no
late submissions are accepted. Please be sure that your name is
clearly indicated in all submissions.
- Bailey Problem 5.6, p. 112-3 (3 points)
- Bailey Problem 5.14, p. 113 (3 points)
- For each of the following, indicate a natural size metric and
the basic operation: (3 points total)
- computing the product of n numbers
- computing n!
- finding the largest element in an array
Examples