How to apply algorithmic design and data structure techniques in developing structured programs

Hi Newbie, 

I will explain how to apply algorithmic design and data structure techniques in developing structured programs in this interactive assignment. So, there are a different number of data structures, and each has a different field of application and a different implementation with a different type of use. The correct data structure has to be used in the right problem-solving. For example - if the elements with a value greater or lesser than a given element have to be searched, then a binary tree has to be used neither stack nor queue.

But some data structure designs are designed to occupy less space than the solutions with the other data structures and the large constants, which are hidden in asymptotic space bounds. So in such a case where the design has to be efficient for the space, more concise data structures can be used.

As every program has a different statement and every statement is required to be executed, it is usual that the program will take a specific time to execute and also will take a particular space. Firstly a design strategy is required to be chosen while developing the structured designs.

The right way of applying the proper applying algorithmic design is by choosing between the top-down approach or the bottom-up approach. Also, the execution time of the program has to be taken into consideration as to how much the program will require to get stored. According to that, a suitable data structure design has to be selected. I hope that helps.