Data Structures - PROBLEM SOLVING

1.Explain top-down design in detail? 

• Definition
• Breaking a problem in to subproblems
• Choice of a suitable data structure
• Constructions of loops
• Establishing initial conditions for loops
• Finding the iterative construct
• Terminations of loops


2. What are the steps taken to improve the efficiency of an algorithm? 
• Definition
• Redundant computations
• Referencing array elements
• Inefficiency due to late termination
• Early detection of desired output conditions
• Trading storage for efficiency gains

3. Design an algorithm fro sine function computation. Explain it with an example? 
• Algorithm development
• Algorithm description
• Pascal implementation
• Application

4. Design an algorithm for reversing the digit of an integer. Explain it with an example? 
• Algorithm development
• Algorithm description
• Pascal implementation
• Application

5. Design an algorithm for base conversion. Explain it with an example? 
• Algorithm development
• Algorithm description
• Pascal implementation
• Application