Computer Science Student • Systems & Backend Developer
Amman, Jordan
Systems and backend developer with hands-on experience building Unix shells, HTTP servers, and concurrent simulations in C/C++ at 42 Amman, alongside enterprise desktop applications in C#/.NET. CS student at Hashemite University, 22/24 projects into the 42 Common Core.
Software Engineering Cadet / Peer Developer
Structured, deadline-driven software engineering program (22/24 Common Core projects complete) focused on pure C/C++, POSIX APIs, multithreading, and concurrent architectures. Conducted 50+ technical evaluations and collaborated in pair-programming teams (minishell, mini_rt).
Bachelor of Science in Computer Science
Core coursework in algorithms, data structures, computer networks, and operating systems.
Engineered a race-free simulation of Dijkstra's Dining Philosophers using pthreads and mutex locks; built async monitoring routines with microsecond-precision timers preventing thread starvation and deadlocks.
Building a non-blocking HTTP/1.1 server using epoll I/O multiplexing, with stateful request parsing, NGINX-style config parsing, and CGI execution.
Architected a multi-container infrastructure with Docker Compose on Alpine Linux; isolated containers for NGINX (TLS/SSL), WordPress, and MariaDB with bind mounts and internal bridge networking.
Implemented a POSIX-compliant shell with an AST parser enforcing operator precedence, nested subshell forks, and quote-aware tokenization; zero leaks via Valgrind.
Engineered a Unix pipeline engine replicating shell redirection (< file1 cmd1 | cmd2 > file2) using fork, pipe, dup2, and execve; implemented POSIX process synchronization, multi-fd stream redirection, and PATH resolution.
Built a terminal-based banking and ATM system in C++ with bitmask user permissions, transaction audit logging, and file-based persistence.
Developed a 3-tier desktop application separating UI, business logic, and data access layers; used parameterized T-SQL queries to prevent SQL injection.
Built a dual-stack radix sort on array stacks with coordinate compression, bounding passes to log2(N); added lookahead bit-checking in Stack B to cut redundant transfers, with dedicated solvers for N ≤ 5.
The centralized directory for all 42 common core curriculum projects, including Unix shells (minishell), raytracers (mini_rt), and C++ modules 00–09 (22/24 projects complete).
Domain-driven repository with 225+ algorithmic solutions across 5 levels, 5 relational database schemas (Medical Clinic, E-Commerce, HR/Payroll, Vehicle Registry, Employee Analytics), and 3-tier desktop architecture in C#/.NET.