Bachelor of Engineering in Computer Science and Engineering
LJ INSTITUTE OF ENGINEERING AND TECHNOLOGY
Rigorous academic foundation in core computer science, systems engineering, and advanced mathematical foundations. Active solver and analytical practitioner of graduate-level Machine Learning examination papers (University of Pennsylvania CIS 520 & GATE Data Science and AI curriculum) spanning convex optimization, Lagrangian duality, SVD/PCA spectral analysis, probabilistic graphical models, and reinforcement learning.
CORE COMPUTER SCIENCE & SYSTEMS
- Data Structures & Algorithms in Java (Arrays, Linked Lists, Trees, Graphs, Hash Maps)
- Object-Oriented Programming (OOP) & Software Design Patterns
- Database Management Systems (Relational Design, SQL, PostgreSQL, MySQL)
- Operating Systems, Memory Management & Linux Kernel Concepts
APPLIED AI & PRODUCTION PIPELINES
- Intelligent Document Processing (IDP), Surya & Chandra OCR Pipelines
- Transformer NLP (ByT5 Fine-Tuning & IndicXlit Script Normalization)
- Computer Vision (YOLOv8 Real-Time Object Detection & OpenCV)
- Asynchronous Architectures (FastAPI REST APIs & Agentic LLM Orchestration)
THEORETICAL ML & PAPER SOLVING
- Convex Optimization, Lagrangian Duality, KKT Conditions & Mercer Kernels
- SVD & Spectral PCA (Eigenvector Variances, Linear Autoencoder Duality)
- Probabilistic Graphical Models (Bayesian Networks, d-separation, Markov Blankets)
- Statistical Learning Theory (Bias-Variance, MLE vs. MAP, MDPs & Q-Learning)
ACADEMIC RIGOR · GRADUATE ML PROBLEM SOLVING
Advanced Machine Learning Theory & Exam Papers Analysis
Active solver and analyzer of graduate-level Machine Learning problem sets, including University of Pennsylvania CIS 520 (Machine Learning) Finals & Midterms (2017–2022) and the GATE Data Science & Artificial Intelligence (DSAI) curriculum.
OPTIMIZATION & DUALITY
Convex optimization, Lagrangian duality, Karush-Kuhn-Tucker (KKT) conditions, Mercer kernel proofs for SVMs, and L1 (Lasso) vs. L2 (Ridge) regularization dynamics.
SPECTRAL & MATRIX THEORY
Singular Value Decomposition (SVD), left/right singular vector duality with AAᵀ and AᵀA, PCA reconstruction error minimization, and covariance eigenvector analysis.
PROBABILISTIC GRAPHICAL MODELS
Bayesian network factorizations, d-separation algorithms, conditional independence queries (C ⊥ D | F), Markov blankets, and minimal parameter bounds for joint distributions.
STATISTICAL LEARNING & RL
Bias-variance decomposition under varying hypothesis complexity, Maximum Likelihood (MLE) vs. MAP estimation, Markov Decision Processes (MDPs), Bellman optimality, and Q-learning.
B.E. Computer Science
CGPA: 7.6 / 10
UPenn CIS 520 ML Papers
GATE Data Science & AI
Convex Optimization
Lagrangian Duality (SVM)
SVD & Spectral PCA
Bayesian Networks (d-sep)
Markov Decision Processes
Data Structures & Algorithms
Java OOP
Python
Linux