What is ADT (Abstract Data Type)?

  • Thread starter Thread starter sadaf2605
  • Start date Start date
  • Tags Tags
    Data Type
AI Thread Summary
An Abstract Data Type (ADT) is primarily an interface that defines a set of methods for implementing various data structures. It allows for the encapsulation of data and operations, often using generic types to provide flexibility in specifying data types. While ADTs share similarities with abstract classes in object-oriented programming, they focus more on the behavior and operations of data structures rather than the implementation details. Understanding ADTs is essential for effectively utilizing data structures in programming.
sadaf2605
Messages
13
Reaction score
0
What is ADT: Abstract Data Type?
is it like Abstract Classes?

The more i am searching for it i am getting lost! So please help!

Thanks in an advance!
 
Technology news on Phys.org
sadaf2605 said:
What is ADT: Abstract Data Type?
is it like Abstract Classes?

The more i am searching for it i am getting lost! So please help!

Thanks in an advance!

Hey sadaf2605 and welcome to the forums.

Have you checked Wikipedia?

http://en.wikipedia.org/wiki/Abstract_data_type
 
An Abstract Data Type is usually an interface which holds methods for an implementation of a Data structure. There are different ADTs available to implement different data structures. ADTs usually hold <E>, Generic variable type, so the user may or may not specify the Data Type of the data structure that is being implemented from the ADT..
 
Dear Peeps I have posted a few questions about programing on this sectio of the PF forum. I want to ask you veterans how you folks learn program in assembly and about computer architecture for the x86 family. In addition to finish learning C, I am also reading the book From bits to Gates to C and Beyond. In the book, it uses the mini LC3 assembly language. I also have books on assembly programming and computer architecture. The few famous ones i have are Computer Organization and...
I had a Microsoft Technical interview this past Friday, the question I was asked was this : How do you find the middle value for a dataset that is too big to fit in RAM? I was not able to figure this out during the interview, but I have been look in this all weekend and I read something online that said it can be done at O(N) using something called the counting sort histogram algorithm ( I did not learn that in my advanced data structures and algorithms class). I have watched some youtube...
Back
Top