C++

C++

1. Stacks

   • items put on top of stack, pushes everything down, when removed taken from top In computing terms, this is referred to as a LIFO queue – Last In First Out And to ensure that this behaviour is enforced, the stack can only be legally operated on by two operations: Push & Pop
     • Pro's/Con's
       • Simple to implement -- Very fast -- Lends itself to certain activities (function calls)
         • Very limited mode of operation (LIFO) and only supports a narrow range of activities -- Falls apart when accessed by functions other than Push and Pop

2. Queues

   • FIFO - join at back, leave from front -- Queue manipulated be enqueue and dequeue
     • Pro's/Con's
       • Simple to implement -- Still fast (a little more overhead than Stack) -- Lends itself to certain activities (scheduling)
         • Very limited mode of operation (FIFO) and only supports a narrow range of activities -- Falls apart when accessed by functions other than Enqueue and Dequeue

3. good to use objects if you suspect you may need to build upon or modify the existing functionality and if You have no idea how big you data structure is

4. Comparing the stack and heap

   • Stack and Heap are two principle data structures in every ‘Von Neumann’ based computing system Stack (implemented contiguously) Heap (Binary Tree – non contiguous) Consequently, they both serve fundamentally different functions, and often compared Stack – Inherently simple structure + contiguousness Fast – used to implement function calls and local variables Heap – Complex structure + non-contiguousness Slower (but not slow – binary tree), but more flexible – used to implement dynamic memory allocation (‘new’ command)

Imágenes y archivos del mapa