Prev Up Next
Go backward to 2 Concept Webs
Go up to Top
Go forward to References

3 An Example of Concept Webs: Programming Concepts

As the main example of concept development in this document, we develop parts of a concept web of programming concepts, concentrating mainly on generic programming. So far this development contains only textual material; I would like to add a graphical depiction of the conceptual hierarchy, and it ideally should be greatly expanded with many examples and other kinds of related material such as animations, simulations, experiments, interactive database searches, etc.

  • 3.1 Programming
  • 3.2 Programming Language
  • 3.3 Computer Program
  • 3.4 Generic Computational Method
  • 3.5 Definite (Nongeneric) Computational Method
  • 3.6 Generic Algorithm--A Finite Generic Computational Method
  • 3.7 Algorithm--A Finite and Definite Computational Method
  • 3.8 Generic Programming
  • 3.9 Generic Algorithm Specialized by Input Type
  • 3.10 Generic Sequence Algorithm
  • 3.11 Generic Algorithm Specialized by I/O-Relation
  • 3.12 Generic Algorithm Specialized by Strategy
  • 3.13 Generic Divide-and-Conquer Algorithm
  • 3.14 Generic Divide-and-Conquer Sequence Algorithm
  • 3.15 Generic Sorting Algorithm
  • 3.16 Generic Search Algorithm
  • 3.17 Generic Divide-and-Conquer Sorting Algorithm
  • 3.18 Generic Binary Search
  • 3.19 Some Areas for Expansion of this Concept Web
  • 3.19.1 Generic linear search
  • 3.19.2 Generic matrix algorithm
  • 3.19.3 Generic tree algorithm
  • 3.19.4 Generic graph algorithm
  • 3.19.5 Generic dynamic programming algorithm
  • 3.19.6 Generic greedy algorithm
  • 3.19.7 Generic quicksort
  • 3.19.8 Generic mergesort

  • musser@cs.rpi.edu

    Prev Up Next