Assuming each reference costs 1 byte, and each piece of data/info costs 1 byte as well. When will a doubly linked list be more a

Question

4 years ago

12

Assuming each reference costs 1 byte, and each piece of data/info costs 1 byte as well. When will a doubly linked list be more a

ppropriate when space cost is the most important thing in our decision making process comparing to a 256 element array? Show your analysis on how you reached to the conclusion.

Computers and Technology

1 answer:

NeX [460] · Answer 1 · 2021-12-14T21:29:31+03:00

Answer:

The circular individually linked list is more efficient for time sharing process ,when multiple application are running on pc it is responsibility of an output system to put all process on a list and execute them all by giving them piece of time and make them wait when cpu is selected to other process.

It will be more suitable for output system to use circular list as when it reaches to last of list it will be manually reaches to starting node or process.

Singly circular linked list is used when we are concerned with the memory as only one process will be allocated memory at once and there are no chances of process to go never-ending waiting.

Explanation: