Kredit is a social media platform for the university's clubs, allowing them to communicate with their members and organise events. My main work on this project was on the homepage and the admin sides of the application. This involved full stack software development to complete the required features. On the front end, the tasks involved creating mock-ups for the web pages using draw.io, and then turning these mockups into static web pages using HTML and CSS, and Vue.js on the JavaScript side. Once the static web pages were complete, the back-end was developed, which involved implementing a SQL database which was queried using SQLite, and creating a back-end server that recieved requests from the front end, making use of the Express framework. These requests either edited the data in the database or returned the appropriate data back to the user, and security was implemented so that depending on the authenticated user's role, they could only access or edit the data that they required. Finally, the front-end was linked to the back-end to creating a fully functioning, dynamic web-app.

Natural Reflection is a puzzle game made in C++ using SFML Graphics, where a player has to move mirrors around a level to guide a beam of light from its source to an objective. Object oriented principles were emphasised in this project, with every part of the game as an object, and inheritance and polymorphism implemented frequently in the code. I mainly worked on the entity collision and detection parts of the game, making the light detect when it reached the goal and making the player and mirrors collide properly with each other and other entities, as well as working on other features and bugfixes across the game. Additionally, I worked on a lot of the documentation for the project, both within the source code, making sure it was readable with appropriate commenting, and in the planning stage, creating a UML class diagram.

1 / 3

2 / 3

3 / 3

❮ ❯

This project was a game of Tic Tac Toe where the user could choose to play against a variety of bots that ranged from easy to unbeatable! I spend most of my time working on the unbeatable bot, the basis of which was made following this tutorial from TheSharperDev. The bot used a minimax algorithm to choose the move that maximised its success while minimising its opponent's success, however due to efficiency issues, I applied an alpha beta pruning technique to reduce the amount of possible moves the bot had to compute, reducing the time taken for it to make the first move in a game from 1 minute to approximately 2 seconds.