This is default featured slide 2 title

Go to Blogger edit html and find these sentences.Now replace these sentences with your own descriptions.

This is default featured slide 3 title

Go to Blogger edit html and find these sentences.Now replace these sentences with your own descriptions.

This is default featured slide 4 title

Go to Blogger edit html and find these sentences.Now replace these sentences with your own descriptions.

This is default featured slide 5 title

Go to Blogger edit html and find these sentences.Now replace these sentences with your own descriptions.

CSS Drop Down Menu

Tuesday, 25 March 2014

Searching:Linear Search

Monday, 24 March 2014

WS:Introduction

Fig: Service Using Without WebService
Fig: WebService[Cross PlateForm Client-Server Communication]
Fig: Client-UDDI-End_Point_Service_Location

Importatnt Elements Of WSDL:-

There are five main elements of WSDL(wiz-dull) file which are given below:-
1-Service
2-Binding
3-Port Type
4-Message
5-Types
Fig:- High Level Architecture: WSDL
Here ,Sample of WSDL file is given below and also each main elements has been explained:-

1:-service

2:-bindings

3:-portType

4:-message

5:-types

Monday, 17 March 2014

Heap Sort

Fig : Heap Sort

Merge Sort

Fig:Merge Sort

Quick Sort

Fig :Quick Sort

Insertion sort

Fig : Insertion sort

Selection Sort

In selection sorting algorithm,
1: Find the minimum value in the array then swap it first position.
2: In next step leave the first value and find the minimum value within remaining values.
3: Then swap it with the value of minimum index position. Sort the remaining values by using same steps. Selection sort is probably the most intuitive sorting algorithm to invent.
The complexity of selection sort algorithm is in worst-case, average-case, and best-case run-time of Θ(n2), assuming that comparisons can be done in constant time.
Fig:- Selection Sort
Selection sort animation.Red is current min. Yellow is sorted list. Blueis current item.
Code description:
In selection sort algorithm to find the minimum value in the array. First assign minimum index in key (index_of_min=x). Then find the minimum value and assign the index of minimum value in key (index_of_min=y). Then swap the minimum value with the value of minimum index.
At next iteration leave the value of minimum index position and sort the remaining values by following same steps.
Working of the selection sort :
Say we have an array unsorted A[0],A[1],A[2]................ A[n-1] and A[n] as input. Then the following steps are followed by selection sort algorithm to sort the values of an array . (Say we have a key index_of_min that indicate the position of minimum value)
1.Initaily varaible index_of_min=0;
2.Find the minimum value in the unsorted array.
3.Assign the index of the minimum value into index_of_min variable.
4.Swap minimum value to first position.
5.Sort the remaining values of array (excluding the first value).

Wednesday, 12 March 2014

HCF(GCD) and LCM

Tuesday, 11 March 2014

Pascal Triangle

In mathematics, Pascal's triangle is a triangular array of the binomial coefficients.The rows of Pascal's triangle are conventionally enumerated starting with row n = 0 at the top. The entries in each row are numbered from the left beginning with k = 0 and are usually staggered relative to the numbers in the adjacent rows.
Note:-A simple construction of the triangle proceeds in the following manner. On row 0, write only the number 1. Then, to construct the elements of following rows, add the number above and to the left with the number above and to the right to find the new value. If either the number to the right or left is not present, substitute a zero in its place. For example, the first number in the first row is 0 + 1 = 1, whereas the numbers 1 and 3 in the third row are added to produce the number 4 in the fourth row as below:-