COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Data Structure
|
|
|
Data
|
|
|
Datatype
|
|
|
All the above
|
Detailed explanation-1: -A representation specifies how ADT values are stored in memory. ADTs isolate the data structure from its use. The algorithms specify how the operations of an ADT are implemented based on the chosen representation.
Detailed explanation-2: -Sets are a type of abstract data type that allows you to store a list of non-repeated values. Their name derives from the mathematical concept of finite sets. Unlike an array, sets are unordered and unindexed.
Detailed explanation-3: -Generally, we write these attributes and functions inside a class or a structure so that we can use an object of the class to use that particular abstract data type. Examples of abstract data types in data structure are list, stack, queue etc.
Detailed explanation-4: -ADT is called as Abstract because-A. It is collection of different data types.