Implement an array of stacks where stacks are defined : typedef struct StackNode { int data; StackNode* next; } StackNode; Each array element points to a stack, each stack is initialized as an empty stack. When you start adding elements it will start adding them to the stack in Stacks[0]; if you say -2 in stdin and then 4 for...
For example, are they using Java/Struts? Or ASP.NET? Or PHP? Or some combination of technologies? Not sure how public they are about their infrastructure, but it would be very interesting to know what they use. ...
I was asked about heap and stack memory structure in an interview. The guy asked me what's the benefit of having the stack? I wasn't sure what he was getting at. What others ways are there to set up address space to execute a c program? ...
Background: I have written a generic logging library in .NET 3.5. Basically the developer needs to call the Begin() method at the beginning of their method and the End() method at the end of it. These methods do not take a parameter - the library uses the stacktrace to figure out where it came from. The library has a collection that k...
So IN an embedded systems unit, that i'm taking at uni next year, we will learn that dynamic data structures are a bad thing to have in an embedded system program. but the lecture notes don't go into why. Now i'm working on a moderate scale, embedded systems\ 'LURC' controller, mostly just takes advantages of the peripheral of the "Butt...
Note: This question was influenced by this answer. The following is valid C code: char myString[] = "This is my string"; This will allocate a string of length 18 (including the \0 character) on the stack and assign the specified value to it. However, the following: char myStrings[][] = {"My 1st string", "My 2nd string", "My 3rd str...
Do stack-based languages have a concept of scope? It would seem to me that if function parameters are placed on the stack before the function executes, that they do in an unorthodox sort of way. Or, I could be trying to impose an abstraction that doesn't quite fit. ...
I'm making a C program that needs to use two stacks. One needs to hold chars, the other needs to hold doubles. I have two structs, node and stack: struct node { double value; struct node *next; struct node *prev; }; struct stack { struct node *last; struct node *curr; }; The problem is that I need one of each type...
So I have this simple piece of code which demonstrates a simple buffer overflow: #include <stdio.h> int main(void) { char c[4] = { 'A', 'B', 'C', 'D' }; char d[4] = { 'W', 'X', 'Y', 'Z' }; printf("c[0] is '%c'\n", c[0]); d[4] = 'Z'; /* Overflow that overwrites c[0] */ printf("c[0] is '%c'\n", c[0]); return 0...
I'm programming in C in Visual Studio 2005. I have a multi-threaded program, but that's not especially important here. How can I determine (approximately) how much stack space my threads use? The technique I was planning to use is setting the stack memory to some predetermined value, say 0xDEADBEEF, running the program for a long time...
Basically, I'm looking for something where I can break execution and then see a visual representation of the stack in memory. DDD doesn't have this as far as I can tell. ...
I'm in a thread. I have an address. Is that address from a variable on the same stack that I'm using? static int *address; void A() { int x; atomic::CAS(address, 0, &x); // ie address = &x // ... } void B() { int y; int * addr = atomic::read(address); // ie addr = address if (addr && on_same_stack(&y, addr)) ...
In multi-threaded embedded software (written in C or C++), a thread must be given enough stack space in order to allow it to complete its operations without overflowing. Correct sizing of the stack is critical in some real-time embedded environments, because (at least in some systems I've worked with), the operating system will NOT dete...
Hey y'all, I'm trying to write a Java method to preform a 'multi-pop" on a stack, it should "pop" "k" number of items off the top of the stack object. This is what I'm thinking, but it's not quite right, any help out there? Thanks everyone. public void multipop(int k){ while (top != null){ for(int i =0; i<=k; i++){ this.pop(); }}}...
Hi, in Pharo, how can I find the currently evaluating stack? ...
I am looking at a textbook example of a linked list that implements a stack. I don't understand why using a pointer to a pointer to the stack is necessary for the push operation. See the following example: bool push( Element **stack, void *data) { Element *elem = new Element; if(!elem) return false; elem->data = data; e...
Do the JVM and .NET VM allocate objects on the stack when it is obvious to the runtime that an objects lifetime is limited to a certain scope? ...
hi! is there in C# some already defined generic container which can be used as Stack and as Queue at the same time? I just want to be able to append elements either to the end, or to the front of the queue thanks ...
Im trying to implement roles feature to my app that already has authlogic working... Im following this tutorial but now Im getting an error "stack level too deep" when I try to run my app... SystemStackError in Users#new Showing app/views/users/_form.erb where line #2 raised: stack level too deep Extracted source (around line #2): ...
There are n different elements, already know the order each element is pushed in. How many different kinds of combination can there be for the poping order? EDIT In fact I know there are 2n!/(n+1)n!^2 combinations,but why? ...