I'm a senior at Cal State Fullerton, working on my undergraduate degree.
I finished a half-year internship at Vizuro last year, it was nourishing jurney.
I enjoy tackling new problem that I've never seen, and engage to more unkown, These challenge motivate me to pursuite higher.
A Database that was built on my own B+tree and other data structure, the database can take simeple command and create table of data that suits the requirement. For example "select * from student where age <30 and major=CS or major = Physics and lname = Jackson"
A poorman version of the UNIX command-line utility, the program will take in one or multiple word and output with the sentence that has the word in it.
Another UNIX command-line utility, it simply helps you to find out the differences between two text files with different mode.
A self-balancing binary search tree, it's child subtree will never had a height difference that's more than one.
A data structure that has sets of vertexs and edges between them, and some extra functions like shortest_distance / shortest_path.
These are two different data structure, have them in the same repo just because they are relativly small project. The Heap can change from max to min up to user's request, and hash has three different versions.
A mocking apllicant selecting program, the program process 1,000 applications to pick an admitted list of 30 and a wait list of 6.
A mocking car dealer shop stimulation, the program monitor the sale score of the agent and the customer average wait time and calculate their standard deviation.