0
Stack is an abstract data type that allows you to input and output data in a way that the first data which was placed in the stack will be the last one to get out. We use physical examples of stack in our daily lives such as the stack of dishes or stack of coins where you only add or remove objects from the top of the stack.
You can see the implementation in c++ in related links, below.
Wiki User
∙ 11y ago
Wiki User
∙ 12y agousing id array(static representation)
using single linked list(dynamic representation)
Add your answer:
Earn +20 pts
What is different between primitive date type and non primitive data type in c plus plus programming language?
A primitive data type is built into the language - int, char, long, etc. A non-primitive data type is am abstract data type that is built out of primitive data types - linked list, queue, stack, etc.
How you use stack in c plus plus classes?
It would be easier to manipulate the stack in assembly language rather than C++.
What is an ordered list of data structure using c plus plus?
An ordered list of data in any programming language is simply a sorted array or list. In C++ this can either mean a sorted array, vector, list or forward list.
How do you implement queue using stack in c plus plus?
A queue in any language is a singly-linked list structure that permits new data to be inserted only at the end of a list while existing data can only be extracted from the beginning of the list. Queues are also known as a first in, first out (FIFO) structure. Unlike a standard singly-linked list, the list maintains a pointer to the last node as well as the first, in order to insert new data and extract existing data in constant time. Variations on the queue include the priority queue which permit data to be weighted, such that data with the greatest priority is promoted to the front of the queue, behind any existing data with the same or higher priority, using an insertion sort technique. Insertion is therefore achieved in linear time rather than constant time, however extraction is always in constant time.
How do you determine when a stack is empty in c plus plus?
#include<iostream> #include<stack> #include<cassert> int main () { std::stack<unsigned> s; assert (s.empty()==true); s.push (42); assert (s.empty()==false); s.pop (); assert (s.empty()==true); }
How do you find the grade fom datastructure in c plus plus?
You are required to iterate through the data structure which can be your Stack or Linked List or some other. Iteration will help you to compare all the values with the value you want to find. And once you find your value then you can display the related data.
In c plus plus what is meant by stack?
The stack is a region of memory organized as a first-in-last-out (LIFO) structure which stores return information, parameters, and local variables. Since it is a LIFO structure, it is nested, i.e. "stacked", similar to how a stack of papers on your desk would be stacked, and if you could only deal with the top-most paper on the stack. At the language level, C, C++, JAVA, etc., you generally do not even think about the implementation of the stack - it is just there - and it does what it needs in terms of return state, registers, parameters, and automatic or temporary variables.
Is y equals 4x plus 2 a representation of a trend line?
It could be - it is a representation of a line, but whether the "trend" actually fits the data that your given is not possible to say.
What is the price of the book data structure using c and c plus plus by tanenbaum?
225 Rs. after discount........
Does PlayStation plus stack?
Yes, it is possible to purchase, or 'stack', additional time to your Plus membership
What is different between primitive date type and non primitive data type in c plus plus programming language?
A primitive data type is built into the language - int, char, long, etc. A non-primitive data type is am abstract data type that is built out of primitive data types - linked list, queue, stack, etc.
What is the advantages of Dynamic Allocation in C plus plus?
Static allocations are allocated upon the stack, which has limited space. Dynamic allocations occur at runtime and are allocated on the heap, which is "virtually" unlimited (32-bit systems can only address 4GB of memory, at most, but 64-bit systems are only limited by available disk space). Thus the stack should be used for small data structures and local data that are used often in your code, but are fixed in size. The heap should be used for larger, more general purpose allocations or when the size of the structure is variable.
How you use stack in c plus plus classes?
It would be easier to manipulate the stack in assembly language rather than C++.
Explain stack structure of 8086?
The stack in the 8086/8088 microprocessor, like that in many microprocessors, is a region of memory that can store information for later retrieval. It is called a stack, because you "stack" things on it. The philosophy is that you retrieve (pop) things in the opposite order of storing (push) them. In the 8086/8088, the stack pointer is SS:SP, which is a 16 bit pointer into a 20 bit address space. It, at any point of time, points to the last item pushed on the stack. If the stack is empty, it points to the highest address of the stack plus one. In a push operation, the SP register is decremented by two, and the data to be pushed is stored at that address, low order byte first. In a pop operation, the data to be popped is retrieved from that address, again low order byte first, and then the SP register is incremented by two. Some instructions, such as a FAR CALL, or FAR RETURN push or pop more than two bytes on the stack. It is also possible to allocate temporary storage on the stack. You simply decrement the SP register by some amount, use that memory, and then increment the SP register to release the memory. This is known as a stack frame. In fact, the BP register makes is very easy to do so. You use BP to separate arguments from local data - arguments will be above BP, and local data will be below BP. Memory reference instructions that are relative to BP, i.e. [BP+6] or [BP-48] will automatically use the SS segment register.
What is an ordered list of data structure using c plus plus?
An ordered list of data in any programming language is simply a sorted array or list. In C++ this can either mean a sorted array, vector, list or forward list.
How do you implement queue using stack in c plus plus?
A queue in any language is a singly-linked list structure that permits new data to be inserted only at the end of a list while existing data can only be extracted from the beginning of the list. Queues are also known as a first in, first out (FIFO) structure. Unlike a standard singly-linked list, the list maintains a pointer to the last node as well as the first, in order to insert new data and extract existing data in constant time. Variations on the queue include the priority queue which permit data to be weighted, such that data with the greatest priority is promoted to the front of the queue, behind any existing data with the same or higher priority, using an insertion sort technique. Insertion is therefore achieved in linear time rather than constant time, however extraction is always in constant time.
'write a simple program for stack operation in c plus plus?
void push(int y) { if(top>stackSize) { cout<<"stack full"<<endl; return; } else { top++; stack[top]=y; } } int pop() { int a; if(top<=0) { cout<<"stack is empty"<<endl; return 0; } else { a=stack[top]; top--; } return(a); }
