A Stack has an ordered list of elements & an array is also utilized to store ordered list of elements. Therefore, it would be very simple to manage a stack by using an array. Though, the problem along with an array is that we are needed to declare the size of the array before using it in a program. Thus, the size of stack would be fixed. However, an array & a stack are completely different data structures, an array may be utilized to store the elements of a stack. We may declare the array along a maximum size large sufficient to manage a stack. Program1 implements a stack by using an array.

Posted Date: 4/10/2013 1:03:42 AM | Location : United States

Ask an Expert

Related Discussions:- Implementation of stack using arrays, Assignment Help, Ask Question on Implementation of stack using arrays, Get Answer, Expert's Help, Implementation of stack using arrays Discussions

Write discussion on Implementation of stack using arrays
Your posts are moderated

Write your message here..

Related Questions

#, if two relations R and S are joined, then the non matching tuples of bot... if two relations R and S are joined, then the non matching tuples of both R and S are ignored in

Which data structure is used for implementing recursion, Which data structu... Which data structure is used for implementing recursion Stack.

Several operations on a aa-tree, The following are several operations on a ... The following are several operations on a AA-tree: 1. Searching: Searching is done using an algorithm which is similar to the search algorithm of a binary search tree. 2. Ins

Hashing and hash functions, Q. Describe the term hashing. Explain any two u... Q. Describe the term hashing. Explain any two usually used hash functions. Explain one method of collision resolution.

Explain critical path and chain, 1.  Using the traditional method of CPM: ... 1.  Using the traditional method of CPM: a.  What activities are on the critical path? b.  What is the expected total lead time of the project? 2.  Using CCPM: a.  What

Abstract data type- queue, A significant aspect of Abstract Data Types is t... A significant aspect of Abstract Data Types is that they explain the properties of a data structure without specifying the details of its implementation. The properties might be im

Insertion sort, Data array A has data series from 1,000,000 to 1 with step ... Data array A has data series from 1,000,000 to 1 with step size 1, which is in perfect decreasing order. Data array B has data series from 1 to 1,000,000, which is in random order.

Representation of arrays?, A representation of an array structure is a mapp... A representation of an array structure is a mapping of the (abstract) array with elements of type T onto the store which is an array with elements of type BYTE. The array could be

B-TREE and AVL tree diffrance, Explain process of B-TREE and what differen... Explain process of B-TREE and what difference between AVL Tree Using Algorithms

Analyze an algorithm, In order to analyze an algorithm is to find out the a... In order to analyze an algorithm is to find out the amount of resources (like time & storage) that are utilized to execute. Mostly algorithms are designed to work along with inputs