Question

Choose the data structure from the list at right that best represents the description at left. Last item added is the first to be removed java.util collections calls this a Map [Choose ] Priority Queue Bag SortedArrayList ArrayList Stack Expression Tree Queue Iterator Binary Search Tree Heap Hash Table Dictionary First item added is the first to be removed Your computer operating system uses one manage processes and job requests when resources are tight. Combines the idea of linked nodes with the binary search algorithm [Choose] A SortedArrayList could inherit all the code from this class [Choose] 4 A standard way to access all items in a collection class [Choose] Is not required to maintain any particular ordering of the items it contains [Choose] Uses Arrays.binary Search to locate items [Choose] Uses a complicated math formula to locate an item it contains Choose ]

I need this ASAP please

Answer 1

Refer to the image for all the answers:

Anso (1) Last item added is the first » Stack to be removed. 2) jana, wil collections calls this Dictionary a map 3) First idem added is the first Queue to be removed. 4) Your compuky syltem uses one Priority queue to manage proceses e gob neajuests when resources are right 5) Combines the idea of linked Binary search tree nodes with hiroxy search algorithm GJA Sorted Axxaylist could inhexit -> Ansaylist. all the code from this class A Standard way to access all Iterator items in a collection class & 98 not reajuised to maintin Bag any particular ordering of the etenns lit contring. 9) Uses Aranycobrany Search for Sorted Asocylist loute items 10) Used a complicated math formula Hashitable CS$cannell with cascolorate an item of coñdin.