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
Define double hashing?
How do you represent a linked list?
How many links are there in a binary tree of N nodes?
Mention some drawbacks of the linked list.
How can we remove loops in a linked list? What are the functions of fast and slow pointers?
What is storage structure in data structure?
What is the difference between hashmap and arraylist?
Describe stack operation.
Can we store a string and integer together in an array?
How will you sort the elements of array in descending order?
Explain the internal working of a hash map?
Differentiate between queue and deque.
What is collection process?
Can we give size to arraylist?
Explain the expression trees?