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
State the different types of linked lists?
What is meant by binary tree traversal?
an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].
What is the difference between adt and data structure?
Which interface treemap implements?
In what areas do data structures are applied?
How do you clear a stack?
Define distributed query and linked server?
How to get top two numbers from an array?
Define red-black trees.
Define the queue data structure.
Define double linked list?
Where is data structure used?
What does list clear do?
Is duplicate allowed in hashmap?