haas:spring2024:comporg:projects:pnc0
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| haas:spring2024:comporg:projects:pnc0 [2024/03/13 13:20] – [TASK] wedge | haas:spring2024:comporg:projects:pnc0 [2024/04/10 21:09] (current) – external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 14: | Line 14: | ||
| * performs a brute force/" | * performs a brute force/" | ||
| * the values for N are some sufficient quantity still small enough to fit within an integer | * the values for N are some sufficient quantity still small enough to fit within an integer | ||
| - | * the values for N will have some relationship (powers of 2, powers of 10/ | + | * the values for N will have some relationship (powers of 2, powers of 10/ |
| * the values for N have some sufficient quantity large enough where its upper set values will take some amount of time to compute (fast enough to have some relatable value, not to exceed 16 seconds) | * the values for N have some sufficient quantity large enough where its upper set values will take some amount of time to compute (fast enough to have some relatable value, not to exceed 16 seconds) | ||
| * for each value of N: | * for each value of N: | ||
| - | | + | |
| - | * display the amount of time taken to do the total computation for that value of N | + | * tally: |
| + | * 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 | * 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, | + | * timing should go out, as reasonable, to a few decimal places, |
| * timing is on the computational process only, not the display of results. | * 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 and assembly implementations working on identical 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. | * create a graph (using some external tool) that plots the performance of the C and assembly implementations working on identical 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. | ||
| Line 36: | Line 37: | ||
| {{: | {{: | ||
| - | |||
| - | ====PNC1==== | ||
| - | |||
| - | ===C implementation=== | ||
| - | {{: | ||
| =====EDIT===== | =====EDIT===== | ||
| You will want to go [[/ | You will want to go [[/ | ||
| Line 91: | Line 87: | ||
| *: | *: | ||
| *: | *: | ||
| - | *: | + | *: |
| </ | </ | ||
haas/spring2024/comporg/projects/pnc0.1710336011.txt.gz · Last modified: 2024/03/13 13:20 by wedge
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
