Dany
BAN USERGraduate student at The University of Texas at Dallas. Former employee of Verizon and Accenture.
- » Git Hub
- » ResearchGate
- » Stack Overflow
DINESH APPAVOO
PROFESSIONAL SUMMARY
An Energetic IT professional with 3 years and 7 months of rich work experience.
Well versed with entire development life cycle and facilitating agile practices.
Spearheaded the design and development of a Struts and advanced data structural elements based critical
system budgeted, which earned high accolades in the independent code and design reviews
EDUCATION
Master of Science in Computer Science
The University of Texas at Dallas, TX
Dec 2014
Bachelors in Technology in Information Technology Anna University, Coimbatore Institute of Technology, India
May 2009
Related Coursework:
Implementation of Advanced Data Structures and Algorithms, Web Programming, Database Design, Design and Analysis of Algorithms, Advanced Computer Networks, User Interface Design for Mobile Devices (Android)
TECHNICAL SKILLS
Languages and Specialties:JAVA/J2EE, C, Android SDK, Unix Shell script, AWS, TCP/IP, HTTP
Big Data:Hadoop (MapReduce), HDFS, Pig, Hive
JAVA/J2EE :JAVA Swings, Struts 1.2, JSP, Servlets, JMS(Queue, Topic), JAX-RPC, JAX-WS
Databases : Oracle, MySQL, DB2
WEB/XML Technologies :JavaScript , HTML, CSS, DTD, XSD, XML, XPATH, WSDL
Software and Tools :Tomcat, Weblogic, Eclipse, Flex Builder, QC, XML SPY, PL/SQL Developer
Operating System : Linux, UNIX, Windows, Mac
EXPERIENCE
Analyst System Development Verizon, India Jun2011 – July2013
Implemented eBonding ordering product, which reduced the necessity of Data Gathering Forms and improved order process time by 400%
Involved in the research and development (R & D) for Graph Networks and proposed efficient graph algorithms for Verizon wireline networks
Developed algorithms for dynamic graph construction to effectively add, remove routers in the network
Designed a graphical interface for order routing using JSP, Flex builder, XML, XSD, WSDL
Developed an application to graphically show the router connection with their respective CLLI to help customers
make connection decisions
Designed National Private IP (NPIP) structure for national customers which gives customers the option to
construct a private IPV6 network
Developed an order management system (AccOrd) to effectively provide order statuses
Designed a XML schema to store thousands of order attributes based on ASOG (Access Service Ordering
Guidelines) given the U.S. government
Achievements:
Earned ‘Yearly On the Spot Award’ during the probation period of service in Verizon for the exemplary performance towards the architecture of the product Accord
Associate Software Engineer Accenture, India Dec2009 – May 2011
Designed products for Telstra involving requirement gathering and solution design by following the established quality metrics and stuck to standards in all phases
Integrated products stored in Siebel CRM with JAVA based Product Definition DataBase (PDDB)
Designed an architecture to maintain the consistency between Siebel interface and product database
Reduced defect rate by 5% by defining entry and exit criteria for the design phase
Enhanced productivity by 7% using agile mode of product development
ACADEMIC PROJECT
Contact Manager – Cloud Application [JAVA, Amazon SimpleDB]
Developed a contact manager application in JAVA/J2EE to manage student contacts for the university which stored application data in Amazon cloud (SimpleDB) and deployed the application into Amazon EC2 instance.
Barrel Race Game – Android Game [Android, JAVA]
Designed and developed a Horse Barrel Race android game which uses accelerometer and sensor to circle the barrel with the horse. Installed chronometer display to calculate time taken to circle the barrels
Notepad Application – Android [Android, JAVA]
Developed a Notepad Application for Android devices, to create, save new document and open text files in Android File System and it has an additional functionality to open recently closed files.
Big Data Analytics – IMDb Dataset [Hadoop, MapReduce, JAVA]
Used Map-Reduce and Hadoop frameworks to derive statistics like top 10 movies, number of movies in a genre from IMDB dataset of over a million movies by running chained map-reduce jobs on a six-node cluster
Big Number Arithmetic [JAVA]
Developed a project to overcome the limitation and performs arithmetic operations on arbitrarily large numbers. Current hardware supports 64 bit arithmetic operations which can handle maximum of 19 digits in base 10.
Largest BST Network [JAVA]
Designed and implemented an algorithm which identifies the largest BST (Not Induced) in the input binary tree. Used customized bottom up algorithm with minimal running time.
Cinux-Linux Customization [Shell script, C]
Customized Linux system from the scratch to effectively use the kernel.
Built a Baby OS with the basic compliers, utilities like GCC, Glibc & etc. and other essential modules and patches
required to build the OS.
Retrofitted user friendly media player application and monitoring tool into the existing baby Linux OS
LINKS
LinkedIn:www.linkedin.com/in/dineshappavoo/
Stack Overflow: http://stackoverflow.com/users/3103732/dinesh-appavoo
Git Repo:https://github.com/dineshappavoo
Visa Status: F-1

