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

Assignment Help:

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.


Related Discussions:- Data type, abstract data type and significance

Deletion from a red-black tree, Deletion in a RBT uses two main processes, ...

Deletion in a RBT uses two main processes, namely, Procedure 1: This is utilized to delete an element in a given Red-Black Tree. It involves the method of deletion utilized in

Explain floyds algorithm, Explain Floyd's algorithm It is convenient to...

Explain Floyd's algorithm It is convenient to record the lengths of shortest paths in an n by n matrix D known as the  distance matrix: the element d ij   in the i th   row an

Bubble sort, Q. The reason bubble sort algorithm is inefficient is that it ...

Q. The reason bubble sort algorithm is inefficient is that it continues execution even after an array is sorted by performing unnecessary comparisons. Therefore, the number of comp

State the complex reallocation procedure, State the complex reallocation pr...

State the complex reallocation procedure Some languages provide arrays whose sizes are established at run-time and can change during execution. These dynamic arrays have an in

Minimum cost spanning trees, A spanning tree of any graph is only a subgrap...

A spanning tree of any graph is only a subgraph that keeps all the vertices and is a tree (having no cycle). A graph might have many spanning trees. Figure: A Graph

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

Complexity of quick sort, Q. What do you mean by the best case complexity o...

Q. What do you mean by the best case complexity of quick sort and outline why it is so. How would its worst case behaviour arise?

Write algorithm for post-order traversal, P os t - o r d e r T ...

P os t - o r d e r T r av er sal :  This can be done by both iteratively and recursively. The iterative solution would require a modification or alteration of the in-

Explain np-complete decision problem, a. Determine the result of inserting ...

a. Determine the result of inserting the keys 4,19, 17, 11, 3, 12, 8, 20, 22, 23, 13, 18, 14, 16, 1, 2, 24, 25, 26, 5 in order to an empty B-Tree of degree 3. Only draw the configu

Example of back face detection method, Example of Back Face Detection Metho...

Example of Back Face Detection Method To illustrate the method, we shall start with the tetrahedron (pyramid) PQRS of     Figure with vertices P (1, 1, 2), Q (3, 2, 3), R (1,

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd