ib>Graphs (cont.)</b><br>
    <i>Readings:</i> <a href="http://pages.cs.wisc.edu/%7Eskrentny/cs367-common/readings/Graphs/index.html">Graphs</a><br>
<content for="title">CS 367 Exam Topics</content>
<content for="top"><h2>EXAM TOPICS</h2>
<b>In This Page:</b>
<a href="#Exam1">Midterm Exam 1</a> |
<a href="#Exam2">Midterm Exam 2</a> |
<a href="#Exam3">Final Exam</a>
<br><b>Other pages:</b>
<a href="?r=coursework#Exams">Exam Information</a> 
</content>

<content for="main">
<div>

<a id="Exam1"></a>
<h2>Midterm Exam 1:</h2>

<p><b>You are responsible for material covered in:</b></p>
<ul>
  <li>Lectures</li>
  <li><a href="?r=syllabus">Readings</a>: 
  Intro, Lists, Java Exceptions, Linked Lists, Complexity, Stacks and Queues</li>
  <li><a href="?r=coursework#Homeworks">Homeworks</a>: 1 through 4 (solutions posted on <a href="http://learnuw.wisc.edu" target="_page">Learn@UW</a>)</li>
  <li><a href="?r=coursework#Programs">Program</a>: 1</li>
</ul>

<!--
<p>Note that, if necessary, a reference will be provided in the
exam for a subset of methods for select Java API classes.</p>
-->

<p>A selection of sample exam questions is available on
<a href="http://learnuw.wisc.edu" target="_tab">Learn@UW</a>
in the "Content" section of the course.</p>


<h2>Topics</h2>

<ul>

  <li><b>General</b><br> abstract data type (ADT),  data structure, Java interfaces (defining, implementing, using an interface as a type),  using Java generics, primitive vs. reference types in Java</li>

  <li><b>Lists (Arrays)</b><br> List ADT, List operations, implementing List  using an array, implementing List  using a linked list (i.e., a chain of linked nodes), complexities of List operations for different implementations, using a List</li>

  <li><b>Iterators</b><br> what they are, how to use them, how to implement one for an ADT when the underlying data structure is an array or a chain of linked nodes</li>

  <li><b>Java Exceptions</b><br> defining new exceptions, checked vs. unchecked, throwing an exceptions using <tt>throw</tt>, handling an exception using <tt>try</tt>-<tt>catch</tt>, handling an exception by passing it down the call stack, listing exceptions in a <tt>throws</tt> clause</li>

  <li><b>Linked Lists (Chains of Nodes)</b><br> list node, linked list operations, head pointer, tail pointer, header node, singly linked lists, doubly linked lists, circular linked lists, comparison of linked list variations</li>

  <li><b>Complexity</b><br> what complexity is, problem size, constant time (O(1)), linear time (O(N)), quadratic time (O(N<sup>2</sup>)), big-O notation, worst-case vs. best/average cases, determining complexity of Java code, limitations of complexity analysis</li>

  <li><b>Stacks</b><br> Stack ADT, Stack operations, implementing Stack using an array, implementing Stack using linked list variations, complexities of Stack operations for different implementations, using a Stack</li> 

  <li><b>Queues</b><br> Queue ADT, Queue operations, implementing Queue using array variations, circular arrays, implementing Queue using linked list variations, complexities of Queue operations for different implementations, using a Queue</li>

</ul>


</div>
<div>

  <a id="Exam2"></a>
  <h2>Midterm Exam 2:</h2>

<p><b>You are responsible for material covered in:</b></p>

<ul>
  <li>Lectures</li>
  <li><a href="?r=syllabus">Readings</a>: Recursion, Searching, Trees, Binary Search Trees, Red-Black Trees, Priority Queues</li>
  <li><a href="?r=coursework#Homeworks">Homeworks</a>: 5 through 8 (homework solutions are on <a href="http://learnuw.wisc.edu" target="_page">Learn@UW</a>)</li>
  <li><a href="?r=coursework#Programs">Programs</a>: 2 and 3</li>
</ul>

<!--
<p>Note that, if necessary, a reference will be provided in the
exam for a subset of methods for select Java API classes.</p>
-->

