Interested to Buy Any Domain ? << Click Here >> for more details...
What does abstract data type means?
- 23 Answers
- 87832 Views
- College School Exams Tests, Infosys, SBIT, TCS, I also Faced
- E-Mail Answers
Answer Posted / sanjeev kumar
In computer science, an abstract data type (ADT) is a
mathematical model for a certain class of data structures
that have similar behavior; or for certain data types of
one or more programming languages that have similar
semantics. An abstract data type is defined indirectly,
only by the operations that may be performed on it and by
mathematical constraints on the effects (and possibly cost)
of those operations.[1]
For example, an abstract stack data structure could be
defined by three operations: push, that inserts some data
item onto the structure, pop, that extracts an item from it
(with the constraint that each pop always returns the most
recently pushed item that has not been popped yet), and
peek, that allows data on top of the structure to be
examined without removal. When analyzing the efficiency of
algorithms that use stacks, one may also specify that all
operations take the same time no matter how many items have
been pushed into the stack, and that the stack uses a
constant amount of storage for each element.
| Is This Answer Correct ? | 1 Yes | 1 No |
Post New Answer View All Answers
How do you do a selection sort?
Explain quick sort and merge sort algorithms.
How to compare Two Arrays?
What do you mean by sorting data?
What are some of the best practices relating to the java collection framework?
What is the difference between set and unordered_set?
Does treemap allow null key?
What is a matrix?
List out the disadvantages of using a linked list?
What do you understand by stable sort?
What are two types of sorting?
Is array size dynamic or fixed?
What is a height of a tree?
What is the easiest sorting method to use in data structures?
What is array and structure?
