Week 10-11: Data Structures and Algorithms

After completing this chapter, you should be able to:

  • Define the concept of an abstract data type (ADT).
  • Define a stack, the basic operations on stacks, their applications and how they can be implemented.
  • Define a queue, the basic operations on queues, their applications and how they can be implemented.
  • Define a general linear list, the basic operations on lists, their applications and how they can be implemented.
  • Define a general tree and its application.
  • Define a binary tree—a special kind of tree—and its applications.
  • Define a binary search tree (BST) and its applications.
  • Define a graph and its applications.

Download Files

lect-5-data-structures-and-algorithms.ppt (8.50 MB )