I am currently a third year Computer Science Major
at University of California, Santa Cruz
3.51 GPA and a two time Dean's Honors Award Recipient
My relevant courses include: Programming in Python (CSE 20 & 30), Computer Systems and Assembly (CSE 12), Programming in C (CSE 13S),
Abstract Data Structures (CSE 101), Applied Discrete Mathematics (CSE 16),
and Statistics (STAT 131)
This project allows us to solve the Wordle game! It uses a scoring algorithm
which assigns each letter a value based on how often it occurs in five letter words. Based on
these values each word is given a score. The word with the highest score is our next guess! This program is in C.
A hint for the next time you play: the best opener is irate.
BFS and DFS with a Graph ADT
This was built in order to solve the Knight's Tour. In the Knight's Tour, we must find the quickest
path for a knight to go from one end of a chessboard to the other. In order to solve this, we treat the chessboard
as a graph and we use Depth First Search. My project is a Graph ADT in C, complete with Breath and Depth First Search.