Rahul Nalawade
Software Developer at Oracle
Plano, Texas, United States
Summary
👤
Senior🎓
Top SchoolRahul Nalawade is a Software Developer with 11 years of experience specializing in machine learning, NLP, and cloud-based observability solutions. At Oracle he builds Autonomous Cloud features that apply advanced ML to detect anomalies and improve health, performance, and availability monitoring. His background includes developing real-time dashboards and alert automation at TCS and mentoring undergraduates in Java and web technologies at UT Dallas, reflecting both hands-on engineering and teaching skills. Based in Plano, Texas, he combines production-grade system design with research-oriented ML interests, favoring team-based problem solving over solo work. Not actively seeking new roles, he focuses on impactful projects that bridge ML research and operational reliability.
11 years of coding experience
1 year of employment as a software developer
Master of Science - MS, Computer Science, 3.59, Master of Science - MS, Computer Science, 3.59 at The University of Texas at DallasBachelor of Technology, Computer Science, Bachelor of Technology, Computer Science at Indian Institute of Information Technology Vadodara
English, Hindi, Marathi
Stackoverflow
1reputation
32reached
0answers
1question
Github Skills (41)
expressions7
search-tree7
hashset6
prolog6
interval-arithmetic6
calculator6
bigint6
biginteger6
divide-and-conquer5
skiplist5
red-black-tree5
linked-list5
multiprecision5
recursion5
hashmap5
Programming languages (3)
Github contributions (5)
rahul1947/LP4-PERT-Enumeration-of-Topological-Orders
Nov 2018 - Jan 2019
Enumeration of all Permutations (Recursion, Single Swap, and in Lexicographic Order), and Combinations. Enumeration of all Topological Orderings on a Directed Graph. Enumeration of all Paths in a connected Graph. Evaluates Critical Path using PERT Algorithm.
Contributions:42 commits, 4 PRs, 34 pushes in 2 months
directed-graphgraphrecursion
rahul1947/LP2-Skip-List-Implementation
Nov 2018 - Jan 2019
Skip Lists: A generalization of sorted linked lists for implementing Dictionary ADT (insert, delete, find, min, floor, ceiling) in O(log n) expected time per operation. And competing with balanced search trees like AVL, Red-Black, and B-Trees.
Contributions:24 commits, 2 PRs, 21 pushes in 1 month
btreelinked-listsearch-treeskiplist
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.