As part of my minor in Computer Science, I've worked on several projects for both coursework and personal use.
A basic implementation of a search engine using hash tables. The program is a search engine for documents, which first indexes all txt files in a specified directory, then returns the files most relevant to a specified query.
A basic lossless data compression algorithm implementation using frequency-sorting binary trees. This implementation allows for compressing and uncompressing text files.
Evaluating arithmetic expressions using Stacks, converting Infix and Prefix expressions to Postfix, then evaluating the postfix expression using a stack implementation.