Computer Engineering 12
Abstract Data Types and Data Structures
Data abstraction: abstract data types; information hiding; interface specification. Basic data structures: stacks, queues, lists, binary trees, hashing, tables, graphs; implementation of abstract data types in the C language. Internal sorting: review of selection, insertion, and exchange sorts; quicksort, heap-sort; recursion. Analysis of run-time behavior of algorithms; Big-O notation. Introduction to classes in C++. Completion of at least four sizable programming assignments (400 lines).
- Instructor: Darren Atkinson (datkinson)
- Teaching assistants: Gavin Hagiwara (ghagiwara) and Yiwen Zhang (yiwenzhang1)