1.
SHRUTHI RAMESH NAYAK
Santa Clara, CA 95050 • (469) 3533951 • sxn145130@utdallas.edu
rn.shruthi@gmail.com • in.linkedin.com/in/nayakshruthi • https://github.com/shruthinayak
Education
The University of Texas at Dallas
Master of Science, Computer Science. GPA: 3.7/4.0
Graduate coursework: Implementation of advanced data structures and algorithms, Information Retrieval, Big Data,
Machine Learning, Statistical methods of Data science, Database Design
May’16
People’s Education Society Institute of Technology (PESIT), Bangalore
Bachelor of Engineering, Computer Science. GPA: 8.64/10.0
Jun’13
Experience
Java Developer Intern, Sabre Corporation, Dallas, TX May’15Nov’15
● Worked as a Java developer in the Profit Manager team of Air Vision Planning and Scheduling division of
Sabre as an intern for Summer and Fall semesters.
● Developed generalized module that does realtime log report generation of the Usage data.
● Conducted a case study on making the tool better. Devised a bash script that enables logging of garbage
collection of the client and server.
Software Engineer Mobile, Cleartrip Pvt Ltd, Bangalore Jul’13Jul’14
● Contributed to the Cleartrip mobile product for Android. Worked for the Hotels product of Cleartrip.
● Worked with Custom List Views, ViewPager, Navigation Drawer, Location services, Retrofit, Google’s
gson, Picasso, Glide, Crittercism and Localytics for crash report logging.
● https://play.google.com/store/apps/details?id=com.cleartrip.android
Research Assistant, Computer Science Dept, Indian Statistical Institute, IIT Madras Jun’11Aug’11
● Prediction of arrival of nodes in a Scale free network: A novel algorithm implemented in python aims at
predicting the order of arrival of nodes in a scale free network. python
● Carried out empirical experiments to predict the order of the nodes. Use of python libraries such as
matplotlib and networkx to simulate the scale free network. python
● Designed a new centrality measure called Differential Core centrality that predicts the order of a set of
nodes with 89% accuracy. python
Research Intern, TESCO HSC, Bangalore Jun’12Aug’12
● Evaluated the performance of MongoDB, HBase, MySQL, Redis by a predefined set of workloads for
CRUD operations using the Yahoo’s YCSB tool.
● Results depicting which NoSQL database works the best during different CRUD operations are
documented here: https://goo.gl/1SN7lv
Research Publication
● Published IEEE Short Paper on "Prediction Of Arrival Of Nodes In A Scale Free Network", arXiv: 1111.4886v2 [cs.SI]", in
The IEEE/ACM International Conference on Social Networks Analysis and Mining (ASONAM 2012), held on August 26th to
29th, 2012 in Istanbul, Turkey. Link to paper: http://bit.ly/1GVJKVm
Technical Skills
Languages and Tools Android, Java, Python, Javascript, SQL, R Programming
Operating Systems Android OS, Linux, Windows
IDE Android Development Tools Eclipse SDK, Eclipse, Android Studio, IntelliJ, PyCharm, RStudio
Version Control SVN, Git
Academic Projects
Implementation of Advanced Data Structures and Algorithms, UT Dallas Jan’16
● Implemented BigInteger class, Priority queues using heap, HashSet.
● Implemented Hierholzer's algorithm to find Euler tour in a graph of million nodes.
● https://github.com/shruthinayak/DataStructuresImplementation
2. Minisearch engine, UT Dallas Mar’15May’15
● Inverted index creation after stemming and lemmatizing the words in the document. Use of Stanford
CoreNLP library to get the stems of the words.
● Building relevance model to extract relevant documents and rank them in the order of their relevance to
the query. Link: https://github.com/shruthinayak/SearchEngine
Quantifying and Analysing performance factors in Visual Cryptographic Algorithms, PESIT Feb’11Jun’11
● Implemented KN Sharing and Progressive Visual Cryptographic Algorithms.
● Comparison of the two, using signal to noise ratio, memory usage and image quality.
● https://github.com/shruthinayak/VisualCryptography
Heuristic Analysis for Influential Spot Detection in Complex Networks, PESIT Jan’13May’13
● Determined the minimum set of nodes in a social network that could cover the entire network in “k”
number of hops.
● Finds its application in efficient information spreading in different kind of communities formed by social
networks. Link: https://github.com/shruthinayak/InfluentialAnalysis
MindPro A mind map for wiki articles, PESIT Aug’12Nov’12
● Summarizing the keywords in the wiki article specified by the user. Once downloaded, the article is
available for reuse.
● Use of D3 library to create mindmap. JSoup to parse through the HTML document. Jython to run the
server. Link: https://github.com/shruthinayak/MindMaps
Hobby Projects
ContactShare https://play.google.com/store/apps/details?id=com.contactshare&hl=en
● ContactShare is an android app that helps you to share your contact details by using a QR code.Android, Java
● Use of Contact Intent to save contact details directly to your phone book. Android, Java
Appster An app for all your posters http://challengepost.com/software/appster
● Won 2nd Place at HACK_UTD 24 hours Hackathon. Appster, an utility app to extract information from the poster image and
save as an reminder into your Android calendar. Android
● Additional options to navigate to the event location and share the event details with a friend. Android, Java
Insignia https://github.com/shruthinayak/MilitaryApp
● Won 2nd Place for this app at a 5hour hackathon organized by USAA at UTD. Android, Java, OOP
● Given data had to be organized in a way that would accelerate easy learning. Games were designed as a part of this app.
Remote mousepad https://github.com/shruthinayak/WifiMouse
● Mobile turned into touchpad to control mouse events in computer connected under the same wifi network. Android, Java,
● Server(computer)client(android app) connection made by scanning of the QR code. Use of zxing library.Android, Java
ShopEasy(Ongoing) https://github.com/shruthinayak/GroceryApp
● ShopEasy helps you to collaborate with your friends to buy groceries. Let go of all the hassles of making a list of who wants
what. The aftermath is taken care of, by the app. Android, Java, OOP
● Use of Recycler listviews, swipe action of list item, SwipeToRefresh, floating action buttons Lollipop features explored in
this project. Use of ParseAPI to handle the backend. Android, Java, OOP
Availability: Available for full time from May 2016.
![SHRUTHI RAMESH NAYAK
Santa Clara, CA 95050 • (469) 3533951 • sxn145130@utdallas.edu
rn.shruthi@gmail.com • in.linkedin.com/in/nayakshruthi • https://github.com/shruthinayak
Education
The University of Texas at Dallas
Master of Science, Computer Science. GPA: 3.7/4.0
Graduate coursework: Implementation of advanced data structures and algorithms, Information Retrieval, Big Data,
Machine Learning, Statistical methods of Data science, Database Design
May’16
People’s Education Society Institute of Technology (PESIT), Bangalore
Bachelor of Engineering, Computer Science. GPA: 8.64/10.0
Jun’13
Experience
Java Developer Intern, Sabre Corporation, Dallas, TX May’15Nov’15
● Worked as a Java developer in the Profit Manager team of Air Vision Planning and Scheduling division of
Sabre as an intern for Summer and Fall semesters.
● Developed generalized module that does realtime log report generation of the Usage data.
● Conducted a case study on making the tool better. Devised a bash script that enables logging of garbage
collection of the client and server.
Software Engineer Mobile, Cleartrip Pvt Ltd, Bangalore Jul’13Jul’14
● Contributed to the Cleartrip mobile product for Android. Worked for the Hotels product of Cleartrip.
● Worked with Custom List Views, ViewPager, Navigation Drawer, Location services, Retrofit, Google’s
gson, Picasso, Glide, Crittercism and Localytics for crash report logging.
● https://play.google.com/store/apps/details?id=com.cleartrip.android
Research Assistant, Computer Science Dept, Indian Statistical Institute, IIT Madras Jun’11Aug’11
● Prediction of arrival of nodes in a Scale free network: A novel algorithm implemented in python aims at
predicting the order of arrival of nodes in a scale free network. python
● Carried out empirical experiments to predict the order of the nodes. Use of python libraries such as
matplotlib and networkx to simulate the scale free network. python
● Designed a new centrality measure called Differential Core centrality that predicts the order of a set of
nodes with 89% accuracy. python
Research Intern, TESCO HSC, Bangalore Jun’12Aug’12
● Evaluated the performance of MongoDB, HBase, MySQL, Redis by a predefined set of workloads for
CRUD operations using the Yahoo’s YCSB tool.
● Results depicting which NoSQL database works the best during different CRUD operations are
documented here: https://goo.gl/1SN7lv
Research Publication
● Published IEEE Short Paper on "Prediction Of Arrival Of Nodes In A Scale Free Network", arXiv: 1111.4886v2 [cs.SI]", in
The IEEE/ACM International Conference on Social Networks Analysis and Mining (ASONAM 2012), held on August 26th to
29th, 2012 in Istanbul, Turkey. Link to paper: http://bit.ly/1GVJKVm
Technical Skills
Languages and Tools Android, Java, Python, Javascript, SQL, R Programming
Operating Systems Android OS, Linux, Windows
IDE Android Development Tools Eclipse SDK, Eclipse, Android Studio, IntelliJ, PyCharm, RStudio
Version Control SVN, Git
Academic Projects
Implementation of Advanced Data Structures and Algorithms, UT Dallas Jan’16
● Implemented BigInteger class, Priority queues using heap, HashSet.
● Implemented Hierholzer's algorithm to find Euler tour in a graph of million nodes.
● https://github.com/shruthinayak/DataStructuresImplementation](https://image.slidesharecdn.com/6fac697f-dcc0-4eed-b706-e2e8492bbfc8-160229010307/85/shruthinayak-1-320.jpg)
