Week 12-13: Elementary Data Structures and Algorithms

After completing this chapter, you should be able to:

  • Define the AVL trees, thier implementations and their rotation methods.
  • Define Graphs and different terminologies attached to it.
  • Adjacency Matrix vs Adjacency List
  • Paths and Cycles , Trees and Forests 
  • Graph search, Breadth First Serach vs Depth First Search
  • Topological Sort
  • Finding the Critical Path
  • Euler Circuits

Download Files

lect-6-elementry-data-structures.ppt (4.52 MB )