Question

can some help me with this? i have no ideaaa lol

Use examples to discuss the differences between general purpose data structure and abstract data types (you can choose one general purpose data structure and one abstract data type in Discussion).

Answer 1

An abstract datatype is an interface. It is defined by what operations it will support. It doesn't specify what datastructure or algorithmic technique will be used to provide those operations.

For example, there may be different ideas that can be used to implement a queue..It may be a circular queue, a linked list based queue, a queue based on two stacks..etc... A priority queue might be implemented with any one of the many types of heaps or BST's.

A linked list is a specific data structure, not just a specification of what operations will be supported. It would be probably more accurate to say that a linked is a category of data structures.

ADT's will specify only what the interface will be and nothing about what techniques will be used.

Hope this helps u.. :)