Arooj Fatima

CS Student at LUMS | Specialized in High-Performance Data Structures & ML Frameworks

Based in: Lahore, Pakistan

Computer Science student at LUMS with a strong foundation in complex data structure implementation and machine learning. Proven ability to translate abstract logic into efficient C++ and Python code, with a focus on structural visualization and algorithmic precision. Currently seeking to apply technical problem-solving skills to the startup ecosystem at NIC Lahore.

Skills

Technical

Algorithms

Data Structures

C++

Stacks

Queues

Binary search trees

AVL trees

Hash tables

Socket programming

Heaps

Priority queues

Python

Visual Studio Code

Graphs

Slack

Dijkstra's algorithm

Sorting algorithms

Big-O analysis

Linked lists

LMS collaboration workflows

Linear regression

Logistic regression

B+ trees

Tries

Gradient descent

Regularization

Naive Bayes

k-Nearest Neighbors

Support Vector Machines

Decision trees

Neural networks

Networking

Distributed Systems

HTTP

DNS

TCP

Git

Machine Learning

Projects

Machine Learning Implementation Framework

Student Developerpersonal

Implemented and evaluated core ML algorithms spanning probabilistic classifiers, regression models, and neural networks. Worked through the full design-implement-evaluate cycle: loss functions, gradient descent optimization, hyperparameter tuning, and k-fold cross-validation. Derived and applied SVM Lagrangian formulations, information-gain-based decision tree construction (ID3), and backpropagation for neural networks.

PythonMachine LearningRegression modelsNeural networksSVMDecision treesID3Backpropagation

C++ High-Performance Data Structures Library

Student Developerpersonal

Implemented a doubly linked list, node- and array-based stacks and queues, and applied them to build Warehouse and RadarSystem simulation modules. Built a binary search tree and a self-balancing AVL tree from scratch, implementing recursive insertion, deletion, search, height tracking, and all four rebalancing rotations (LL, RR, LR, RL), and integrated them into a Catalogue application. Utilized manual structural visualization and diagramming to map out complex pointer reattachments and subtree rotations. Implemented hash maps with multiple collision-resolution strategies (chaining, linear and quadratic probing, double hashing) and graph data structures with traversal algorithms (BFS, DFS) for solving graph-based problems. Analyzed time and space complexity trade-offs across implementations and debugged pointer-level issues such as subtree reattachment during rotations and reference-to-pointer deletion patterns.

C++Doubly linked listStacksQueuesBinary search treeAVL treeHash mapsGraphsBFSDFS

Distributed Systems & Network Protocol Suite

Student Developerpersonal

Developed client-server socket-based network applications, handling message marshaling and packet-level communication between hosts. Designed and implemented a reliable data transfer protocol over an unreliable channel, addressing packet loss, acknowledgments, and retransmission strategies. Built distributed application components covering load distribution, coordination, replication, and failure handling across a multi-stage development sequence.

PythonSocket programmingClient-server architectureReliable data transfer protocolDistributed systems

Education

Freshman Year (Transfer)

Beaconhouse National University

Coursework

Introduction to Programming (CS 200)Calculus I & IIDigital Logic Circuits

BS Computer Science

Lahore University of Management Sciences (LUMS)Computer Science2028

Coursework

Data Structures (CS 202)Network Centric Computing (CS 382)Foundations of AI & Machine Learning (CS 331)Introduction to Programming (CS 200)Calculus I & IIDigital Logic Circuits

Hire AroojReach out about a role, a contract or a conversation.For recruiters

Arooj's twin is AI, it can make mistakes.

More people on Kanvis

Browse more people Create your own Kanvis