19,457 views
43 votes
43 votes

An Abstract Data Type (ADT) is:

  1. same as an abstract class
  2. a data type that cannot be instantiated
  3. a data type for which only the operations defined on it can be used, but none else
  4. all of the above

8 Answers

0 votes
0 votes

Option B is false.

Some algorithms need to create new instances of some ADT (such as new variables, or new stacks). To describe such algorithms, one usually includes in the ADT definition a create() operation that yields an instance of the ADT, usually with axioms equivalent to

  • the result of create() is distinct from any instance in use by the algorithm.

This axiom may be strengthened to exclude also partial aliasing with other instances. On the other hand, this axiom still allows implementations of create() to yield a previously created instance that has become inaccessible to the program.

https://en.wikipedia.org/wiki/Abstract_data_type

0 votes
0 votes
Abstract Data Type is an data structure type which supports operations to be performed on a Data Structure for example Queue provides Enqueue to add element into it and Dequeue to perform deletion of the element from the Data Structure
–2 votes
–2 votes
D. all of the above
Answer:

Related questions

22 votes
22 votes
8 answers
1
Kathleen asked Sep 22, 2014
23,111 views
In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal node is:$nk$$(n-1)k + 1$$n(k-1) +1$$n(k-1)...
31 votes
31 votes
4 answers
2
Kathleen asked Sep 22, 2014
24,480 views
How many distinct binary search trees can be created out of $4$ distinct keys?$5$$14$$24$$42$
20 votes
20 votes
1 answer
3
Kathleen asked Sep 22, 2014
14,018 views
A priority queue is implemented as a Max-Heap. Initially, it has $5$ elements. The level-order traversal of the heap is: $10, 8, 5, 3, 2$. Two new elements $1$ and $7$ ar...
22 votes
22 votes
3 answers
4