INTERNSHIP EXPERIENCE
Jan **** – June ****: Analyst Intern, American Express
̶ Being a part of Operational Data Layer Unit (ODL), 3 tasks were performed :- ̶ Solving Request Change Management Problems using Hive queries ̶ Optimization of already created map which is a tree like structure of queries. The execution time reduced by around 2 hours in logical optimization of map. ̶ Analysis in reduction of ODL table refresh frequency rate which was 3 times a day. Here, it was observed that only 2% of table columns are significantly changing within a day.
EDUCATION
Degree/Examination University Institute Year GPA/% Masters in Computer Science(MCA) NIT Kurukshetra NIT Kurukshetra 2017-2020 8.044 Bsc. In Computer Science Delhi University Sri Guru Gobind Singh College of Commerce 2014-2017 76.95 Higher Education CBSE D.L.D.A.V. Model School, Pitam Pura, New Delhi 201*-****-** Secondary Education CBSE St.. Prayag Public School, Pitam Pura, New Delhi 201*-****-** PROJECTS
̶ Object Detection:
Detection of objects in an image using YOLO algorithm. This problem involves the understanding of Neural Networks and it’s various layers to get best results. This is implemented in python.
Language: Python, Framework/Library: Tensorflow, Numpy, Algorithm: YOLO ̶ Fairness in Carpool:
Fairly assign a driving task among a group of people who are travelling a common location but on different set of days through carpool. Fairness is calculated by converting the problem into flow networks and solving it using Ford-Fulkerson algorithm. Language: C++, Algorithm: Ford-Fulkerson Algorithm ̶ 8 Puzzle Problem:
It is played on a 3-by-3 grid with 8 square blocks labeled 1 through 8 and a blank square. The goal is to rearrange the blocks so that they are in order as mentioned in target arrangement. We are permitted to slide blocks horizontally or vertically into the blank square. This problem is solved using A* algorithm in Python and Pygame is used to make this interactive. Language: Python, Library: Pygame, Algorithm: A* Algorithm ̶ The Knight’s Tour Problem:
Knight has to cover the whole checkboard in such a way that no position should be visited more than once and all places should be covered. This is solved using Depth First Search and made interactive using SimpleGui in Python. Language: Python, Library: SimpleGui
TECHNICAL CERTIFICATIONS
̶ Deep Learning Specialization by Stanford University on Coursera. Specialization certificate of 4 courses earned including ‘Neural Networks and Deep Learning’, ‘Improving Deep Neural Networks: Hyperparameter tuning, Regularization and Optimization’, ‘Structuring Machine Learning Projects’,
‘Convolutional Neural Networks’.
̶ An Introduction to Interactive Programming in Python (Part 1) by Rice University on Coursera. ̶ DB5 SQL Stanford Online Lagunita.
LANGUAGES AND TECHNOLOGIES KNOWN
C++, Python, MySQL, Hive, Scripting in Python
PUBLICATIONS
̶ “Supervised Approach towards Class Seperability- Linear Discriminant Analysis”, Anjali Pathak, Bhawna Vohra, International Conference on Intelligent Computing and Control Systems-2019 [ICICCS 2019], 15-17 May 2019, Madurai, India. ̶ “Performance of feature extracted on leaf images by discriminant analysis on various classifiers”, Anjali Pathak, Bhawna Vohra, Kapil Gupta, International Conference on “Advanced Communication & Computational Technology [ICACCT- 2019], National Institute of Technology, Kurukshetra,India. ̶ “YOLO- An Object Detection Algorithm”, Anjali Pathak, Bhawna Vohra, Kapil Gupta, Bhartiya Bhashaon Mein Tritiya Antarrashtriya Vigyaan Sanghosthi, 2019, National Institute of Technology, Kurukshetra, India. ADDITIONAL SKILLS AND INTERESTS
̶ Actively participating in competitive programming contests on Codeforces . (Handle: vohrab1896). ̶ Sudoku Solving.
BHAWNA VOHRA
Phone No: 836-***-**** Email-Id: **********@*****.*** Linkedin Profile: LinkedIn://Bhawna-Vohra