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
- Spring '12
- Algorithms, Analysis of algorithms, Computational complexity theory, Computer program, naïve algorithm maxSubSum1