Interested to Buy Any Domain ? << Click Here >> for more details...
What does abstract data type means?
- 23 Answers
- 86950 Views
- College School Exams Tests, Infosys, SBIT, TCS, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / rini
ADTs allows the creation of instances with well-defined properties and behaviour. In object-orientation ADTs are referred to as classes. Therefore a class defines properties of objects which are the instances in an object-oriented environment.
ADTs define functionality by putting main emphasis on the involved data, their structure, operations as well as axioms and preconditions. Consequently, object-oriented programming is ``programming with ADTs'': combining functionality of different ADTs to solve a problem. Therefore instances (objects) of ADTs (classes) are dynamically created, destroyed and used.
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / harjinder kaur
It is set of values and associated operations on those
values where implementation is hidden from the user.
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / sanjeev kumar
In computer science, an abstract data type (ADT) is a
mathematical model for a certain class of data structures
that have similar behavior; or for certain data types of
one or more programming languages that have similar
semantics. An abstract data type is defined indirectly,
only by the operations that may be performed on it and by
mathematical constraints on the effects (and possibly cost)
of those operations.[1]
For example, an abstract stack data structure could be
defined by three operations: push, that inserts some data
item onto the structure, pop, that extracts an item from it
(with the constraint that each pop always returns the most
recently pushed item that has not been popped yet), and
peek, that allows data on top of the structure to be
examined without removal. When analyzing the efficiency of
algorithms that use stacks, one may also specify that all
operations take the same time no matter how many items have
been pushed into the stack, and that the stack uses a
constant amount of storage for each element.
| Is This Answer Correct ? | 1 Yes | 1 No |
Answer / priyadarshee sahoo
it is auseful tool first specifying the logical ptoperty of
data type.the specification of data type includes values of
domain & operation on domain.
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / kadhar ali basha e
A set of data values and associated operations that are
precisely specified independent of any particular
implementation.
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / lebron james
abstract data types or (ADT)has no perfectly answer except
the who invented it..but for me, the abstract data types is
a questinable question..wish you could find the best answer!!!
| Is This Answer Correct ? | 0 Yes | 1 No |
Answer / satish
It is set of operations specified with the component of element of data structure and which is implementation independent.
| Is This Answer Correct ? | 1 Yes | 4 No |
Answer / amit
The code to read the keyboard is an ADT.
ADT
1.Declaration of data.
2.Declaration of operations
3.Encapsulation of data and operations.
it has a data structure,character,and aset of operations
that can be used to read the data structure,also convert it
into different data structures such as integers and strings.
| Is This Answer Correct ? | 3 Yes | 9 No |
Answer / vaibhav jain
classes uses the concept of data abstraction , known as
abstract data type (ADT) .
| Is This Answer Correct ? | 2 Yes | 8 No |
Answer / abhishek bharsakale
abstract data type means we can perform different operation
on object or on data
| Is This Answer Correct ? | 21 Yes | 31 No |
How do you do a heap sort?
What is the complexity of bubble sort?
Explain the term binding time?
What are splay trees?
List the abstract operations in the set?
Tell me how to find middle element of linked list in one pass?
Define tree edge?
List the data structures which are used in rdbms, network data modal, and hierarchical data model.
How to sort 1 million floating point numbers?
What are AVL trees?
what are the applications that use Linked lists?
1) Program A and B are analyzed and found to have worst- case running times no greater than 150nlog2n and n2 respectively.Answer the folloWing questions if possible.. i) which program has the better guarantee on the running time,for larger values of n(n>10000) ? ii) which program has the better guarantee on the running time,for small values of n(n<100) ? iii) which program will run faster on average for n =1000 2) wRite a program to compute the number of collisions required in a long random sequence of insertions using linear probing ,quadratic probing and double hashing 3) what is the optimal way to compute A1 A2 A3 A4 A5 A6 where the dimensions of the matrices are A1:10*20 A2 : 20 * 1 A3 : 1 * 40 A4 : 40*5 A5 : 5 * 30 A6 : 30 X 15
Windows 
