This course discusses the implementation and use of common one-dimensional data structures, including typed files, sets, strings, lists, queues, and stacks. Array-based and pointer-based implementations for these structures are developed, together with iterative and recursive algorithms for structure access and manipulation. Other topics covered include the concept of an abstract data type searching and sorting, and an introduction to algorithm analysis. This is a programming intensive course.