PPT Slide

Course outline

Features of C++, object-oriented programming principles, and features of the Unix programming environment will be introduced concurrently with the study of these topics, as appropriate
Review of C++

Introduction to Unix
Review of program performance
• time and space complexity
• asymptotic notation
  -- searching (linear vs binary) & sorting (insertion sort vs mergesort)
Data representation and lists
Stacks and Queues
Hash tables
Binary trees
• representation
• traversal
Priority queues
• Linear lists
• Heaps
Search trees
• Binary search trees
• balanced binary search trees – AVL trees
Graphs
• representation
• traversal

• bigOh/ bigTheta notation

• asymptotic worst-case complexity of algorithms

• common complexities:
  • log n
  • n
  • n log n
  • n2, n3, ...

• determining complexities of algorithms

• example complexities -- sort/ search

• timing measurements

Previous slide

Next slide

Back to first slide

View graphic version