Added all the legacy code projects I wanted to add to the site

This commit is contained in:
Gregory Campbell
2021-07-09 18:11:33 -04:00
parent 17a8ee2bf3
commit 4449ef5f7b
5 changed files with 89 additions and 2 deletions
+89 -2
View File
@@ -9,7 +9,10 @@ import Skin2 from './assets/skin2.png'
import HSV from './assets/HSV.png'
import EulerCycle from './assets/EulerCycle.png'
import EulerExample from './assets/EulerExample.png'
import Hangman from './assets/Hangman.png'
import KngihtsTour from './assets/KnightsTour.png'
import TextAnalyzer from './assets/TextAnalyzer.png'
import AlgorithmComparison from './assets/AlgorithmComparison.png'
export const Projects = () => (
<div>
@@ -76,6 +79,8 @@ export const Projects = () => (
<h3> <a href="https://github.com/gjcampbell777/euler-checking-algorithm">Euler Checking Algorithm</a> </h3>
<br/>
<p>In a course I took in university we were tasked checking if a graph was Eulerian or not.
Much like the Python Skin Detection assignment this was also an assignment I could still remember
from those days and wanted to re-explore and improve upon.
@@ -83,7 +88,7 @@ export const Projects = () => (
The algorithm checks the initial line of a graph to determine the length of the graph and
uses that information to know how many lines it must go through to gather all the info of the graph.
It will repeat this process until it reaches EOF.
You can check out my code through the script by checking out the repo <a href="https://github.com/gjcampbell777/euler-checking-algorithm">Here</a>.
You can check out my code by checking out the repo <a href="https://github.com/gjcampbell777/euler-checking-algorithm">Here</a>.
</p>
<br/>
@@ -100,6 +105,88 @@ export const Projects = () => (
<br/>
<h3> <a href="https://github.com/gjcampbell777/fortran-hangman">Fortran Hangman</a> </h3>
<br/>
<p>In a legacy programming course I took in university we were tasked with updating a fortran77 hangman program to fortran95
as well as improving upon the code itself.
Much like some of the other projects above this was also an assignment I could still remember
from those days and wanted to re-explore and improve upon.
Run the executable to play a simple game of hangman.
You can even use the makefile I added to generate an executable of the fortran77 version.
You can check out my code for this project <a href="https://github.com/gjcampbell777/fortran-hangman">Here</a>.
</p>
<br/>
<img src={Hangman} alt="Hangman"/>
<p>A very quick game of hangman</p>
<br/>
<h3> <a href="https://github.com/gjcampbell777/ada-knights-tour">Ada Kngihts Tour</a> </h3>
<br/>
<p>In a legacy programming course I took in university we were tasked with creating a program that could solve the knights tour problem using Ada.
Much like some of the other projects above this was also an assignment I could still remember
from those days and wanted to re-explore and improve upon.
Run the executable and follow the prompts to have the program solve the problem for you.
However you should try to not make the chessboard size bigger than 7 if you don't have time to spare.
You can check out my code for this project <a href="https://github.com/gjcampbell777/ada-knights-tour">Here</a>.
</p>
<br/>
<img src={KngihtsTour} alt="KnightsTour"/>
<p>Knights tour output for a 5x5 chessboard starting at position (1,1)</p>
<br/>
<h3> <a href="https://github.com/gjcampbell777/cobol-text-analyzer">Cobol Text Analyzer</a> </h3>
<br/>
<p>In a legacy programming course I took in university we were tasked with improving upon a cobol script that
was full of dated coding practices.
Much like some of the other projects above this was also an assignment I could still remember
from those days and wanted to re-explore and improve upon.
Run the executable and tell it which textfile you wish to have analyzed to see the text stats.
You can even use the makefile I added to generate an executable of the dated script.
However the text file that script takes is hard coded so you will have to change some things around if you want to analyze different text with it.
You can check out my code for this project <a href="https://github.com/gjcampbell777/cobol-text-analyzer">Here</a>.
</p>
<br/>
<img src={TextAnalyzer} alt="TextAnalyzer"/>
<p>Analyzing some text from Star Wars</p>
<br/>
<h3> <a href="https://github.com/gjcampbell777/legacy-algorithm-comparison">Legacy Code Algorithm Comparison</a> </h3>
<br/>
<p>In a legacy programming course I took in university we were tasked with comparing the speeds of C, Fortran and Ada using the KMP search algorithm.
Much like some of the other projects above this was also an assignment I could still remember
from those days and wanted to re-explore and improve upon.
Run the executable of your choice to see the speed of that coding language.
Using the makefile I created generates executables for each programming language.
You can check out my code for this project <a href="https://github.com/gjcampbell777/legacy-algorithm-comparison">Here</a>.
</p>
<br/>
<img src={AlgorithmComparison} alt="AlgorithmComparison"/>
<p>Seeing how quickly C, Fortran and Ada are all able to find "Q" in a block of text</p>
<br/>
<h3> <a href="https://gregorysoup.itch.io">My Many Games</a> </h3>
<br/>
Binary file not shown.

After

Width:  |  Height:  |  Size: 157 KiB

Binary file not shown.

After

Width:  |  Height:  |  Size: 60 KiB

Binary file not shown.

After

Width:  |  Height:  |  Size: 50 KiB

Binary file not shown.

After

Width:  |  Height:  |  Size: 71 KiB