What is a linear implementation? What kind of implementation of the ADT table is

Question

1. What is a linear implementation?
2. What kind of implementation of the ADT table is appropriate for retrieval-dominated applications, if the maximum size of the table is known? Why?
3. What kind of implementation of the ADT table is appropriate for retrieval-dominated applications if the maximum size of the table is NOT known?
4. What are the advantages of a linear implementation of the ADT table over a binary search tree implementation?
5. In an array-based implementation of the priority queue, where is the item with the highest priority value located?

Explanation / Answer

1 Ans: Since an array or a linked list represents items one after another, these

implementations are called linear.

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.