Assignment 1 -- Due Thursday, September 12
at the beginning of lab
CS 5521 Fall Semester, 2013
Topics: Algorithms, Growth of Functions
This is a non-programming assignment made up of exercises from the
text. Some of the problems call for algorithms. Use the same
pseudocode conventions described in class and in the text. Some of
the problems call for answers for which I want you to supply a
supporting argument. These are noted below. Be sure to make your
pseudocode and arguments clear and complete.
- (2 points) Exercise 1.2-3, page 14.
Before solving this problem, record your first guess for discussion
in class. In your writeup, show how you arrived at your final answer.
- (8 points) Problem 1-1, pages 14-15.
Just show the answers for the first (1 second) column.
Hint: use exponential notation for the answer for lg(n).
- (5 points) Exercise 2.3-2, page 37. (The "standard" way does not use
- (5 points) Exercise 2.3-5, page 39. Your argument for the running time of
Binary Search can be informal.
Page URL: http://www.d.umn.edu
Page Author: Doug Dunham
Last Modified: Thursday, 03-Oct-2013 16:18:24 CDT
Comments to: firstname.lastname@example.org