Kishore Dutta

- Worked on various projects using Java/J2EE utilizing EJB, Struts, JDBC, JMS, JSP, Servlets, Java Beans, XML, RMI and JNDI with Oracle databases.

- Well versed in using Application servers such as BEA Web logic & IBM WebSphere & Web Server such as Apache tomcat.

- A fast learner with a positive attitude and flair for innovative ideas and excellent team player.

Databases                            Oracle 8i, Oracle 9i, Oracle 10g , DB2 , Sql Server ,My Sql
Frameworks                        Struts ,Hibernate,Spring ,Pandoora

Professional Experience

1)    Worked as a Associate Software Engineer in CMM Level 5 Company

2)    Worked as a Application Programmer in IBM India Private Limited.

3)    Worked as a Software Engineer in Reputed Soiftware Comany

Data Structure & Algorithms, Operating System, Database Management System, Theory of Computation, Software Engineering, C/C++ Programming, JAVA Programming, DOT NET Programming, Assembly Language, Python Programming

Bhaskar Verma Masters Degree Rating:5/5

Paul Carter Professional Programmer Rating:4/5

M.K Raghavan Professional Programmer Rating:4.5/5

Search Results
Binary tree creation Binary tree creation struct NODE { struct NODE *left; int value; struct NODE *right; }; create_tree( struct NODE *curr, struct NODE *new )
Explain principle of optimality Explain principle of Optimality It indicates that an optimal solution to any instance of an optimization problem is composed of  optimal solutions to its su
Depth first search DEPTH FIRST SEARCH (DFS) The approach adopted into depth first search is to search deeper whenever possible. This algorithm frequently searches deeper throu
Acyclic graphs Acyclic Graphs In a directed graph a path is said to form a cycle is there exists a path (A,B,C,.....P) such that A = P. A graph is called acyclic graph if
What is Oscillating Sort? For the Oscillating sort to be applied, it is necessary for the tapes to be readable in both directions and able to be quickly reversed. The oscillating sort i
Algorithm write an algorithm for the gpa of six students
Binary search Explain binary search with an example
Comparisions and assignments in worst ca... Q. Calculate that how many key comparisons and assignments an insertion sort makes in its worst case?        Ans: The worst case performance
What is assertions What is Assertions Introduction At every point in a program, there are generally constraints on the computational state that should hold for program to
Stack and queue write a algorithsm in c to perform push and pop operations stastic implementation using array ?
Basic organization of computer system what happen''s in my computer when i input any passage
Physical database design and sql queries... In this part, students are allowed to implement the following simplifications in their table and data design. o Availability for the beauty therapists don't
Delete a given specific node from a doub... D elete a specific Node from Double Linked List as follows DELETEDBL(INFO, FORW, BACK, START, AVAIL,LOC) 1. [Delete Node] Set FORW [ BACK [LOC]]:= FO
Frequency count what is frequency count with examble
Kruskals algorithm Krushkal's algorithm uses the concept of forest of trees. At first the forest contains n single node trees (and no edges). At each of the step, we add on one (t