A PROJECT REPORT
ON

IMPLEMENTING A DYNAMIC MODEL FOR THE SELECTION OF OPTIMIZED SORT USING HEURISTICS.

A BRIEF PREVIEW OF PROJECT

If frequent use of file is required for retrieving specific elements, it might be more efficient to sort the file. This is because the overhead of successive searches may far exceed the overhead involved in sorting the file once and subsequently retrieving elements from sorted file.

The Programmer must make a decision based on individual circumstances. Once a decision to sort has been made, other Decision must be made, including what is to be sorted and what methods are to be used. There is no one sorting method that is universally superior to all others .The programmer must carefully examine the problem and desired result before deciding these very important questions.

In Today’s market many type customized software, application package and language are available but they implement only one Specific sort function.

Thus they have pushed the responsibility of analyzing the data patterns of the organization for which the software to be implemented on to the programmer and their in built sort function will be hardly of any use. This shifting of responsibility on the programmers’ side will have drastic implifications :-

Thus they have pushed the responsibility of analyzing the data patterns of the organization for which the software to be implemented on to the programmer and their in built sort function will be hardly of any use. This shifting of responsibility on the programmers’ side will have drastic implifications .

Even if he manages to cope up with both the problem at hand and intricate details about sorting it will cost him time or man hours increasing the project cost.

Sometimes the programmer may be inadequately equipped for taking up the responsibility. In this case also the run time efficiency of the software will suffer for the sort implemented may not be the ideal one.

Even if we ignore all above hazard than also if the responsibility is taken by the programmer the model will definitely be static as opposed to dynamic. In the fast changing business scenarios the sort implemented will be relevant as per the data pattern for long time is impossible. As with business the data pattern of the organization will also change.

A PROJECT GOALS

IMPORTANCE OF PROJECT.

PURPOSE OF PROJECT.

ADVANTAGE OF PROJECT.

FUTURE AND SCOPE OF PROJECT.

IMPORTANCE OF PROJECT

The project is aimed at building a dynamic model for the selection of an ideal sort in accordance to the data patterns available in an organization, which are the output function of its policies.

Optimizing a Small Frequently used Activity to Small Degree Bring Multifold Optimization than Optimizing a Major Infrequently used Activity to a Major Degree.

This project is a step towards creating a new level of abstraction i.e. developing a high-level language in true sense .

The most challenging task is to get for a dynamic model for in the fast changing environments a static model is hardly of any use. And above all the design of such a dynamic model is further complicated by the fact that the computational complexity of the Dynamic model and optimized sort must not together exceed the computational complexity of the unoptimized one, defeating the whole purpose.

PURPOSE OF PROJECT

The main objective of developing this project is that to implement a dynamic model using idealized sort according the data pattern available in the organisation.The main idea for building this project is that to save manpower ,time and cost efficiency.

Secondly our project is that to develop a universal sort technique ,which is ideal to every type of software application and languages.

ADVANTAGE OF PROJECT

The project offers a new level of abstraction and is a step towards developing anew generation high level language.

For existing concept of high level language makes programming machine independent so that he can focus at problem at hand but still he has to implement several small task to achieve his objective for these towial task there are several choices of an algorithm and he has to make choice for ideal one in accordance to the domain. So if we some how make him independent of choice of algorithm for these trival task so it will a high level language in true sense which increase programmers efficiency to a new height by saving the leverage involved in algo selection there we have implement this concept for sorting criteria.

Now programmer does not have to analyzed the ideal sort but instead have to implement one sort function which will take care of all criteria and make judiciours choice for the ideal candidate. And the total model is planned in such a way that the over complexity of the model does not exceed the non ideal choice.

FUTURE AND SCOPE OF PROJECT

The project at present aims at developing the dynamic model for the selection optimized sort at present we have succeeded in attaining the computational complexity of the model to an extent that together with computational complexity of the model to an extent that together with computational complexity of optimized sort do not beat the unoptimized one (defeating the whole purpose).

This concept can further be applied for the dynamic selection of the data structure for the structure be used should be in accordance to the data pattern etc.and we can actually realize the benefit of the high level principal.

PROCEDURES

Initially the finalizer is invoked to finalize the ideal sort in accordance to the data pattern present in the organization.

Once the ideal sort in parallance to the data pattern is analyzed ,the sorting is done with this selected sort only and the monitor function is evoked not the finalizer. If monitor function monitors an increase in run time complexity of finalized sort from a threshold value. Than again evokes the finalizer to reconsider the decisions else sorts with the finalize sort as usual.

THE CHALLENGES FOR IMPLEMENTING THIS TECHNIQUE

In case of dynamic model we have definitely balanced that Optimized sort plus overhead of computing dynamic model is always less than the unoptimize sort .

It is not feasible to analyze the data pattern through software till now because the Data pattern changes greatly from organization to organization and no automated tools are available so everything is done manually.

Even if we work out and we have dynamic model .So it will be Difficult as the pattern changes with in the organization.

The only quantifiable matrix available in case of sort is Onotion which it self is dective.

SORTING METHOD IMPLEMENTATED

BUBBLE SORT

QUICK SORT

SELECTION SORT

INSERTION SORT

HEAP SORT

MERGE SORT

USER DEFINED FUNCTION

MONITOR_FUNCTION

FINALIZER_FUNCTION

COMPUTATION_FUNCTION

SORTING FUNCTION’S

MAIN FUNCTION

MONITOR_FUNCTION

THIS FUNCTION IS USED TO CALL THE FINALIZER FUNCTION BY WHICH WE GET THE VALUE OF NO. OF SWAPING AND COMPARISION AND IT THEN CALCULATE THE TOTAL CONSUMPTION OF TIME.

COMPUTATION_FUNCTION

This function has the same work as the Monitor_function has. It will be called first time only.

It is only dependent on the no. of swap’s and no. of comparision’s

FINALIZER_FUNCTION

IT IS USED TO SELECT THE BEST SORTING METHOD ACCORDING TO THE SITUATION.

SORTING METHOD

ALL THE SORTING IS USED TO CALL FOR THE FIRST LIST AND IN ALL MONITOR_FUNCTION IS CALLED TO CALCULATE THE CONSUMPTION OF TIME FOR EACH AND THEN ADD IT FOR FIRST TIME AND THEN ONLY ONE BEST SORTING METHOD WILL BE CALLED AND THEN FOR ALL THE LIST THAT SORTING METHOD WILL BE USED TILL PATTERN OF LIST IS CHANGED.

MAIN FUNCTION

THIS IS THE MAIN FUNCTION OF THE PROGRAM IN WHICH ALL THE USER DEFINED FUNCTION WILL BE CALLED.