C Data Structures in Python

Catalog description

Term hours: 54 lecture. This is an intermediate-level course for students to develop programming skills to build larger, more complex, higher-quality software. Topics include data structures such as arrays, linked lists, stacks, queues, hash tables, binary trees, heaps, self-balancing binary search trees, and graphs. Other topics include inheritance, operator overloading, sorting, and algorithm analysis. (UC/CSU, C-ID: COMP 132).