answersLogoWhite

0

What do you call a stack of straw?

Updated: 8/11/2023
User Avatar

Wiki User

11y ago

Best Answer

A pile of hay may be called a :

  • haystack
  • haymow
  • hayrick
  • haycock
  • hay-pile
  • hay stook

hay bale

User Avatar

Wiki User

12y ago
This answer is:
User Avatar
More answers
User Avatar

Wiki User

15y ago

a bale of hay

This answer is:
User Avatar

User Avatar

Anonymous

Lvl 1
3y ago

I

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What do you call a stack of straw?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Engineering

What is the contents of the stack pointer after the execution of the call instruction?

On a near call, the stack pointer is 2 less than its original value. On a far call, it is 4 less.


How are arguments passed to a function?

Arguments are passed to functions via the thread's function call stack. Every thread has its own call stack, which is a small region of contiguous, fixed-size memory that extends downwards into lower addresses. The stack is allocated when the thread is instantiated and deallocated when the thread terminates thus there is minimal cost in using the stack. Data is pushed and popped from the stack while a stack pointer keeps track of the top of the stack (the lowest unused address).


Which function call Does not consume stack space?

Calling an in-line function, which is not actually a function-call.


What is the maximum depth of recursive calls a function may make?

Recursive function call depend your primary memory space because the recursive call store in stack and stack based on memory.


What is the purpose of a stack in implementing a recursive procedure Explain?

there is no a prior limit on the depth of nested recursive calls (that a recursive function may call itself any no. of times), we may need to save an arbitrary number of register values(return values of the recursive functions, that may be used latter to find the actual solution). These values must be restored in the reverse of the order in which they were saved, since in a nest of recursions the last subproblem to be entered is the first to be finished. This dictates the use of a stack, or ``last in, first out'' data structure, to save register values. We can extend the register-machine language to include a stack by adding two kinds of instructions: Values are placed on the stack using a save instruction and restored from the stack using a restore instruction. After a sequence of values has been saved on the stack, a sequence of restores will retrieve these values in reverse order.Vishal SrivastavaMCA, LUsource : http://mitpress.mit.edu/sicp/full-text/sicp/book/node110.html