Critique the application of both stacks and queues in algorithm design, determining which data structure could potentially cause inefficient memory use in a scenario where the size of the dataset is unknown.

Question $17$Answer

a$.$

Queues could potentially cause inefficient memory use in such a scenario if they are implemented with dynamic arrays and require frequent resizing.

b$.$

Stacks will always cause inefficient memory use due to their LIFO nature regardless of the size of the dataset.

c$.$

Doubly linked lists are more memory inefficient neither stacks nor queues if the dataset size is unknown.

d$.$

Both stacks and queues are equally efficient in memory use since they both operate on the principle of locality of reference.