What does abstract data type means?
Answer Posted / ravi shikharhcu
Abstract data type is a specification of data types having
some defined set of operations and which are independent of
their implementation.
example :stack is an Abstract data type.but stack
implemented with an array and with linked list are both
different data structures.
| Is This Answer Correct ? | 136 Yes | 19 No |
Post New Answer View All Answers
What is the Difference between treemap and hashmap?
Where is data structure used?
Which is faster hashmap or treemap?
Does array sort mutate?
List the data structures which are used in rdbms, network data modal, and hierarchical data model.
Explain implementation of traversal of a binary tree.
Why you need a data structure?
Explain about map and their types?
Write is a binary search tree? Write an algorithm and tell complexity?
Define left-in threaded tree?
Which interfaces are implemented by printerstatereasons?
When is a binary search algorithm best applied?
How many sorting are there in data structure?
In what data structures are pointers applied?
Why insertion is faster in linked list?