CSE 332 Winter 2015 Final Exam: Wednesday, March 18, 2015
12:30-2:20pm
The final will be in Kane 220 (Map)
- Exam policies
- Closed book, closed notes
- No calculators, cell phones, or other electronic devices allowed.
- The exam begins promptly at 12:30 and ends at 2:20pm.
- The final will focus on all material studied since the midterm.
This is roughly: Sorting, Graphs, Parallelization, Concurrency,
Amortization, 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.
- NEW! CSE 332 15wi Final,
Solution
- NEW! Slides from Review Session
Topics (not necessarily an exhaustive list):
- 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
- Readers/writer locks
- Be able to write pseudo-code for Java threads & locks
- Amortized Analysis
- Difference between amortized and worst case performance
- Why/when amortized analysis is useful
- 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?
Stuff that you will NOT be tested on:
- Eclipse
- Generics
- Junit
- Java syntax
Misc.:
- 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
Previous Exams
This quarter's final will be along the same general lines as 332
final exams from previous quarters. Our hope is that these exams will be
useful in your studying, HOWEVER you should NOT take them as a guarantee
of exactly what your exam will be like this quarter.
Previous CSE 332 Exams
Good luck with your exam studying!