CareerCup

through sizeof(struct stack) and then finding out how many nodes are there in stack. I think this would work

Usually stack size is a compile time option.

Stack is ADT, it can be implimented using array or linklist or any other data structure. Hence sizing stack is the feature of container (array / linklist) that defines if stacksize can be defined during runtime or not :)

Seems like there is the ulimit command in unix to set/change stack size ?

Also, for testing purposes, stack behavior in a multi threaded environment should be tested :)

Ulinit is used to change allowed maximum file descriptor on linux

size command gives the size of an object file after compilation( not at runtime) in linux . But the question is :run time stack.I think we have to use any psuedo file system like "proc" in linux distros. There associated with process id (which we can get using getpid()) and at all if we have permission to access /proc/"pid" directory then we can almost get any information related to process memory. Any suggestions are welcome.

One more thing : usually stack address starts from 0xffffffff. So if we find address of last defined variable in a function and subtract it from address above , we can approximately get stack size.

Change the stack structure by adding a an extra element for saving stack size, somthing like

struct stackelement
{
int stackLen;
blah blah
stackelement *next;
}

every time you push a element do the following


a) pop a element read the stack size
b) push the element
c) increase the stack size and embed in the new item to pushed

to get the stack size
a) pop a element and read stack size
b) push the element back to stack

complexity is O(1)

disadvantage relatively more memory than usual stack.

Change the stack structure by adding a an extra element for saving stack size, somthing like

struct stackelement
{
int stackLen;
blah blah
stackelement *next;
}

every time you push a element do the following


a) pop a element read the stack size
b) push the element
c) increase the stack size and embed in the new item to pushed

to get the stack size
a) pop a element and read stack size
b) push the element back to stack

complexity is O(1)

disadvantage relatively more memory than usual stack.