Interested to Buy Any Domain ? << Click Here >> for more details...
What does abstract data type means?
- 23 Answers
- 86907 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
Does arraylist have a tostring?
Who created quicksort?
How would you dynamically allocate a one-dimensional and two-dimensional array of integers?
Is it possible to insert different type of elements in a stack? How?
What is the function of stack?
Differentiate between iterable and iterator.
Define linear data structures?
What is frozenset?
What is a map programming?
Which interface treemap implements?
Does concat mutate array?
How can you insert a node in a random location of the linked list?
How to reverse a singly linked list?
Write the steps involved in the insertion and deletion of an element in the stack.
What are the objectives of studying data structures?
