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

Demonstration of polynomial using linked list, Demonstration of Polynomial ...

Demonstration of Polynomial using Linked List # include # include Struct link { Char sign; intcoef; int expo; struct link *next; }; Typedefstruct link

Illustrate the intervals in mathematics, Illustrate the intervals in mathem...

Illustrate the intervals in mathematics Carrier set of a Range of T is the set of all sets of values v ∈ T such that for some start value s ∈ T and end value e ∈ T, either s ≤

Write down any four applications of queues, Write down any four application...

Write down any four applications of queues.            Application of Queue (i)  Queue is used in time sharing system in which programs with the similar priority form a queu

Describe commonly used asymptotic notations, Q.1 Compare two functions n 2 ...

Q.1 Compare two functions n 2 and 2 n for various values of n. Determine when second becomes larger than first. Q.2 Why do we use asymptotic notation in the study of algorit

Explain the prim''s minimum spanning tree algorithm, Question 1. Explai...

Question 1. Explain the different types of traversal on binary tree 2. Explain the Prim's minimum spanning tree algorithm 3. Differentiate fixed and variable storage allo

Arrays and pointers, C compiler does not verify the bounds of arrays. It is...

C compiler does not verify the bounds of arrays. It is your job to do the essential work for checking boundaries wherever required. One of the most common arrays is a string tha

Header linked list, creation,insertion,deletion of header linked list using...

creation,insertion,deletion of header linked list using c.

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

Binary search trees, In this unit, we discussed Binary Search Trees, AVL tr...

In this unit, we discussed Binary Search Trees, AVL trees and B-trees. The outstanding feature of Binary Search Trees is that all of the elements of the left subtree of the root

Efficient way of storing a sparse matrix in memory, Explain an efficient wa...

Explain an efficient way of storing a sparse matrix in memory.   A matrix in which number of zero entries are much higher than the number of non zero entries is called sparse mat

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