I'm a sophomore student at the University of Wisconsin-La Crosse with a passion for Computer Science. I will be graduating in December of 2024 with a major in Computer Science and a minor in Mathematics. My main interests are in machine learning, data analytics, and software development; this list will continue to grow.
Outside of my academics, I am a part of the Men's Club Volleyball team here at UW-La Crosse, where I am given the opportunity to travel throughout the school year and play the sport I love. In my free time, I love to travel, hangout with my friends and family, and build new projects.
I have been using Java for around two years now. With this language, I have implemented a variety of data structures including Binary Trees, HashTables, a B+ Tree, and many more. Additionally, I have used Java to build projects like a user interface to interact with a SQLite database I built.
I have around one year of experience with Python. I have used python to solve a variety of problems during the competitive programming course at UW-La Crosse. I have also used Python for data analysis and visualization.
I have around one year of experience with SQL (SQLite). I have used SQL to build a variety of complex queries. Also, I build a database that models a variety of volleyball clubs with their teams, coaches, and players.
I have around six months of experience with the C language and Assembly (MIPS). With C and MIPS, I have completed a small amount of projects through UWL coursework that has gotten me very familiar with these language.
I have around one year of experience with HTML, CSS, and JavaScript. In addition to this website, I have completed many projects that have helped me become very familiar with web development.
Throughout the process of building many of my projects, I have utilized Git and GitHub in order to work from different computers. Additionally, I have used version control to work in a team in order to develop different projects.
In this project I implemented a B+ Tree along with its insert method. In this implementation, I used two Java random access file. The first file is used to keep an out of memory copy of each node and its contents. The whole tree is never fully built in memory; the tree is traversed node by node jumping from address to address in the BTree random access file. The other file is a database table. The leaves of the B+ Tree point to addresses in this file which contain the data inserted into the tree.
B+ Tree Github
In this project, Huffman Compression and Decompression was implemented. A huffman tree was build using the character frequencies in the text file that is used as input for the program and a binary heap as a priority queue. Bit manipulation was also used in order to pack bits into a single byte for compression and vise versa for decompression.
Huffman Github
In this project, I build a relational database using SQLite including volleyball clubs, teams within those clubs, coaches leading the teams, and players playing on the team. Additionally, I also built a java gui that uses JDBC to interact with this database. This gui can be used to query and display tuples, update certain tuples, and delete certain tuples from the database.
Database and GUI Github