Abstract Data Types, Data Structure & Algorithms

A useful tool which is used for specifying the logical properties of a data type is called the abstract data type or ADT. The term "abstract data type" refers to the fundamental mathematical concept which defines the data type. In defining ADT as a mathematical concept, we are not concerned or worried about space or time efficiency.

An ADT comprises of two parts:- which are value definition and operator definition. The value definition defines the collection of the values for the ADT and contains two parts: one is definition clause and the other is condition clause. For example, the value consist definition for the ADT RATIONAL states that a RATIONAL value contains two integers, the second of which is not equal to 0. We apply array notation to indicate the parts of an abstract type.

 

 

 

 

Posted Date: 7/10/2012 6:03:32 AM | Location : United States







Related Discussions:- Abstract Data Types, Assignment Help, Ask Question on Abstract Data Types, Get Answer, Expert's Help, Abstract Data Types Discussions

Write discussion on Abstract Data Types
Your posts are moderated
Related Questions
Explain the term totalling To add up a series numbers the subsequent type of statement must be used: Total = total + number  This literally means (new) total = (old) t

Q. Write down an algorithm to merge the two sorted arrays into the third array. Do  not perform the sort function in the third array.                           Ans: void m

Operations on B-Trees Given are various operations which can be performed on B-Trees: Search Create Insert B-Tree does effort to minimize disk access and t

How sparse matrix stored in the memory of a computer?

Q. Write down any four applications or implementation of the stack.                                     Ans. (i)       The Conversion of infix to postfix form (ii)

Explain about Hidden-surface Hidden-line removal refers to wire-frame diagrams without surface rendering and polygonal surfaces with straight edges. Hidden-surface removal ref

Program segment for All pairs shortest paths algorithm AllPairsShortestPaths(int N, Matrix C, Matrix P, Matrix D) { int i, j, k if i = j then C[i][j] = 0  for ( i =

how multiple stacks can be implemented using one dimensional array

AVL tree An AVL tree is a binary search tree in which the height of the left and right subtree of the root vary by at most 1 and in which the left and right subtrees are again

What is Space complexity of an algorithm? Explain.