- Exam policies
- Closed book, closed notes
- No calculators, cell phones, or other electronic devices allowed.
- The exam begins promptly at 12:30pm and ends at 2:20pm.
- Writing after time has been called will result in a loss of points on your exam.
- You will be provided these summations.

- The final will focus on all material studied since the midterm. This is roughly: Hashing, Sorting, Graphs, Parallelization, Concurrency, NP-completeness
- Check the lecture calendar for links to all slides and ink used in class, as well as readings for each topic.
- Note that the material in this course tends to build on itself,
so it would also be reasonable to expect you to remember the basics
of data structures covered earlier in the quarter or what big-O
etc. means. I will not ask you to actually *do* an AVL insertion or
a B-tree insertion/deletion,
**but having a reasonable idea of how these work would be a good idea**. - Hashtables:
- Basics of good Hash function design
- Different versions of collision resolution:
- Separate Chaining
- Open Addressing: Linear probing
- Open Addressing: Quadratic probing probing
- Open Addressing: Double hashing

- Strengths/weaknesses of the above versions
- Load factor
- Run-times for the different versions (though you do NOT need to memorize the equations for expected # of probes for a given load factor)
- Deletion
- Rehashing

- Sorting
- Sorts:
- Simple Sorts: Insertion Sort, Selection Sort
- Heap Sort
- Merge Sort
- Quick Sort
- Bucket Sort & Radix Sort

- Know run-times
- Know how to carry out the sort
- Lower Bound for Comparison-based Sorting
- Won't be asked to give full proof
- But may be asked to use similar techniques
- Be familiar with the ideas
- Graphs - In general, know how to carry out the operation/algorithm & running time.
- Graph Basics
- Definition; weights; directedness; degree
- Paths; cycles
- Connectedness
- DAGs

- Graph Representations
- Adjacency List
- Adjacency Matrix
- What each is; how to use it; pros and cons of each.

- Graph Traversals
- Breadth-First
- Depth-First
- What data structures are associated with each?

- Topological Sort
- Dijkstra's Algorithm for Finding Shortest Paths
- Prim's Algorithm for Finding Minimum Spanning Trees
- Kruskal's Algorithm for Finding Minimum Spanning Trees
- Parallelism
- ForkJoin Parallelism, and Associated Terms (Work, Span, etc.)
- ForkJoin Applications, ex: Parallel Summing of an Array
- Reduce: parallel sum, multiply, min, find, etc.
- Map: bit vector, string length, etc.
- Be able to write Java fork join code for simple maps & reductions
- Parallel Prefix Sum Algorithm, Filters, etc.
- Analysis of Parallel Algorithms
- Parallel Sorting
- Amdahl's Law
- Concurrency
- Race Conditions
- Data Races
- Bad Interleavings
- Synchronizing your code
- Locks, Reentrant locks
- Java's synchronized statement
- Issues of lock scheme granularity: coarse vs fine
- Issues of critical section size
- Deadlock

- Be able to write pseudo-code for Java threads & locks
- P, NP, NP-completeness
- What does each of these classes mean
- Examples of problems in each class
- What to do if you think the problem you are trying to solve is NP-complete?
- Eclipse
- Generics
- Java syntax
- Note that you WILL likely be required to write Java code (in particular Fork-Join or Java thread code), but we will not be sticklers for Java syntax. Edge cases and other details of a correct algorithm - yes, semicolons - no.
- Writing a simple proof of some sort is a possibility. Any such proof will be intended to show that you know how to prove things. You will not be expected to have a "magic insight" in the course of the proof.
- The homeworks are a decent indication of the types of questions that could be asked
- CSE 332 17au Final, (Soln)
- CSE 332 16au Final, (Soln)
- CSE 332 15wi Final, (Soln)
- CSE 332 12sp final (Soln)
- CSE 332 12wi final (Soln)
- CSE 332 12su final (Soln) Note: this exam was only 90 minutes long.
- CSE 332 10sp final (Soln)
- CSE 332 10su final (no solution available) Note: this exam was only an hour long.

We provide some exams from previous quarters of 332 to help with
your studying. Be aware that the topics covered may vary from what
will be covered on our exam - refer to the list above if you are
wondering about a particular topic. Our hope is that these exams
will be useful in your studying, ***but you should *NOT* take
them as a guarantee of exactly what your exam will be like this
quarter*!!** They are provided only to help you in your
studying.