CIT 594 Exam Questions
Spring 2008, David Matuszek


The following is a long list of possible exam questions; my exams will be composed of these questions, or questions that are modifications of these. Questions are not divided into pre-midterm and post-midterm, because I don't cover topics in the same order every time (and I may not cover every topic). If I add questions during the semester, they will be in a diffent color. Please do not post answers to these questions on the web.

Abstract Data Types Graphs Preferences Sparse Arrays
Algorithm Types Hashing Priority Queues Stacks, Queues, Deques
Alpha-Beta Search Heuristic Search Pruning State Machines
Analysis of Algorithms Huffman Encoding Quicksort State Spaces
Arrays Hypergraphs Recognizers and Parsers Storage
Backtracking Images Recursion Style
Binary Trees Iterator Regular Expressions Threads
BNF Linked Lists Set Trees
Collection List SortedMap Tree Searching
Comparisons Map SortedSet  
Effective Programming Miscellaneous Sorting  
Generics Platforms Spanning Trees  

Style

Stacks, queues, deques

Collection

Iterator

Set

SortedSet

List

Map

SortedMap

BNF

Generics

Recursion

Threads

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