<strong> <br><a href="http://www.unlv.edu/">University of Nevada Las Vegas </a> <br><a href="http://www.egr.unlv.edu/"> Howard R. Hughes College of Engineering </a> <br><a href="http://www.cs.unlv.edu/"> School of Computer Science </a><br> <a href="/larmore/"> My Home Page</a><br> </strong> UNLV CSC 302 Fall 2014 Assignment 1

CS 302 Assignment 1

Due date: Tuesday, January 28, 2014, 10:00 PM in class.

All written assignments must be handwritten (not typed or printed from a computer file) in your own handwriting, on 8.5 by 11 inch paper, or on A4 paper. Write your name on each sheet, and do not fold the pages or crimp the corners. (You may use a paper clip or a staple.)
Turn the pages in to me or to the graduate assistant on the due date.
For each problem that comes from the textbook, I'll give the problem and page number for both the third and fourth edition.

Work
Problem 2.7 on page 64 of the third edition.
Problem 2.7 on page 72 of the fourth edition.
Out of books in the bookstore?
For each of the six code fragments:
  1. Guess the asymptotic complexity of sum, in terms of n.
  2. Run the code on a computer, with a small number of appropriately chosen values of n. (Choosing appropriate values is part of the assignment.)
    You are not required to submit your computer code.
  3. Make a table showing values of sum for each value of n.
  4. Revise (or retain) your guess, based on those outputs.