CIT 594 Exam Questions
Spring 2007, David Matuszek


I have added some questions to groups in bold. The new groups are after the horizontal line. The first topic not covered in the midterm exam is Backtracking.

Abstract Data Types Comparisons Map Sorting
Algorithm Types Generics Miscellaneous Stacks, Queues, Deques
Analysis of Algorithms Graphs Priority Queues State Machines
Arrays Hashing Recognizers and Parsers Style
Backtracking Huffman Encoding Recursion Trees
Binary Trees Iterator Set Tree Searching
BNF Linked Lists SortedMap  
Collection List SortedSet  

Alpha-Beta Search Images Regular Expressions Storage
Heuristic Search Preferences Spanning Trees  
Hypergraphs Platforms Sparse Arrays  

Style

Stacks, queues, deques

Collection

Iterator

Set

SortedSet

List

Map

SortedMap

BNF

Generics

Recursion

Abstract Data Types

State machines

Arrays

Binary trees

Trees

Analysis of Algorithms

Comparisons

Linked Lists

Hashing

Recognizers and Parsers

Sorting

Tree Searching

Priority Queues

Algorithm Types


Backtracking

Huffman Encoding

Graphs

Quicksort

State spaces and heuristic search

Pruning

Effective programming

Storage

Spanning Trees

Sparse Arrays

[This lecture was primarily intended as an example of using linked lists, so there's not much I want to ask.]

Preferences

Hypergraphs

Alpha-Beta Searching

Regular Expressions

Platforms

Images

Miscellaneous