Stack Implementation

Stack can be implemented in two ways;

1.      Static implementation.      

2.      Dynamic implementation

                  Static implementation uses arrays to create stack. Static implementation though a very simple technique but is not a flexible way of creation as the size of stack has to be declared during program design, after that the size cannot be varied. Moreover static implementing is not too efficient with respect to memory utilization. As the declaration of array (for implementing stack)  is done before the start of the operation (at program design time) now if  there are too few elements to be stored in the stack the statically allocated memory will be wasted on the other hand if there are more number of elements to be elements to be stored in the stack then we can't be able to change the size of array to increase its capacity so that it can  accommodate new elements.

                  Dynamic implementation is also called linked list representation and uses pointers to implement the stack type of data structure.

Data Structure & Algorithms Assignment Help, Live Experts 

Struggling with data structure problems? Data structure subject is quite tough to learn? Need quick assistance in data structure questions? ExpertsMind.com is right place for you where your search ends, We at ExpertsMind offer online data structure assignment help, data structure homework help and data structure and algorithms question's answers by best online support by qualified tutors.

ExpertsMind.com - Stack Implementation Assignment Help, Stack Implementation Homework Help, Stack Implementation Assignment Tutors, Stack Implementation Solutions, Stack Implementation Answers, Stack Assignment Tutors