Yasin Barkın Başaran

Company DBMS and Support Ticket Web Module

Designed and implemented a normalized relational company database with constraints, sample data, and SQL triggers and stored procedures for business logic — salary-update logging, department-based employee queries, and similar back-office workflows.

Built a PHP web interface on top of the schema for day-to-day database interaction, then extended it with a MongoDB-backed support ticket module supporting parallel user and admin workflows.

Interactive WebGL Scene and Terrain Renderer

Built an interactive WebGL application with full 3D transformations and switchable perspective / orthographic projection. Added Bezier curve visualization and animation along the curve, plus custom non-photorealistic shading modes (toon and paint) written in GLSL.

Implemented heightmap-based terrain generation — both procedural and image-driven — with real-time UI controls for parameters so the scene can be explored and tweaked live in the browser.

Online Store Web Application

Team-built online store covering the core e-commerce flow: product browsing, cart management, user authentication, checkout and ordering, and role-based operations across customer, admin, and manager views.

Ran the project with real software-engineering practice — sprint-based development, version-control collaboration, and feature work delivered against a structured schedule, not a single-commit final push.

Sorting and Searching Algorithms

Implemented and benchmarked Insertion, Quick, Merge, and Heap sort on a phonebook dataset in C++, with runtime measurements across input sizes to see where each algorithm actually earns its complexity class.

Added Sequential and Binary search on top of the sorted output and evaluated how search performance changes once the data is ordered — the kind of exercise that makes a textbook chapter click.

Search Engine V2

A small document indexing and search engine in C++ that preprocesses text and tracks per-document word frequencies so queries can rank results by relevance, not just presence.

Built twice on purpose — once with a Binary Search Tree and once with a Hash Table — then compared query performance side by side to see where each data structure wins and where it bends under load.

Maze Generation and Pathfinding

Random maze generator for arbitrary M × N grids in C++, paired with a pathfinding routine that walks from entry to exit — stacks and queues doing their unglamorous, essential work.