Q. Define the terms data type and abstract data type. Comment upon the significance of both these.  

Ans:

We determine the total amount of memory to reserve by determining the suitable abstract data type group to use and then deciding which abstract data type within the group is correct for the data.

There are four data type groups which are stated as follows:

1.   The Integer Stores the whole numbers or the signed numbers.

2.   The Floating-point Stores the real numbers (i.e. fractional value). Ideal for storing bank deposits where pennies (fractions of a dollar) can quickly add up to a few dollars easily.

3.   The Character Stores a character. It is perfect for storing names of things.

4.   The Boolean Stores the true or false value. The right choice for storing a yes or no  or simply true or false values response to a question.

The Abstract Data Types:-

It is a useful tool which is used for specifying the logical properties of the data type is the abstract data type or ADT. The "abstract data type" refers to the basic mathematical or calculation concept which defines the data type. In defining ADT as a mathematical concept, space or time efficiency does not matter at all.

An ADT is of two parts:-
i) a value definition
ii) an operator definition.
The value of definition defines the collection of values for the ADT and consists of two parts:
i) a definition clause
ii) a condition clause.
The value consist definition for the ADT RATIONAL says that a RATIONAL value comprises of the two integers, the second of which is not equal to 0. Hear we use array notation to point out the parts of an abstract type.

Posted Date: 7/11/2012 1:17:04 AM | Location : United States

Ask an Expert

Related Discussions:- Data type, abstract data type and significance, Assignment Help, Ask Question on Data type, abstract data type and significance, Get Answer, Expert's Help, Data type, abstract data type and significance Discussions

Write discussion on Data type, abstract data type and significance
Your posts are moderated

Write your message here..

Related Questions

Program segment for deletion of any element from the queue, Program segment... Program segment for deletion of any element from the queue delete() { int delvalue = 0; if (front == NULL) printf("Queue Empty"); { delvalue = front->value;

Implement an open hash table, In a chained hash table, each table entry is ... In a chained hash table, each table entry is a pointer to a collection of elements. It can be any collection that supports insert, remove, and find, but is commonly a linked list.

Search on a heap file, Consider the file " search_2013 ". This is a text fi... Consider the file " search_2013 ". This is a text file containingsearch key values; each entry is a particular ID (in the schema given above). You are tosimulate searching over a h

Algorithm for determining who won rock paper scissors game, Suppose you are... Suppose you are given the results of 5 games of rock-paper-scissors. The results are given to you on separate pieces of paper; each piece says either 'A' if the first person won, o

Efficient way of storing two symmetric matrices, Explain an efficient way o... Explain an efficient way of storing two symmetric matrices of the same order in memory. A n-square matrix array is said to be symmetric if a[j][k]=a[k][j] for all j and k. For

Complexity of algorithm, The simplest implementation of the Dijkstra's algo... The simplest implementation of the Dijkstra's algorithm stores vertices of set Q into an ordinary linked list or array, and operation Extract-Min(Q) is just a linear search through

Prims algorithm, Prim's algorithm employs the concept of sets. Rather than ... Prim's algorithm employs the concept of sets. Rather than processing the graph by sorted order of edges, this algorithm processes the edges within the graph randomly by building up

Tower of hanoi, how do we use 4-discs stack to solve tower of hanoi problem... how do we use 4-discs stack to solve tower of hanoi problem and write an algorithm to solve it?

Find longest repeat prefix of string - linear time algorithm, 1. A string s... 1. A string s is said to be periodic with a period α, if s is α k for some k > 2. (Note that α k is the string formed by concatenating k times.) A DNA sequence s is called a tand

Applications in file systems of avl trees, 1. In computer science, a classi... 1. In computer science, a classic problem is how to dynamically store information so as to let for quick look up. This searching problem arises frequently in dictionaries, symbol t