This document contains a list of subjects that I think students should have mastered by the time they take the midterm exam. It is quite possible that some of the questions from the exam will come straight from the questions on this list.

Programming and Haskell

• General knowledge
  1. Glossary of Haskell terms.
  2. Naming Values
  3. Using Parentheses.
  4. The use of layout.
• Using types.
• Creating Lists with comprehensions
• Writing contracts
• Program design recipes
  1. Generic program design recipe.
  2. Recursive program design recipe.
  3. Design Recipes for processing arrays
• Many different ways to create functions
• Creating new kinds of datastructures using Haskell's data declaration.
• Using pattern matching
  1. multi-clause function declaration
  2. case expressions and patterns
  3. Patterns over tuples
  4. Nested patterns
  5. The special syntax for list based patterns.
• Using the Hunit testing framework for simple equality assertions.
• Using Haskell libraries
  1. Using the ArrCommands library
  2. Using the Excell library

Sorting

• Sorting Arrays
  1. Static index based permutation sorts.
     • Exchange sort
     • Bubble Sort
     • Insertion Sort. See insertArr.
  2. Sorts on key ranges with special properties
     • Bucket Sort
     • Counting Sort
     • Radix sort
     • Be able to describe properties necessary.
• Sorting lists
  1. List based insertion sort.
  2. List based Exchange sort.
  3. List based Bubble sort
  4. Divide and conquer sorts
     • Merge Sort
     • Quik Sort
  5. Tree based sorts using trees with the binary-search tree invariant.
• Satellite data and stabilty.

Searching

• Sequential searches
  1. On lists
  2. On arrays
• Binary searches
  1. On arrays
  2. Why they don't work on lists
  3. On binary trees
     • The Binary Search tree invariant
     • Performing insertions to maintain the invariant
     • The divide and conquer search algorithm
• Balancing trees
  1. The Binary Search tree invariant
  2. Rotations
  3. AVL trees
• Hash based searches
  1. Bucket Hashes
  2. Sequential search hashes
  3. Properties of Hash functions

Cost analysis

• The one-egg metric
• Time based costs
• Space based costs
• Cost as a function of the size of the input

Back to the Daily Record.

Back to the class web-page.