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...

Computing hardware is a platform for Information processing. In this blog, let us discuss on how the modern computers have been evolved. It's quite interesting, when we read the history of computing hardware. Software performance and capability increases exponentially. In order to compensate the growth of Software, hardware need to be improved for every 60 days. This statement is suggested by Moore. Let us walk through the detailed evolution of computing hardware from time to time in this blog I. FINGER COUNTING The Greco-Roman author Plutarch, in his lives, mentions finger counting as being used in Persia in the 1st century AD, so the source of the system ma lie in Iran. Thr practice was later used widely in medieval Islamic lands. II. TALLY STICK A tally stick was an ancient memory aid device used to record and document numbers, quantities or even messages.  There are two kinds of Tally Stick. They are Single Tally: The single tally stick was an el...

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...

'Foundations of Computing' blog thread gives the fundamental knowledge about Computers and Logical Computation required for Computer Science students.  In this blog, let us discuss about the basics of Computers. COMPUTER A computer is an electronic device that takes input, processes it according to stored instructions and produces results as output. ETYMOLOGY The word 'Computer' was used in 1613 in a book ' The Yong Mans Gleanings ' by Richard Braithwait. He mentioned in his book as follows 'I have read the truest computer of Times and the best Arithmetician that reduces days into a short number'. This term is used to refer a person who carried out calculations or computations. The word continued with the same meaning until 20th century.  BASIC FUNCTIONALITY Any Digital computer carries out the following functions: Take Data or Instructions as Input Stores the data/instructions in its memory and uses them a...