Frainlar Vibes

WHAT IS ADT? Abstract Data Type (ADT) is a mathematical model for data types where a data type is defined by its behavior from the user point of view of the data. In order to organize data, we use Abstract Data Types (ADT).  An Abstract Data Type may also defined as a class of objects whose logical behavior is defined by a set of values and a set of operations.  ADTs were first proposed by Barbara Liskov and Stephen N Zilles in 1974. ANALOGY WITH ALGEBRAIC STRUCTURES Abstract Data Type is analogous with Algebraic Structures in Mathematics. An Algebraic Structure on a set A is a collection of operations on A. The set A within this structure is called an Algebra. E.g., 'A+B' is defined as A+(B*C) When we compare, the data structure can be referred to the set A. The finitary operations done on set A can be referred to the operations done on Abstract Data Types. Examples of Algebraic structures are Groups, rings, fields, lattices, vector spaces, mod...

Hi folks, In this blog thread, I am going to explain the data structures that are considered to be the primitive elements of computing. Understanding and knowing about the Data Structure makes the Computer Science and IT professionals to get strengthened in logic and in building several complex systems efficiently. DATA STRUCTURE Data Structure is a systematic way to organize data to handle it efficiently. In other words, Data Structure can be defined as the method of organizing and storing data in a computer so that it can be accessed and modified efficiently. BASIC COMPONENTS OF A DATA STRUCTURE A Data Structure consists of three main components. They are collection of data values Relationships among them functions that can be applied to the data FOUNDATIONS OF A DATA STRUCTURE For a data structure, the two fundamental terms are as follows. They are Interface Implementation INTERFACE Each data structure has an interface. Interface repr...