UGProjectFl04

UGProjectFl04 - step-count as well as with the CPU time. Be...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CSE 4081 Analysis of Algorithms Fall 2004 Class Project (this description may be updated) Due: Tuesday, November 2, 2003 Purpose: (1) Write programs for four max-subsequence sum algorithms (naïve algorithm maxSubSum1, improved naïve algorithm maxSubSum2, the recursive algorithm maSumRec, and the linear algorithm maxSubSum4, Chapter 2 in the textbook); (2) Compare the algorithms’ performances on varieties of input data. Write programs for the four algorithms. Do not use any downloaded code or any API/template. Once you successfully write the programs, experiment with them on a variety of data. The objective of your experiment will be to compare the performances of the algorithms with respect to different input size (N). The performance should be measured with both
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: step-count as well as with the CPU time. Be careful to measure the actual algorithms performances and not any peripheral actions like I/O. Grading will be based on the quality of the experimental data analysis and drawing of conclusions. How you organize your experiment and generate data is up to you. Feel free to discuss with me. Your submission will be a hard copy: (1) a report (<7 pages) discussing your experimental results, and an appendix containing (2) the source code(s). Mention the names of the group members and the status of the group (Undergraduate) in the front page of the report. I may ask for demo for everybody or for selected people. If you are interested in using the parallel machine (IBM Beowolf) available at FIT let me know....
View Full Document

Ask a homework question - tutors are online