Data Structures - Problem Solving

1.Write down the definition of data structures? 


A data structure is a mathematical or logical way of organizing data in the memory that consider not only the items stored but also the relationship to each other and also it is characterized by accessing functions.

2.What is meant by problem solving? 

Problem solving is a creative process, which needs systemization and mechanization.

3. Give few examples for data structures? 
Stacks, Queue, Linked list, Trees, graphs

4. What is problem definition phase? 
The first step in solving a problem is to understand problem clearly. Hence, the first phase is the problem definition phase. That is, to extract the task from the problem statement. If the problem is not understood, then the solution will not be correct and it may result in wastage of time and effort.

5. Define Algorithm? 
Algorithm is a solution to a problem independent of programming language. It consist of set of finite steps which, when carried out for a given set of inputs, produce the corresponding output and terminate in a finite time.



6. Define Program? 
Set of instructions to find the solution to a problem. It is expressed in a programming language in an explicit and unambiguous manner.

7. Mention how similarities among the problems are used in problem solving? 
This method is used to find out if a problem of this sort has been already solved and to adopt a similar method in solving the problem. The contribution of experience in the previous problem with help and enhance the method of problem for the current problem.


8. What is working backward from the solution? 
When we have a solution to the problem then we have to work backward to find the starting condition. Even a guess can take us to the starting of the problem. This is very important to sytematize the investigation to avoid duplication of our effort.

9. Mention some of the problem solving strategies? 
The most widely strategies are listed below
Divide and conquer
Binary doubling strategy
Dynamic programming


10. What is divide and conquer method? 
The basic idea is to divide the problem into several sub problems beyond which cannot be further subdivided. Then solve the sub problems efficiently and join then together to get the solution for the main problem.