QAIS // COMPUTER SCIENCE

HELLO,
I'M QAIS

CS at Concordia. BJJ off-screen.

I'm a computer science student in Montréal. My projects include a French vocabulary trainer in Python and a route planner in Java. Here's a look at the code and what each project does.

A small portfolio with an arcade look.

Hey! Thanks for stopping by.
NAME: QAIS
BASED IN: MONTRÉAL
STUDYING: COMPUTER SCIENCE
OFF-SCREEN: BJJ

01 / ABOUT ME

A SHORT INTRO

▸ STUDYING & BUILDING

I'M QAIS.

I'm Qais Alasmar, a computer science student at Concordia University, expecting to graduate in December 2027. I'm interested in software engineering, machine learning, and the decisions that go into a working application.

Adaptive French brings together vocabulary practice, review history, and a recall model. Dijkstra Route Planner takes a graph algorithm and puts it behind an interactive map. The repositories below include the code, setup instructions, and limitations.

At Lava Group, I built a repair-tracking system with Node.js, Express, and MySQL, including SMS updates through Twilio. I also co-founded Unravel and worked with a three-person team on product definition and early prototypes.

Outside of programming, I train and compete in Brazilian jiu-jitsu. The gi character is a small nod to that.

▸ AT A GLANCE

STUDY
Bachelor of Computer Science · Concordia University
Expected December 2027
PROJECTS
Vocabulary practice & route planning
BASED
Montréal, Québec
LANGUAGES
English, Arabic · Learning French
PYTHONJAVAGRAPHSBJJ

02 / PROJECTS

CODE YOU CAN READ & RUN

Two projects, with different problems to work through. Each repository has instructions for running it locally.

01 // VOCABULARY PRACTICE

ADAPTIVE FRENCH

A Python command-line trainer that logs answers and response times, then schedules vocabulary reviews. It also includes an optional logistic regression model for exploring recall prediction.

The model is experimental; improved retention hasn't been demonstrated.

PYTHON · CSV · LOGISTIC REGRESSION
↗ VIEW REPOSITORY
02 // GRAPH ALGORITHMS

DIJKSTRA ROUTE PLANNER

A Java application that uses Dijkstra's algorithm to find routes through a weighted graph. A Swing map shows the selected path; a command-line interface runs the same routing logic.

The map and risk scores are fictional demonstration data.

JAVA · SWING · WEIGHTED GRAPHS
↗ VIEW REPOSITORY
SOURCE // GITHUB

READ THE CODE

Prefer to start with the source? My GitHub profile links to these projects. Open a repository to see how it's organized, read the README, or try it on your own machine.

SOURCE · SETUP · PROJECT NOTES
↗ OPEN GITHUB

03 / TOOLS & TOPICS

FROM THE PROJECTS ABOVE

These are the languages and concepts used in the two featured projects.

PYTHON

QUIZ LOGIC & REVIEW HISTORY

JAVA

ROUTING & SWING INTERFACE

MACHINE LEARNING

EXPERIMENTAL RECALL MODEL

GRAPH ALGORITHMS

DIJKSTRA & WEIGHTED EDGES

04 / FIND ME

EMAIL, LINKS & CV
qais@portfolio:~$ whoami
Qais. Computer science student at Concordia.
qais@portfolio:~$ contact

Have a question about a project or want to discuss a role? You can reach me by email or on LinkedIn.