Course Description | Outline | Software Development Training | IT Training

Course Outline

Module 1 - Course Introduction

• math review
• Big-Oh analysis

Module 2 - Arrays

• linear search
• sorting an array
  
• binary search

Module 3 - List ADT

• array as a list
• single linked lists
• double linked lists
• list performance

Module 4 - Stack ADT

• stack as a list adaptor
• stack operations
• stack performance

Queue ADT

• queue as a list adaptor
• queue operations
• queue performance
• circular queues

Module 5 - General Trees Terminology and Structures

• review of recursion
• binary search tree ADT
• BST operations
  
• BST traversals
  
• recursive BST functions
  

Module 6 - (Min) Priority Queue ADT

• PQ structure and ordering
• hash table ADT
• hash table operations

Module 7 - Graph ADT

• graph terminology
  
• connectedness
  
• graph algorithims
• breadth first, depth first
• shortest path
• digraphs
• topsort