Class Schedule

• Description: Systematic treatment of advanced data structures, algorithm analysis and abstract data types in the C++ programming language. Coding topics include the development of ADTs from scratch, building ADTs on top of the STL templates, vectors, lists, trees, maps, hashing functions and graphs. Concept topics include searching, big-O time complexity, analysis of all major sorting techniques, top down splaying, AVL tree balancing, shortest path algorithms, minimum spanning trees and maximum flow graphs.
• Prerequisite: C S 2B.
• Corequisite:
• Advisory: Advisory: One of the following: ENGL 1A or 1AH or ESLL 26.
• Repeatability: Not Repeatable.
• Hours: 4 hours lecture per week, 2 hours lab per week. 72 hours total per quarter.
• Foothill GE Area:Oral Communication & Critical Thinking
• Transferability: Both
• Transfer GE: Information regarding how this course is applied toward CSU GE/Breadth or IGETC certification is available at:
• Foothill Transfer GE Guide

Department Note: