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

Branch and bound algorithm, Suppose we have a set of N agents and a set of ... Suppose we have a set of N agents and a set of N tasks.Each agent can only perform exactly one task and there is a cost associated with each assignment. We would like to find out a

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

Pest control program, PART- Pest Control Program Prepare a Pest Contro... PART- Pest Control Program Prepare a Pest Control Program for the facility that will address the management of Rodents, Insects and Birds. Your Pest Control Program should

Design and implement a software system, In this assignment, you are invited... In this assignment, you are invited to design and implement a software system for catalogue sale. A catalogue is organised in a tree structure. Each node of the catalogue tree repr

The complexity of searching an element, The complexity of searching an elem... The complexity of searching an element from a set of n elements using Binary search algorithm is   O(log n)

Operation of algorithm, Operation of Algorithm The following sequence o... Operation of Algorithm The following sequence of diagrams shows the operation of Dijkstra's Algorithm. The bold vertices show the vertex to which shortest path has been find ou

Explain merge sort, Merge sort: Merge sort is a sorting algorithm that ... Merge sort: Merge sort is a sorting algorithm that uses the idea of split and conquers. This algorithm splits the array into two halves, sorts them separately and then merges t

Briefly explain the prim''s algorithm, Question 1 Describe the following- ... Question 1 Describe the following- Well known Sorting Algorithms Divide and Conquer Techniques Question 2 Describe in your own words the different asymptotic func

Write down the algorithm of quick sort, Write down the algorithm of quick s... Write down the algorithm of quick sort. An algorithm for quick sort: void quicksort ( int a[ ], int lower, int upper ) {  int i ;  if ( upper > lower ) {   i = split ( a,

Define complete binary tree, Define Complete Binary Tree Complete Binar... Define Complete Binary Tree Complete Binary Tree:- A whole binary tree of depth d is that strictly binary tree all of whose leaves are at level D.