Question

i am writing thesis paper for these question (why do we need data structures? What is the relationship between data structure and algorithm? What data structures have we learned? What are their respective logical and physical / storage structures? What are their advantages and disadvantages? In which cases do they apply to (combined with time complexity analysis)? Please analyze the learned data structure one by one. At least one application example combining data structure and algorithm should be given) i need an abstract for my thesis.

My question Note: please write an abstract for my thesis paper

Answer 1

Solution 1: Data Structures are needed to store the data that can be processed by the program in order to achieve the preferred objectives. Data Structures and Algorithms work hand in hand, and the algorithms are the functions that basically perform basic operations on the data that is present inside these data structures. Each and every data structure has a specific application and hence it can only be used in conjunction with specific algorithms in order to achieve the consolidated task. These data structures use different logics and storage structures inside the memory such as some of them require dynamic memory allocation and others require static memory allocation. Some of them use the heap memory area and the others use the stack memory area depending upon the situation. Most of the time the static memory allocation works well but in order to reduce the memory leakage, dynamic memory allocation is also required at times. Various works that have been reported in the literature show that the efficiency and the effectiveness of an algorithm not just depends upon its complexity but the data structure it is being operated upon.

Here's the solution to your question, please provide it a 100% rating. Thanks for asking and happy learning!!