Project Sql Server
Resume:
RESUME
Jeshna J. Shetty
B - *, Shantiniketan Building,
Kopar Road,
Dombivli (West)
Resi: 2495506
Email: ******.******@*****.***
****************@**********.***
Contact no. : 91-966*******
CAREER OBJECTIVE:
Intend to build a career with leading corporate of hi-tech environment with committed and dedicated people, which will help me to explore myself fully and realize my potential.
EDUCATION QUALIFICATION:
YEAR STANDARD UNIVERSITY/INSTITUTION PERCENTAGE CLASS
March-2007 S.S.C. MAHARASHTRA STATE BOARD 90.00% DISTINCTION
Feb-2009 H.S.C. MAHARASHTRA STATE BOARD 83.50% DISTINCTION
BSC-IT marks :
EXAMINATION MARKS PERCENTAGE
Sem I 643/750 85.733
Sem II 588/750 78.4
Sem III 578/750 77.067
Sem IV 599/750 79.8667
Sem V 576/750 76.8
Sem VI 656/800 82
SEM VI PROJECT DETAILS:
PROJECT TITLE: SHORTEST PATH FINDER
Marks Obtained: 187/200
Description: I have developed a project to find shortest path on a map between any 2 cities. Currently, I have used the Thane district map. This can be extended to any other state map. The user can provide source & destination cities by clicking on the city nodes on the map. The application will find the shortest path & distance &draw the path on the map. This application implements the Dijkstra’s algorithm. This application will help the administrator to edit the map i.e. add new cities to the map. Computer science classrooms could use this application in order to demonstrate students the working of Dijkstra’s algorithm in a interactive manner.
Hardware
• Pentium 4(P4) or higher version
• 1 GB RAM or more
• Hard disk free space required – 500 MB
• Windows XP or higher version.
Software
• SQL Server
• .Net framework
Development tools
• Microsoft SOL Server
• Visual Studio 2008
Contribution made by the project
1] This project will provide a simplified view of Dijkstra’s algorithm using graphical user interface.
2] Time complexity of shortest path generated is greatly reduced & rate of accuracy will be higher.
3] Using this application, the user need not remember all the cities between source & destination to find the shortest path. He can directly give source & destination city names as input & get the shortest path between them.
4] This application can be used in educational system to demonstrate the use of Dijkstra’s algorithm in an interactive manner.
SOFTWARE AND / OR HARDWARE PLATFORMS FAMILIAR / PROFICIENT IN:
VB6, Microsoft Visual Studio 2008, Windows Operating Systems, Microsoft SQL Server
PROGRAMMING LANGUAGES KNOWN:
C, C++, Java, C#, HTML, VB, VB.Net
PERSONAL SKILLS:
• Discipline
• Dedicated
• Energetic
• Capacity to be trained & urge to learn new things
ACHIEVEMENTS :
• Stood First in Semesters I,II & V of BSC-IT
• Stood Second in Semesters III & IV of BSC-IT
• Participated in competitions like Hunting with C/C++, Scriptoprogramming etc.
PERSONAL PROFILE:
Name : Jeshna J. Shetty
Father’s Name : Jaya V. Shetty
Mother’s Name : Vinaya J. Shetty
Nationality : Indian
Date of Birth : 14 May, 1991
Hobbies : Cooking, Drawings, Playing Carom
Languages Known : English, Hindi, Tulu & Marathi
Contact this candidate