What does abstract data type means?
- 23 Answers
- 80936 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
What are control structures?
What does the dummy header in linked list contain?
Describe the height term in a tree.
Can you store different types in an array?
How does linkedhashset work internally?
Why do we use data structures?
List the applications of queues?
Explain Stack
What are the different types of sorting in data structure?
How to sort an Array?
What is sorting with example?
What is faster array or arraylist?
Write a program to sum values of given array.
What are the categories of avl rotations?
Why is data structure important?
