Class Schedule

• Description: A systematic treatment of advanced data structures, algorithm analysis, and abstract data types in the Python programming language, intended for computer science majors as well as non-majors and professionals seeking advanced Python experience. Coding topics include large program software engineering design, multi-dimensional arrays, string processing, primitives, compound types, and allocation of instance and static data. Data structure concept topics include dynamic memory, inheritance, polymorphism, hierarchies, recursion, linked-lists, stacks, queues, trees, hash tables, and graphs. Algorithm 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 3B.
• Corequisite:
• Advisory: Advisory: Demonstrated proficiency in English by placement via multiple measures OR through an equivalent placement process OR completion of ESLL 125 & ESLL 249.
• Repeatability: Not Repeatable.
• Hours: 4 hours lecture per week, 2 hours lab per week. 72 hours total per quarter.
• Foothill GE Area:
• 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: