MY SITE
  • Home
  • Portfolio
  • SIP
  • Degree Objectives
  • About Me
    • Skills
  • Contact

Advancing Computer Science

OBJECTIVE
​ 1 | 2 | 3 | 4 | 5 | 6
Within software solutions describe, implement, and analyze data structure techniques such as lists, trees, hash tables, graphs, along with sorting and searching algorithms. 

Stacks and Queues
Two of probably the most referenced Data Structures Stacks and Queues. This program allows you to create your own linked lists and shows how a stack handles them differently than a Queue (LIFO vs FIFO).
​
  • Data Structure(s): Stacks and Queues
    ​( and technically linked lists )

​Check out the GITHUB here

Hash Tables

Demonstration of the 'Chaining' method of hash tables which allows multiple keys to be assigned to one value. This can be used to store large amounts of data with other like data with better organization. 
​
  • ​Data Structure: Hash Table

​Check out the GITHUB here

DnD Character Generator
This program allows a user to create a character for Dungeons & Dragons 5th Edition Tabletop RPG. When creating a character there are random numbers used to determine their stats and in order to have a better experience they need to first be sorted before they can be applied to the correct characteristic.
This trusty program uses a Sorting algorithm to properly distribute the Character's Stats.
​
  • Algorithm: Sorting

Check out the GITHUB here

Analyzing Sorting Methods
algorithm_analysis.docx
File Size: 25 kb
File Type: docx
Download File

sorting_algorithms.docx
File Size: 14 kb
File Type: docx
Download File

These are a couple of write-ups for how Sorting Algorithms work. 
Algorithm Analysis shows an example of a real function using sort.
Sorting Analysis talks about a few types of Sorting algorithms.
​
  • Describing and Analyzing Sort Methods

Picture
© JOE PARISIA, 2022 | ALL RIGHTS RESERVED
Powered by Create your own unique website with customizable templates.
  • Home
  • Portfolio
  • SIP
  • Degree Objectives
  • About Me
    • Skills
  • Contact