<p>A selection of sample exam questions is available on
<a href="http://learnuw.wisc.edu" target="_tab">Learn@UW</a>
in the "Content" section of the course.</p>

<h2>Topics</h2>

<ul>

  <li><b>Priority queues</b><br> Priority Queue ADT, implementing Priority Queue (using a heap, BST, unsorted array, sorted linked list, etc.) and implications for complexities, heap operations (algorithms &amp; complexities), array implementation of heaps</li>

  <li><b>Recursion</b><br> recursive methods, base case, recursion rules, how method calls work (i.e., activation records and the call stack), recursion vs. iteration, recursive data structures, analyzing complexity of recursive methods, recurrence equations, determining complexity using recurrence relations</li>

  <li><b>Search</b><br> Java interfaces (defining, implementing, using an interface as a type), the Comparable interface, sequential search, binary search, complexities of search algorithms</li>

  <li><b>Trees</b><br> position-oriented vs. value-oriented ADTs, tree terminology (root, leaf, node, edge, parent, child, sibling, ancestor, descendant, subtree, path, length of a path, height of a tree, full tree, complete tree, height-balanced tree), general trees, binary trees, implementation of trees, writing recursive methods that traverse a tree, pre-order traversal, post-order traversal, level-order traversal, in-order traversal</li>

  <li><b>Binary Search Trees</b><br> binary search trees (BSTs), key value, implementing BSTs, algorithms for BST operations (print, lookup, insert, delete), in-order successor, in-order predecessor, complexities of BST operations</li>

  <li><b>Red-Black Trees</b><br> balanced search trees, red-black trees, red-black tree properties, root property, red property, black property, algorithms for red-black tree operations (print, lookup, insert)</li>

</ul>


</div>
<div>

<a id="Exam3"></a>
<h2>Final Exam:</h2>

<p><b>You are responsible for material covered in:</b></p>

<ul>
  <li>Lectures</li>
  <li><a href="?r=syllabus">Readings</a></li>
  <li><a href="?r=coursework#Homeworks">Homeworks</a></li>
<!--
(homework solutions are on <a href="http://learnuw.wisc.edu" target="_page">Learn@UW</a>)</li>
-->
  <li><a href="?r=coursework#Programs">Programs</a></li>
</ul>

<!--
<p>Note that, if necessary, a reference will be provided in the
exam for a subset of methods for select Java API classes.</p>
-->

<p>A selection of sample exam questions is available on
<a href="http://learnuw.wisc.edu" target="_tab">Learn@UW</a>
in the "Content" section of the course.</p>

<h3>Topics List:</h3>

<ul>
  <li><b><a href="#Exam1">Midterm exam 1</a> and <a href="#Exam2">Midterm exam 2</a> topics</b><br> The final is cumulative although there will be somewhat more emphasis on the topics covered since midterm 2.</li>

  <li><b>Graphs</b><br> graph terminology: node, vertex, edge, directed, undirected, source, target, adjacent, successor, predecessor, degree, in-degree, out-degree, path; classifying different kinds of graphs: cyclic, acyclic, complete, connected, weakly-/strongly-connected, connected component, weighted, DAG; graph ADT (implementations &amp; complexities), representing edges: adjacency lists, adjacency matrix; graph traversals (BFS &amp; DFS), spanning trees, finding paths &amp; cycles, Dijkstra's algorithm, topological ordering</li>

  <li><b>Hashing</b><br> hashing terminology: key, hash function, hash code/index, hash table, load factor, collision, ideal hashing; hash table operations (algorithms &amp; complexities); choosing table size; defining a good hash function, hashing techniques: mod by table size, folding, extraction, weighting, handling non-integer keys; collision handling strategies: open addressing (linear &amp; quadratic probing, double hashing) and buckets (using different data structures)</li>

  <li><b>Sorting</b><br> comparison sorts: (algorithms &amp; complexities - time &amp; space, best &amp; worst case circumstances) including bubble sort, insertion sort, selection sort, merge sort, quick sort, heap sort; <!--two-way <s>selection</s> insertion sort,--> stable sort, radix sort</li>

</ul>

</div>
</content>