Highly motivated and hard-working individual who has hands-on experience with multiple tools in the field of Data Science. Looking for opportunities to help me unfold a career path in the field of data science.
Overview
1
1
year of professional experience
1
1
Certification
Work History
Software Development Trainee
Jspiders
Bengaluru
10.2024 - 05.2025
Frontend: . Gained hands on experience on technologies such as HTML, CSS, JavaScript and React. Worked on multiple projects (both as an individual and as a team) involving BOM, DOM and JSON.
SQL Skills: Worked on projects involving DBMS, RDBMS. Implemented multiple queries involving complex Joins and Subjoins. Created databases following Normalisation principles.
Backend: Built an expertise in Java with dependency injection and CRUD operations using Servlet. Built projects following best OOPs practices such as Abstraction, inherence and Encapsulation. Have also worked on Java based frameworks such as Spring boot using MVC architecture.
Education
B.Tech. - Computer Science and Engineering
Presidency University
Bengaluru, India
07.2024
Higher Secondary School - CBSE
Kendriya Vidyalaya Hebbal
Bengaluru, India
04.2016
Skills
SQL
Power BI
Tableau
Excel
Python
Java
Certification
• Udemy - Data Analysis | SQL, Tableau, Power BI & Excel | Real projects • Software development, Completed the course on E2E software development projects following industry wide best practices issued by JSpiders., Bengaluru, Karnataka
Projects
EV analysis: designed an interactive Tableau dashboard to perform end-to-end EDA (exploratory data analysis) on Washington's EV data, using geospatial analysis and trend insights to highlight adoption patterns and support data-driven decisions, dataset size: 17 rows and 65,536 columns
Bike sales analysis: developed an interactive Tableau dashboard to analyze global bike ride sales, using geospatial mapping, trend analysis, and project segmentation to uncover key performance insights for decision-making, dataset size, and 113,038 columns
Vehicle routing problem: Implemented three algorithms: greedy, intralocal search, and interlocal search to solve the standard NP-hard vehicle routing problem in which multiple customers demand a certain amount of goods from a common store, where the number of trucks is limited and has a maximum capacity limit, implemented randomized point generation, tracing the path of each vehicle starting from the origin