Why does a van der Graff generator repel a stack of tin foil plates?
Asked in Inventions, Physics, Electrical Engineering
Why does a van der Graff generator repel a stack of tin foil plates one at a time?
Asked in Pokemon
What water foat is the generator piece in in the cerulian gym?
Can you buy new plates for an old Weider Stack machine thing?
Asked in Database Programming, C Programming
What is stack in functions?
A stack is one of the basic data structures, implementing a last-in-first-out (LIFO) container. Pretty much like a stack of plates, the item last entered (put on top of the stack) will be the first one removed (pulled off the top of the stack), while the item first entered (put onto the empty stack) will be the last one removed.
Asked in Mechanical Engineering
What is the stack height of 1250 kva diesel generator set?
Asked in Computer Programming
Why does a stack have Last in First out configuration?
If you imagine a stack as a pile of dinner plates then, if you want to remove a plate the only one you can remove is the one at the top of the pile. Similarly if you want to add a dinner plate the only place you can put it is at the top of the pile. Thus using a stack the process of dealing with its contents it is like the pile of dinner plates the one you get to deal with first is the last one you placed in the pile and so on - last in first out!.
Asked in Computer Programming, Windows XP
Are FIFO and LIFO forms of access used to add and remove nodes from queue?
No. FIFO is a first-in, first-out structure, and this describes how nodes are inserted and extracted from a queue. That is, new nodes are inserted at the back of the queue while existing nodes are extracted from the front of the queue. In other words, nodes are processed on a first-come, first-served basis. However, LIFO is a last-in, first-out structure and this describes how nodes are inserted and extracted from a stack. You can think of a stack as being like a stack of plates such that the top-most plate is always the first to be extracted while new plates are placed on top of existing plates. Stacks are typically used in backtracking algorithms because nodes are extracted in the reverse order they were inserted upon the stack.
Asked in Computers, Computer Programming, C Programming
What are the disadvantages of stack?
A stack is a LIFO (last-in, first-out) data structure such that only the top-most element is accessible and all new elements are pushed onto the top (analogous to a stack of plates). Stacks are advantageous when implementing a back-tracking algorithm but are ultimately useless for anything else. However, this is not a disadvantage. If you're not implementing a back-tracking algorithm then the problem is not the stack itself it is the fact that you are using the wrong type of container for your algorithm.
Asked in Database Programming, Database Design
What does it mean that the stack is a LIFO structure?
LIFO stands for Last In First Out. It basically means that the most recent piece of data added to a list, will be the first piece that is taken off. It is often compared to a stack of plates. When you have a plate to add to the the stack, you put it on the top, not in the middle or at the bottom of the stack. If you need a plate you usually take it from the top, not the middle or bottom. So the most recent plate on the top is the first that will be taken off when one is needed.
What is the Difference between stack and stack pointer?
Why filo is not used in stack?
FILO is an acronym of "first in last out". If we imagine a stack of plates, the first plate is at the bottom of the stack and is therefore the last to be removed from the stack. Thus FILO is used when referring to a stack. We use a stack when we wish to process elements in the reverse order they arrive, always processing the newest arrival first. Stacks are useful in backtracking algorithms and are a fundamental aspect of the call-and-return mechanism. FIFO, on the other hand, is an acronym of "first in first out" and is synonymous with "first come, first served". As such, FIFO applies to queues rather than stacks. We use a queue when we wish to process elements in the same order they arrive.
What are the disadvantage of array implementation of stack?
Asked in C Programming, Intel 8085
How is the stack and stack pointer work?
A stack is a data structure in which last item inserted is taken out first . That's why they are known as LIFO (last in first out). Inserting an item in stack is termed as push and taking an item out from stack I s termed as pop. Stack pointer is the pointer that points to the top of the stack or that points the item at the top of the stack and help in adding or deleting the item from the top of stack.