aquila.25
BAN USER
I consider myself to be a good hire by virtue of my excellent and consistent academic background, relevant professional experience and my personality as a whole. I have extensive hands-on experience working on technologies such as Java, J2EE, Spring Framework, JAX-WS web-services, iBatis, Hibernate and SQL. My work experience uniquely qualifies me for work relating to highly transactional and data-oriented applications.
Aniruddha Kulkarni Phone: (530)-592-6431
M.S Computer Science – CSU, Chico
Email : aquila.25@gmail.com
Summary:
• Astute professional with relevant experience of 4 years in the field of Software Development.
• Experienced in design and development of Java/J2EE based software components in all layers of an n-tier web application from database tier to user interface.
• Managed and supported multiple projects and highly adaptable in quickly changing technical environments.
• Solid working knowledge of Linux and Windows operating systems.
• Familiar with ASP.Net / C#.
• Deeply interested in gaining experience in a cloud computing environment and in that regard have limited experience setting up VMware workstations, ESXi, deploying applications to a VM etc. Have also been following most of the cloud computing literature published by Sun Microsystems.
Relevant Skills: Java1.5, Oracle, MySQL, iBATIS, Hibernate, Spring 2.0, J2EE 1.4, JMS, Struts, Servlets, JSF, AJAX, JavaScript, CSS, Tomcat 5.5, JBoss 4.0, WebSphere 7.0, JAX-WS, JAX-RS (RestEasy).
Also experienced in:
• Analyzing Oracle explain-plans and using hints for SQL tuning.
• Setting up and using Subversion – version control system.
• Writing ANT scripts for automated builds.
Professional Experience:
Software Developer (Java/J2EE) (July 2006 – Present)
Landacorp Inc., A SHPS Company, Chico, California.
Overview
• Worked with a highly skilled team, to develop backend and front-end components and services for a n-tier, enterprise level, commercial software products consumed by an ASP .Net web application, used in healthcare management.
• Worked on maintenance / bug fixing etc. of legacy windows-applications based on the PowerBuilder technology.
• Assisted in maintenance / bug fixing on the front-end side of the web-application in the ASP.Net / C# technologies.
Job Responsibilities
• Design, develop, test and maintain elements of a modern n-tier application, using various tools and technologies, including Java, Struts, Spring Framework, JUnit, iBATIS and Hibernate, PowerBuilder, C#, ASP.Net, Javascript, CSS etc.
• Read and comprehend detailed technical design specifications and develop software components that comply with the specific requirements set by the design specification.
• Write, edit and revise detailed technical design documents, interface specifications etc. to accurately describe the technical details of the components/services to be developed.
• Writing detailed Javadoc-style documentation describing the developed components to technical and non-technical audiences.
• Work closely with the QA, documentation and the UI-development team ensuring proper flow of information within them for maintaining a proper and coordinated development environment.
Specific Individual Achievements
• Individually researched and developed a working prototype for a “cancellable” version of a time consuming web-service that was used for demonstrating a cancellable find operation in one of Landacorp’s web applications.
• Individually developed fully functional, Java/Struts-based add-on functionality for an existing Landacorp product, leveraging the existing software frameworks. This work involved both design and development activities.
• Individually developed a Velocity and Java 1.5 apt (Annotation Processing Tool) based custom tool to generate JMS - Message Driven Beans façade over the existing Spring framework based business objects. This project allowed clients the ability to access Landacorp’s business objects in an asynchronous fashion.
Academic Background:
• Master of Science in Computer Science (May 2007)
California State University, Chico.
CGPA: 3.82
• Bachelor of Science in Computer Engineering (June 2004)
University of Mumbai, India.
Relevant Projects:
Vertical Search Web-Services (Master’s Project, September 2006 – April 2007)
Overview: Designed and developed a working prototype of a Java-based web-service that exposed the capabilities of a generic search engine and a vertical search engine; forming a unique and comprehensive web-search service. Google web-search was used as the generic search engine and a pseudo-vertical search engine was developed as the vertical search engine. The capabilities of both the search engines were combined using a Spring/Hibernate based middle-tier which was also exposed as a web-service for consumption by potential clients using JAX-WS. A simple Struts–based web client was also developed to consume the Spring services.
Technology: Java 5.0, Spring 2.0, Hibernate 3.0, Struts, MySQL 5.0, JSP, JUnit 3.
Tools and Servers: Eclipse 3.2, MS Visio, Tomcat 5.5
Specific Role: This project was developed individually. All the research, design, development and documentation work was self performed.
Photo-Album Website (pet-project)
Overview: Developed a web-app that allows users to create photo albums, add/remove pictures etc. The main focus of this project was to learn JSF and to combine my knowledge of JAX-WS, JSF, Spring etc. into a working proto-type web-application. The images were sent/received using the MTOM support for JAX-WS web services.
Technology: JAX-WS, Spring 2.0, iBatis, JSF + ajax4jsf.
Tools and Servers: Tomcat 6.0
Other Interests:
Star Gazing, Reading Astronomy related books, listening to music, checking out Javaworld.com.
- 4
0of 0 votes
AnswersWhat is Spring IOC?
- aquila.25| Report Duplicate | Flag | PURGE
Yahoo Software Engineer / Developer Java
WE need to either assume that each node has a back link to its parent or assume that we have access to a hashmap that can tell us the parent of the any node.
Then the algo is check if (n1.parent == n2 || n1.parent.parent == n2) OR n2.parent == n1 || n2.parent.parent == n1).
Here is a thought use a min heap of size k and have 2 pointers positioned at the start of 2 arrays, say i pointing to A[0] and j pointing to B[0] then...
int numberOfElementsInHeap = 0;
int kthSmallestElement = -1;
while(true) {
if(A[i] < B[j]) {
insert A[i] into the min heap
kthSmallestElement = A[i]
i = i + 1;
numberOfElementInHeap++;
}else {
insert B[j] into the min heap
kthSmallestElement = B[j]
j = j + 1;
numberOfElementInHeap++;
}
if(numberOfElementInHeap == K) {
return kthSmallestElement;
}
}
The heap above jsut serves the purpose of conforming with the qus requirements log(n) + log(m). We are obtaining the kth smallest element in the loop itself.
Please comment if above looks corrrect?
It is better to use the divide and conquer method - MaxMin algorithm (except we only want the max value) - reason: it reduces the number of comparisions. See the algo below..
Max(arr,start,end,max) {
if(start == end) {
max = arr[start];
return;
}
if(end - start == 1) {
max = arr[end] > arr[start] ? arr[end] : arr[start]
return;
}
else {
mid = (start + end) / 2;
Max(arr,start,mid,max1);
Max(arr,mid+1,end,max2);
max = max1 > max2 ? max1 : max2;
return max;
}
}
strongly typed language means that every variable delcared needs to have some 'type' defined like int or char etc., weak typing means there is no specific type associated with variable declaration. Example of strngly typed language would be Java whereas Javascript is weakly typed.
- aquila.25 February 21, 2010
Need some clarification about what is the input to the algorithm? Are we given a set of words?
- aquila.25 March 14, 2010