CS201: Elementary Data Structures

Upon successful completion of this unit, you will be able to:

• Demonstrate effective hash tables.
  • Define hashtable and hash function.
  • Describe the attributes of good hash functions.
  • Describe several common hash functions.
  • Apply hash tables and hash functions for insertion, deletion, and value access within a specific application.
• Demonstrate effective graphs.
  • Define graph.
  • State the components of a graph.
  • Describe the two principal graph traversal paradigms.
  • Demonstrate the use of graphs as a solution to a particular application requirement.
  • Know the difference between directed and undirected graph.
  • Define spanning tree.
  • Explain means of generating spanning trees.
  • Define graph cycle.
• Demonstrate effective trees.
  • State the difference between trees and graphs.
  • Define the basic components of a tree: root, leaf, branch, node, level.
  • Know the difference between binary and nonbinary trees.
  • Apply trees to solve specific application requirements.