Applying algorithmic design and data structure techniques in developing structured programs

            Although I am no pro to this concept during this course I learned the importance of algorithmic design and data structure while developing structure programs. Of course most people know that computers rely on data and some sort of algorithm to operate. Every person's need when it comes to a computer may defer from one another. With that being said you must take into consideration what exactly your needs are when designing a program or even a computer. 

            Data structures are a technological way of organizing and storing data so that you can perform operations more efficiently. Some commonly used data structures are arrays, linked lists, and stacks. Arrays allow a collection of items to be stored at contigious memory locations. Linked lists are s sequential structure that consists of a sequence of items in a linear order linked together. Finally a stack is a last in first out type of storage.

            An algorithm is the process or set of rules that are followed in calculations or problem solving operations needed. Similar to the data structures, algorithms take a divide and conquer approach to problem solving. They approach the problem from a top to bottom technique which breaks the algorithm into smaller fragments that are called modules. There is also a bottom up concept which allows the algorithm to be tested at an individual level. 

        Depending on the type of program you are building or the type of computer you are needing will rely heavily on the data structure and algorithmic design. You will need to take both items into consideration to build the most efficient operating system. If you are going to perform simple operations you are keep to the basics however if your operations are more complex you will need to ensure you are choosing the best processes to complete your tasks.