Smart Fridge

Smart Refrigerator System

I created a database system together with Patrick Langis to monitor the contents of a refrigerator using PostgreSQL. Our database respected all required normal forms. We used Python and the flask framework for the back-end and we edited a bootstrap template for the front-end using HTML and CSS.

Download the source code on Github.

• Date: January 2017 - Present
• Client: CSI 2132
• Category: Databse System

Cook Helper Application

Munchies: What do you have in your fridge?

The Munchies App was created by Eyob Tilaye, Wilson Ly, and Felix Singerman. Munchies was built using Android Studio.
Munchies selects and displays recipes that contain ingredients you already have. Munchies obtained results according to relevance (ingredients and category, or type of food).

• Date: September 2016 - December 2016
• Client: SEG 2105
• Category: Android Application -- Software Engineering

Circle the Dot game

Built in Java

Eyob Tilaye and I designed our own version of the popular Circle the Dot game. We implemented the model-view-controller design pattern. We designed the application utilizing event-driven programming. We used a Breadth-First Search algorithm in order to find the shortest path. Similar examples of the game can be found here.

• Date: January 2016 - April 2016
• Client: ITI 1121
• Category: Model-View-Controllor Java Game

My Personal Website

My Website

I created this website as a personal project. I hope you enjoy my portfolio!

• Date: April 2017 - Present
• Client: Myself
• Category: Personal Website

Canadian Disasters Analysis and Prediction Data Science Project

Python, R, SQL, Tableau & WEKA

• Designed and built a DataMart using PostgreSQL respecting the Star Schema.


• Data Staging: wrote a Python script using Pandas in order to gather and clean the data


• Designed and wrote several OLAP Queries to gain insight on the data


• Data Visualization was performed using Tableau


• Data Mining: Ran Machine Learning algorithms in WEKA on the data in order to predict the cost of future disasters. Wrote an R script to further mine the data and find statistical outliers.

• Date: January 2018 - May 2018
• Client: CSI 4142
• Category: Data Science

Microblog Information Retrieval (IR) System

Java, Lucene

I Implemented an IR system using Lucene for a collection of Twitter messages. Implemented preprocessing functions for tokenization and stop word removal. Built an inverted index, with an entry for each word in the vocabulary. The searcher uses a Levenshtein distance metric with an n-gram overlap and TF-IDF scoring. I Received the best mean average precision & recall scores in the class

• Date: January 2018 - May 2018
• Client: CSI 4107
• Category: Information Retrieval

Huffman Coding Algorithm

Data Structures and Algorithms

My attempt at the Huffman coding algorithm (both encoding and decoding).
Huffman encoding is a compression technique that reduces the number of bits needed to store a message based on the idea that more frequent letters should have a shorter bit representation and less frequent ones should have a longer bit representation. Text compression is useful when we wish to reduce bandwidth for digital communications, so as to minimize the time required to transmit a text. Text compression is also used to store large documents more efficiently, for instance allowing your hard drive to contain as many documents as possible.
For example the message: AACGTAAATAATGAAC that has 16 letters can be encoded with 32 bits as 00000110110000001100001110000001 Huffman encoding would instead choose a variable length code to take advantage of difference in letter frequencies. With Huffman encoding the same message can be encoded with 27 bits (saving 15% space) 110100110011100110001111010

For more information on how Huffman Coding works please see this video.

• Date: September 2016 - December 2016
• Client: CSI2110
• Category: Huffman Coding
• Goals: Practice implementing tree-based data structures. Practice analyzing different alternative implementations for auxiliary data structures (priority queues). Appreciation of how data structures can be used for practical purposes.