Data Structures and Algorithms

What are Data Structures ? 

In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.Data structures provide a means to manage large amounts of data efficiently, such as large databases and internet indexing services. Usually, efficient data structures are a key to designing efficient algorithms.

A Data Structure D is a triplet i.e. D = (D' , F' , A' )

                                        where,

                                                   D'  is a set of Data Object

                                                   F'  is a set of Functions

                                                   A'  is a set of rules to implement the functions          

What dou you mean by the term 'Algorithm' ?

An algorithm is a finite set of instructions which if followed, accomplish a particular task.In addition, every algorithm must satisfy the following criteria:

• Input : There are zero or more quantities which are supplied externally.
• Output : Atleast one quantity is produced.
• Definitions : Each instruction must be clear and unambiguous.
• Finiteness
• Effectiveness 

                                            OR

In an essence, an algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function.