//Data Structure And Algorigthm In C Programming

 Algorithm Analysis Analysis of algorithm is the determination of  the amount of time and space resources required to execute it . An Algorithm analysis is technique that is used to measure the performance of the algorithms. Characteristics Of Algorithm Input: An algorithm takes zero or more inputs. Output: An algorithm genearates one or more outputs. at least one output. Finiteness: Algorithm must be terminate after finite numbers of steps for all cases. Definiteness: Each step of an algorithm must be percisely define. Effectiveness: Each instruction must be sufficiently basic, then it can be done exactly and in finte time by a person using only paper and pencil. Running Time Analysis It is the processing time us size of the input. The input may be of different types based on problems. Common inputs are: Size of array. Number of element in a matrix. Polynomial degree. Numbers of bits in binary repersentation. Edges and vertices in a graph. Performance Of Analysis: Space Complexity :-

 Abstract Data Type (ADT): ADT define as "A Mathematical model of the data objects that make up a data type as well as the functions that operates on these objects". Structured data type which may be a combination or collection of basic data types with a set of properties and legal operationsthat may be performed on it by programmer. Programmers own data type is termes as Abstract Data Type (ADT).                             ADT = Type + Function Names + Behavior Of Each Function An Abstract Data Type Includes: Domain:  A collection of data. Functions: A set of operations on the data or subset odfdata. Axioms: A set of axioms, or rules of behavior governing the interaction of operations. Advantages of ADT: ADT is reusable and ensures robust data structure. Encapsulation ensuers that data can not be corrupted. It reduces coding efforts. The ADT is a useful guideline to implements and a useful and a useful tool to programmers who wish to use the data type correctly. Implementat

Basic Concept Of Data Strcuture ⫸  Data :          Data is input given to a system, which is the system processes. thus data is row , unprocessed input given to system.                                           DATA======>>>SYSTEM=====>>>OUTPUT   Types of Data 1]Atomic Data:          It's  a single or non-decomposable entity.          ex; character 'a'                  numeric '10' 2]Composite Data:          Grouped data item which consist of  sub-fields of which is atomic.          ex;  Phone Number ⫸ Data Types: The set of values and the set of operations that operate on those values. The data storage format that a variable  can store data to perform a specific operation Types Of Data Types: 1] Built-In Data Type          The data types provide by programming language are known as built-in data types. 2] User-Defined Data Type          Those data types which are defined by the user as per his requierments are called as user-defined               

  Types Of Data Structure:- ⫸ Primitive Data Structure:- These are basic structure and directly operated by machine instruction. They have different representation on different computers. These built in data structure.  Example:- Integer, Float, Character. ⫸ Non-Primitive Data Structure:- These are derived from the primitive data structure. It's a collection of same type of or different type primitive data structure. They are in composite nature. They emphasize a grouping of same or different data items, with relationship between each item. Linear Data Structure:- A Data structure is linear when all the element are arranged in a linear(sequential) order. They are mapping is one dimensional. The elements have 1-1 relationship.                    Example :- ➤  Array                                          ➤  Linked List ➤  Stack                                          ➤  Queue Non-Linear Data Structure:- A Data structure is linear when all the element are arranged in a linear(seque