Corning Community College
CSCS2330 Discrete Structures
PROJECT: Prime Number Computation (PNC0)
OBJECTIVE
Start exploring algorithm/implementation comparison and optimization with respect to various approaches of computing prime numbers.
TASK
Implement program in Vircon32 C, that:
* the upper bound should be fairly easy to change, even if it requires an edit and recompile.
* display that N/upper bound
tally: display the number of primes identified (2-N)
display the amount of time taken to do the total computation for that value of N, out to 3 decimal places
display each N value and result in an arrangement on the screen that can be clearly identified and read by the viewer
timing should go out, as reasonable, to a few decimal places, and should be consistent across all attempts.
timing is on the computational process only, not the display of results.
create a graph (using some external tool) that plots the performance of the C implementation working on various workloads of this brute force algorithm according to the various N's and the time it took. Share your graph of your results on the class discord and on the project documentation page.
a line graph is the suggested best candidate
this will not be an interactive program: it starts up, does its thing, outputs it results, then halts.
this brute force implementation is meant as our baseline. As such, it should not contain any optimizations or attempted improvements. As we progress through pnc1 and pnc2, this base implementation should be the least efficient. This is important, to allow us to realize the impact of various improvements we will be making in those upcoming projects.
REFERENCE
The following are reference screenshots of what your implementations should approximate.
PNC0
C implementation
EDIT
You will want to go here to edit and fill in the various sections of the document:
SUBMISSION
To be successful in this project, the following criteria (or their equivalent) must be met:
Project must be submit on time, by the deadline.
Executed programs must display in a manner similar to provided output
Processing must be correct based on input given and output requested
Output, if applicable, must be correct based on values input
Code must be nicely and consistently indented
Code must be consistently written, to strive for readability from having a consistent style throughout
Code must be commented
No global variables (without instructor approval), no goto statements, no calling of main()!
Track/version the source code in your lab46 semester repository
Submit a copy of your source code to me using the submit tool by the deadline.
Let's say you have completed work on the project, and are ready to
submit, you would do the following:
lab46:~/src/SEMESTER/DESIG/PROJECT$ submit DESIG PROJECT file1 file2 file3 ... fileN
You should get some sort of confirmation indicating successful submission
if all went according to plan. If not, check for typos and or locational
mismatches.
RUBRIC
I'll be evaluating the project based on the following criteria:
78:pnc0:final tally of results (78/78)
*:pnc0:submitted C implementation and build files, builds cleanly [13/13]
*:pnc0:processing and output is correct, and to specifications [52/52]
*:pnc0:no optimizations or improvements on the process [13/13]
*:pnc0:graph produced from timing data produced [13/13]
*:pnc0:graph posted to discord and documentation page [13/13]
*:pnc0:timing data is the taken out to 3 decimal places [13/13]
Pertaining to the collaborative authoring of project documentation
Additionally
Solutions not abiding by spirit of project will be subject to a 50% overall deduction
Solutions not utilizing descriptive why and how comments will be subject to a 25% overall deduction
Solutions not utilizing indentation to promote scope and clarity or otherwise maintaining consistency in code style and presentation will be subject to a 25% overall deduction
Solutions not organized and easy to read (assume a terminal at least 90 characters wide, 40 characters tall) are subject to a 25% overall deduction