/*
*
* MAX_POLINDROME(str)
* for i 1 to length
* if current and current-1 matches //even length
* move both sides,count and check with max
* else if current and current-2 maches //odd length
* move both sides,count and check with max
*
* return the max length string
*
*/
public class MaxPolindrome {
/**
* @param args
*/
/*
*
* MAX_POLINDROME(str)
* for i 1 to length
* if current and current-1 matches //even length
* move both sides,count and check with max
* else if current and current-2 maches //odd length
* move both sides,count and check with max
*
* return the max length string
*
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
String str="ABCBAHELLOHOWRACECARAREYOUIAMAIDOINGGOOD";
String res=MaxPolindrome.findmaxPolindrome(str);
System.out.println(res);
}
public static String findmaxPolindrome(String str)
{
int len=str.length();
if(len<2)
return str;
int wordLength=0, maxWordLength=0;
char current;
int maxStart=0,maxEnd=0;
String res="";
int k,l;
for(int i=2;i<len;i++)
{
current=str.charAt(i);
if(current==str.charAt(i-1)) //even length
{
k=i-1;
l=i;
while(str.charAt(k)==str.charAt(l) && l!=len-1 && k>0)
{
l++;
k--;
}
wordLength=l-k;
if(wordLength>maxWordLength)
{
maxWordLength=wordLength;
maxStart=k+1;
maxEnd=l-1;
}
}else if(current==str.charAt(i-2)) //odd length
{
k=i-2;
l=i;
while(str.charAt(k)==str.charAt(l) && l!=len-1 && k>0)
{
l++;
k--;
}
wordLength=l-k;
if(wordLength>maxWordLength)
{
maxWordLength=wordLength;
maxStart=k+1;
maxEnd=l-1;
}
}
}
for(int m=maxStart;m<=maxEnd;m++)
{
res+=str.charAt(m);
}
return res;
}
}
/*
* ALGORITHM
* for size n to 1
* Keep the first element in the variable v
* for 1 to n-1 pop from S and push to T
* push v to S
* pop all from T and push to S
*
* return S
*/
public static Stack<Integer> reverseStack(Stack<Integer> S)
{
Stack<Integer> T = new Stack<Integer>();
int v=0;
int size=S.size();
while(size>0)
{
v=S.pop();
for(int i=0;i<size-1;i++)
{
T.push(S.pop());
}
S.push(v);
while(!T.isEmpty())
{
S.push(T.pop());
}
size--;
}
return S;
}
/*
* ALGORITHM
* for i=1 to n
* find products of i to i+l array elements
* if product>maxproduct
* maxProduct=product and maxStartIndex=i
* return maxStartIndex
*/
public static int findmaxProductSubArray(int[] arr, int l)
{
int len=arr.length;
int maxProduct=Integer.MIN_VALUE;
int maxStartIndex=0,tempProduct=1;
for(int i=0;i<=len-l;i++)
{
for(int j=i;j<((i+l));j++)
{
tempProduct*=arr[j];
}
if(tempProduct>maxProduct)
{
maxProduct=tempProduct;
maxStartIndex=i;
}
tempProduct=1;
}
return maxStartIndex;
}
- Dany January 27, 2015