Some have stated that linked Stacks are much better than arrays; others said that Queues are mostly used than arrays are. If that is always valid, then why are arrays used at all? As a conclusion of what you have learnt about them, you are asked to compare Arrays with Stacks and Queues in terms of some areas. The below table includes 4 questions to be answered comparing between the three data structures. You are asked to complete this table with the proper answer, based on your knowledge and your research, and using your own words Case QUEUES ARRAYS STACKS Which principle is used? FIFO-LIFO- INDEXED, with a brief explanation. How do deletion/insertion take place? Dynamic or fixed size? For which problems they are the Best to use?
Some have stated that linked Stacks are much better than arrays; others said that Queues are mostly used than arrays are. If that is always valid, then why are arrays used at all?
As a conclusion of what you have learnt about them, you are asked to compare Arrays with Stacks and Queues in terms of some areas. The below table includes 4 questions to be answered comparing between the three data structures. You are asked to complete this table with the proper answer, based on your knowledge and your research, and using your own words
Case |
QUEUES |
ARRAYS |
STACKS |
|
Which principle is used? FIFO-LIFO- INDEXED, with a brief explanation. |
||||
How do deletion/insertion take place? |
||||
Dynamic or fixed size? |
||||
For which problems they are the Best to use? |
Step by step
Solved in 3 steps