archive-edu.com » EDU » V » VCSU.EDU

Total: 144

Choose link from "Titles, links and description words view":

Or switch to "Titles and links view".
  • Linear Data Structures (VCSU-MEP)
    that are worth considering must include a Vector b Hash table c Dictionaries d List e Stack f Queue or x ADT exhibit Links Vectors Hash Tables Dictionary or Map

    Original URL path: http://euler.vcsu.edu:7000/240/ (2013-06-13)
    Open archived version from archive


  • Recursive Data Structures (VCSU-MEP)
    have elegant recursive definitions and routines but awkward iterative ones For example examining every item in a linear structure is very easy with a simple loop The same task with a tree is quite difficult for a loop but short and elegant with a recursive subroutine The following exhibits cover this topic more fully a Recursion in more detail b Binary trees c N way trees including B Trees d

    Original URL path: http://euler.vcsu.edu:7000/2219/ (2013-06-13)
    Open archived version from archive

  • Sets and Bags (VCSU-MEP)
    using other data structures in particular trees and dictionaries Sets are unordered and allow no duplicates even if they are implemented on ordered structures The set operations are Union Intersection Set Difference Subset test and Membership test In a set

    Original URL path: http://euler.vcsu.edu:7000/946/ (2013-06-13)
    Open archived version from archive

  • Linear Data Structures (VCSU-MEP)
    four data structures are considered Choose one of the following a Vectors b Linked lists c Stacks d Queues or x Return to the Container Class Exhibit Links The Vector Data Structure The Linked List Data Structure The Stack Data

    Original URL path: http://euler.vcsu.edu:7000/9644/ (2013-06-13)
    Open archived version from archive

  • An Introduction to the Standard Template Library (VCSU-MEP)
    all C programmer may use nearly the same library on whatever platform they choose In a Data Structures course many of these items such as lists stack trees would have been exercises to program and the experience in doing so is still valid However it is also valid to use these for other projects Therefore it is instructive to see both the interior of how a tree might work and

    Original URL path: http://euler.vcsu.edu:7000/9662/ (2013-06-13)
    Open archived version from archive

  • Components of the STL (VCSU-MEP)
    described in its own exhibit a Containers b Algorithms c Iterators d Function templates e Adapters f Common methods of the containers or x Exit to the STL Exhibit Links STL Containers STL Algorithms STL Iterators Function Templates of STL

    Original URL path: http://euler.vcsu.edu:7000/9665/ (2013-06-13)
    Open archived version from archive

  • Important Containers of the STL (VCSU-MEP)
    is currently constructed and even it is under construction Choose from the following menu a Vector the container that is easiest to understand b Deque double ended queue c List a doubly linked list d Map a binary tree or

    Original URL path: http://euler.vcsu.edu:7000/9668/ (2013-06-13)
    Open archived version from archive

  • Adapters (VCSU-MEP)
    like a common abstract data type For example a set is a common ADT It might be implemented using an array vector linked list or tree It is an adapter in that it takes the classic methods of set and

    Original URL path: http://euler.vcsu.edu:7000/17852/ (2013-06-13)
    Open archived version from archive



  •