UMME LABIB ASIF

Academic

Career

Verbatim text

Linkedin Profile
UMME LABIB ASIF
u.asif.21749@khi.iba.edu.pk
323/214-9059/03218978998
BSCS
CAREER OBJECTIVE
gg
EDUCATION
DEGREE/PROGRAM
YEAR OF GRADUATION
INSTITUTION
CGPA/PERCENTAGE
City
BSCS
June 2024
Institute of Business Administration, Karachi
3.67
A-Level
2019
Alpha College
A
Karachi
o-level
2017
Nakhlah, Karachi
A
MAJORS
Computer Science
INTERNSHIP/WORK EXPERIENCE(S)
DESIGNATION
NAME OF THE COMPANY
TENURE/DURATION
SAP Functional Analyst
3STEM - Simplified Sustainable Solutions
1 Aug 2021 - 30 Nov 2023
Internee
MAKE A WISH FOUNDATION
1 May 2021 - 31 Jul 2023
SKILLS AND COMPETENCIES
INTEREST AND HOBBIES
TERM PROJECT(S)/RESEARCH WORK(S)
E-Commerce Application: Architected and developed a dynamic web-based ecommerce food portal utilizing the power of the MERN
stack. Implemented and optimized a set of robust APIs, enabling seamless interactions and transactions within the platform.
Explainable AI: Conducted in-depth research on SHAP (SHapley Additive exPlanations) techniques applied to deep learning models.
Explored the significance of SHAP in improving model interpretability and gaining a deeper understanding of feature importance
Kaggle Competition - Data Mining: Achieved a remarkable top 10 ranking out of 184 participants in 3 Kaggle challenges, showcasing
my proficiency in Knime, Python, and advanced data mining techniques. Utilized clustering, PCA, regression, and classification analysis
to extract meaningful insights from complex datasets. Thrilled to have leveraged my skills to solve real-world problems and drive
data-based decision making.
Railway Reservation System: Demonstrated expertise in database design and ERD modeling while developing a web-based railway
reservation system. Leveraged PHP, HTML, JavaScript, and CSS to build a user-friendly and efficient platform.
Efficient Bank Management System: Engineered a robust and scalable banking system from the ground up using Java, effectively
managing a massive dataset comprising 5000 users and over 100k transactions. Overcoming the inherent challenge of optimizing
record retrieval, I devised an innovative solution that achieved an exceptional time complexity of O(1), a significant improvement from
the previous O(n^2) complexity.