What does abstract data type means?
Answer Posted / sabyasachi chakraborty
an abstract data type is defined as a mathematical model of
the data objects that make up a data type as well as the
functions that operate on these objects.
| Is This Answer Correct ? | 3 Yes | 1 No |
Post New Answer View All Answers
What is homogeneous array?
A lot of data structures related programs related to only trees and graphs, like the diameter of a tree, removing the loops in a graph etc.
How does a treemap work?
Can we search the data in a linked list?
What is difference between rb tree and avl tree?
How do you sort large data?
What will happen if an array goes out of bounds?
What is link list in data structure?
Can you use Bubble Sort To sort the number of elements.
What are the major data structures used in the network data model?
Is quicksort a stable algorithm?
Why is hashset not ordered?
Which is the simplest file structure? (a) Sequential (b) Indexed (c) Random (a) Sequential
What is time complexity of hashmap?
What is difference between set and map?