Describe the process of analyzing the Big O Notation for a Stack or Queue

Stack is a data structure which follows Last In First Out method.

If we want to search, we need to search all the elements in stack which takes n in worst case

Following 3 operations are performed on the top of the stack and hence takes O(1) complexity

push - pushes element into stack

pop - removes first element

peek - shows the top element

QUEUE	WORST CASE	AVERAGE CASE	BEST CASE

MEMORY ALLOCATION ANALYSIS

STACK

QUEUE

RAM MEMORY

STACK MEMORY

HEAP MEMORY

VIRTUAL MEMORY

CPU Memory Management Disk Virtual Cache Ram Storage 2000 How Stuff Works, Inc