HW1 - Computer Science 830: Design and Theory of Algorithms...

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

View Full Document Right Arrow Icon
Computer Science 830: Design and Theory of Algorithms Dr. Charles Ofria Homework #1 Due January 23 rd 2008, 3pm Each of the problems should be solved on a separate sheet of paper to facilitate grading. Limit the solution of each question to one side of a sheet of paper. The numbered problems all come from Introduction to Algorithms, by Cormen, et al . Please do not wait until the last minute to look at the problems. 1. In the directory ~cse830/Public/hw1/ on arctic.cse.msu.edu, there is a collection of six short C language programs and six unidentified executable files, all of whose time complexities are a function of n . Each executable accepts an integer value n as its command line argument. Using the Unix time command, run each of the executables for multiple values of n, and graph the results. Run " man time " for more information on how the time command works. Remember to choose your values of n carefully in order to get a good idea of what these curves really look like. Look at the source code of the C language programs. Match up each executable
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.

This note was uploaded on 07/25/2008 for the course CSE 830 taught by Professor Ofria during the Spring '08 term at Michigan State University.

Page1 / 2

HW1 - Computer Science 830: Design and Theory of Algorithms...

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