This text applies a case-study approach to a set of complex problems using Pascal data structures. These problems elucidate a broad range of topics for students, including stacks, queues, linked lists, hash tables and trees, as well as advanced concepts such as data abstraction and prototyping.