emiletimothy Goto Github PK

adventofcodesolutions

binary_matrix_solver_ocaml

For my final exam for CS 4 (functional programming) class at Caltech, I programmed a binary matrix solver, as well as constructors, methods, and solvers for the Kanoodle board game.

covid_modeling

cs144_files

Data files for the CS144 (networks, structures, economics) class at Caltecch

cs159

SyntheticDataSet

decision_tree

For my CS-2 (Introduction to datastructures) class at Caltech, Eilleen Zhang (@fanteastick) and I implemented a decision tree ML code using Java.

dynamic-memory-allocator

For my CS24 (Intro to Computing Systems) class at Caltech, I implemented the malloc/realloc/calloc/free calls using explicit free lists which featured constant coalescing and FIFO to optimize on throughput and utility

eigenfaces

Eigenfaces project + data

emiletimothy.github.io

Personal website.

fat16-recovery

For my CS24 (Intro to Computing Systems) class at Caltech, I implemented this code to recover deleted files from the FAT-16 file-handler system.

fourier-code

A fourier code that uses hann analysis to obtain smoothening approximations for various functions.

klotski_ocaml

For my CS 4 (functional programming) class at Caltech, I programmed the Klotski board game (and solver (which used dfs)) in OCaml using functional programming.

lc-ms-data

map_backend

For my CS-2 (Introduction to datastructures) class at Caltech, Annabel Reyna and I implemented a back-end map that obtains shortest routes between various points. The datastructures utilized here are entirely original (array and linked deque, N-gram map, trie map, chaining-hash-dictionary, priority queue, move-to-front dictionary, heap) and the algorithms used include the dfs, djikstra, and topological-k-sort.k

maze_solver

For my CS-2 (Introduction to datastructures) class at Caltech, Christian Zapata-Sanin and I implemented a maze-solver using DFS in java.

meltdown

For my CS24 (Intro to Computing Systems) class at Caltech, I implemented the meltdown attack (a vulnerability against the intel processor) to access the root kernel of an OS without the security patch.

mlx-examples

Examples in the MLX framework

modified-100-prisoners-problem

Simulates the role of the swapper in the modified 100 prisoners problem.

password-recovery-with-threads

For my CS24 (Intro to Computing Systems) class at Caltech, I implemented a method to recover passwords using threads (concurrent programming) which accessed tasks from a FIFO queue and executed them on the Google Compute Engine.

priority_queue_ocaml

For my CS 4 (functional programming) class at Caltech, I implemented a priority queue as well as a Y-combinator to compute factorials and lazy streams.

shellcodeexploit

For my CS24 (Intro to Computing Systems) class at Caltech, I implemented a buffer overflow exploit to obtain arbitrary code access and execution on a remote machine by putting several forms of my password on the server.

speculative_algorithm_dataset

synthesizer

For my CS-2 (Introduction to datastructures) class at Caltech, I implemented a music synthesizer and the Karplus-Strong algorithm using Java.

teenybasiccompiler

For my CS24 (Intro to Computing Systems) class at Caltech, I implemented the asmgen (assembly language generating) tokenization mechanism for a compiler that converted the BASIC language to executable code in assembly language.