I. The interview. Getting ready -- Strategies for a great interview -- Conducting an interview -- II. Data structures and algorithms. Primitive types -- Arrays -- Strings -- Linked lists -- Stacks and queues -- Binary trees -- Heaps -- Searching -- Hash tables -- Sorting -- Binary search trees -- Recursion -- Dynamic programming -- Greedy algorithms and invariants -- Graphs -- Parallel computing -- III. Domain specific problems. Design problems -- Language questions -- Object-oriented design -- Common tools -- IV. The honors class. Honors class -- V. Notation and index. Notation -- Index of terms.
This resource is supported by the Institute of Museum and Library Services under the provisions of the Library Services and Technology Act as administered by State Library of Iowa.