COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
the details of how the data is represented in the computer are hidden
|
|
|
each piece of data is broken down into its binary equivalent
|
|
|
all the bytes of data are placed in an abstract tree structure for easy retrieval
|
|
|
the concept of how data is contained is philosophically approached
|
Detailed explanation-1: -Data abstraction is similar in character to functional abstraction. When we create a functional abstraction, the details of how a function is implemented can be suppressed, and the particular function itself can be replaced by any other function with the same overall behavior.
Detailed explanation-2: -Key Differences between Abstraction and Data Hiding Abstraction shows only the essential information and hides the non-essential details. On the other hand, data hiding is used to hide the data from the components of the program by ensuring exclusive data access to class members.
Detailed explanation-3: -Data abstraction is the reduction of a particular body of data to a simplified representation of the whole. Abstraction, in general, is the process of removing characteristics from something to reduce it to a set of essential elements.
Detailed explanation-4: -Definition. Data hiding is the process that ensures exclusive data access to class members and provides object integrity by preventing unintended or intended changes. Abstraction, on the other hand, is an OOP concept that hides the implementation details and shows only the functionality to the user.