CSCSI/CMPE 3333

Exam 2 topics

The exam will have 2 types of questions:

type 1: "Did you study/payAttentionInClass/readTheBook" questions. To pass this course, you will be expected to ace these questions. For example, you should have no problem computing a Huffman encoding for a set of characters, or using quadratic probing to hash some values into a table.

type 2: "Are you able to apply what you learned to new problems" questions. These questions will be harder and are meant to give the A students a chance to show that they are A students.

Potential topics of exam questions:

Divide and Conquer

- k-select problem

- matrix multiplication problem

- be able to analyze the run time for a given divide and conquer algorithm (solve the recurrence). You may bring your recurrence printout to the exam for reference.

Hash Tables

- chaining, linear and quadratic probing

- Bloom filters

Min-heaps

Sorting

- Comparison based sorting

-MergeSort, quicksort, heapsort

-lower bounds for sorting n items, lower bound for sorting 8 items, etc.

- radix sort

Graph Algorithms

- adjacency matrix, adjacency list

- depth first search, breadth first search

- minimum spanning tree algorithms

-Prim's, Kruskal's

- shortest path algorithms

-Dijkstra's algorithm

Huffman codes