Nidhin Naijo

Recently graduated Computer Science student at the University of Strathclyde with a strong foundation in software development, problem-solving, and critical thinking. A motivated and adaptable individual with experience in delivering academic and freelance projects, working effectively in teams and agile environments and with a wide knowledge of different development languages and frameworks. Currently exploring areas like AWS and DevOps to broaden my technical skill set. Seeking a graduate opportunity where I can contribute, learn, and continue growing as a software engineer.

The Adimo Scholarship - awarded in recognition of my passion for Computer Science, demonstrated through a personal statement and engagement with the course.

• The Inspiring Digital Enterprise Award - Bronze and Silver
• First Aid at Work - Level 3
• Full UK Driving License

Banking Application
Team Project | Jan 2023 - Mar 2023 | Sponsored by JP Morgan

Tech Stack: Java, PHP, JSON, Jooby

• Developed a functional digital banking application in a team of 4 as part of a JPMorgan sponsored university module, simulating real-world financial software development
• Designed and implemented the user-facing frontend with a focus on responsive layout, clean UI, and intuitive navigation
• Built and integrated key backend endpoints using Java and the Jooby framework to support features like displaying transactions and flagging fraudulent transactions.
• Used Agile workflows with version control, issue tracking, continuous integration, SLDC tooling, and delivering a packaged .jar application through a CI pipeline.
• Handled JSON data from an API to a backend service developed in PHP to enable interactions.

Simple Shell for Linux

Team Project | Jan 2023 - Mar 2023 

Tech Stack: C, Linux (Ubuntu), POSIX

• Built a fully functional Unix-style shell in C with support for executing external system programs, managing directories and implementing custom commands
• Developed core components including:
• Command parsing & execution using fork() and wait() for handling child processes.
• Built-in commands such as cd, getpath, history, and alias with input handling
• Command history and alias invocation with loop prevention, saving and loading from hidden files.
• Ensured stability and error handling
• Demonstrated the project in Ubuntu, receiving exceptional marks for functionality and code quality

GeoNoir (Final Year Project)

Individual Project | Oct 2024 - Apr 2025

Tech Stack: TypeScript, JavaScript, React, Next.js, Vercel (Deployment), Git, OpenStreetMap, Overpass API

• Developed a browser-based detective game that procedurally generates mystery cases in UK cities using OpenStreetMap data via the Overpass API.
• Designed and built a responsive noir-themed interface using React and Tailwind CSS, with dynamic clue generation and adjustable difficulty levels.
• Integrated Leaflet.js to render interactive geospatial maps and handle user navigation, interaction, and clue-based progression
• Applied modular, component-based architecture and local storage to manage gameplay state, difficulty and timers across sessions
• Deployed the application using Vercel and conducted user evaluation to validate functionality, performance and replayability. Received a distinction for my project

AI Search Algorithms & Performance Analysis

Individual Coursework | Spring 2023

Tech Stack: Python, Anaconda, Matplotlib, NumPy

• Implemented and compared classic AI algorithms including A*, Minimax with alpha-beta pruning, and Monte Carlo Tree Search to solve decision-making and pathfinding problems.
• Built simulation environments and applied each algorithm to equivalent problem sets to evaluate efficiency, accuracy, and computational cost.
• Visualized performance metrics using Matplotlib charts and analyzed trade-offs in execution time, optimality, and scalability.
• Developed modular, testable Python code using virtual environments in Anaconda, with reproducibility across machines.
• Produced a comprehensive report comparing algorithms across use cases and identifying ideal conditions for each method's success.