In town: 5-8 seconds
On highways: 10-20 seconds
Answer:
Me
Explanation:
Its really just a waste of time since I have no motivation to do any of it , so I just use this site. Though I can't really do that on a DBQ for my AP class , so I am just going to wither away now.
Answer:
All three of them are linear Data Structures.
A stack is a FILO(First In Last Out) or LIFO(Last In First Out) type data structure means first inserted element will be the last one to be removed form the stack.Insertion and Deletion is from one end only called head.
ex:-A stack of books on the shelf.
A queue is FIFO(First In First Out) type means the first inserted element will be the first one to be removed.In queue insertion is from the back or tail and removal of elements is done form the front.
ex:-A queue at the ticket counter.
In array each element stored is given an index, by which we can be access the element very easily. We can use this index to modify or store element at that index of the array. i.e any object can be accessed with the right index, unlike queue and stack.
We can access only the front and back in the queue.In stack we can access only the top but in array we can access any element with the index.
