**Data Structures and Algorithms Using Java*** A. What is one advantage of a lin

Question

**Data Structures and Algorithms Using Java***

A. What is one advantage of a linked list structure over array-based structures?

B. What is one advantage of array-based structures over a linked list structure?

C. Explain the term “fragmented memory.”

D. What is “dynamic” about dynamic data structures?

E. What is the only condition that would cause the Insert operation of a dynamic data structure to return a “data structure full” error?

F. There are many types of linked lists; however, the nodes in all of them have one thing in common. What is it?

Explanation / Answer

A. Linked list doesn't have the fixed size i.e. dynamic sizing capacity whereas Array is fixed size. Also in linked we can easily add the new item into the list i.e. easy of insertion and deletion where as in array we have to create a room for new item and then we need add it then shift the elements to the new room like that.

B. Array structure has advantage over linked list when it comes to the Index access. Searching elements at specific positions is very easy than linked list's.

C. In general in computer storages data will be stored non continious. I.e data will not be stored in particular order results in leaving the bits and pieces of memory unused. This is called fragmentation.

D. In Dynamic Data Structuers it has flixibility to grow or shrink the memory needed by anything . It gives programmers more flexibility. Dynamic means it allocates or deallocates memory based on the usage of that block of memory or location.

E. When the structure has no memory to store the new item it throws the overflow exception.

F. In all the types of linked lists all the nodes will have the reference to the next node. This is the common thing.

Related Questions

Navigate

• Browse (All)
• Browse #
• Subjects

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