Data type, abstract data type and significance, Data Structure & Algorithms

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


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

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
Related Questions
Q. What do you understand by the term by hash clash? Explain in detail any one method to resolve the hash collisions.

explain quick sort algorithm

You are given an undirected graph G = (V, E) in which the edge weights are highly restricted. In particular, each edge has a positive integer weight of either {1,2,...,W}, where W

Initially Nodes are inserted in an AVL tree in the same manner as an ordinary binary search tree. Though, the insertion algorithm for any AVL tree travels back along with the pa

What are the properties of an algorithsm?

The information in the table below is available for a large fund-raising project. a. Determine the critical path and the expected completion time of the project. b. Plot the total

Data records are stored in some particular sequence e.g., order of arrival value of key field etc. Records of sequential file cannot be randomly accessed i.e., to access the n th

Q. Construct a complete binary tree with depth 3 for this tree which is maintained in the memory using the linked representation. Make the adjacency list and adjacency matrix for t

Inorder traversal: The left sub tree is visited, then the node and then right sub-tree. Algorithm for inorder traversal is following: traverse left sub-tree visit node

* Initialise d & pi* for each vertex v within V( g ) g.d[v] := infinity  g.pi[v] := nil g.d[s] := 0; * Set S to empty * S := { 0 }  Q := V(g) * While (V-S)