University of Nevada Las Vegas
Howard R. Hughes College of Engineering
School of Computer Science
My Home Page

UNLV CS 477/677 Spring 2012 First Examination

Exam Date: Thursday, February 23, 2012, 2:30 PM.

Revision Date of this Document: Tue Feb 21 11:08:10 PST 2012
  1. Asymptotic classes: O, Omega, and Theta notation.
  2. Recurrences.
    1. Anti-derivative method. Sample question. Answer to sample question.
    2. Master Theorem.
    3. Substitution. Sample question. Answer to sample question.
  3. Well-known sorting algorithms. Sample questions. Answer to sample questions.
    1. Bubblesort.
    2. Insertion sort.
    3. Selection sort.
    4. Mergesort. Sample question. Answer to sample question.
    5. Quicksort. Sample question. Answer to sample question.
    6. Polyphase mergesort. Sample question. Answer to sample question.
    7. Heapsort. Sample question. Answer to sample question.
  4. Order statistics. (Finding the kth smallest item in a set of n items, without sorting.)
  5. Elementary data structures. Sample questions.
    1. Linked lists.
    2. Doubly linked lists.
    3. Cicular linked lists.
    4. Stacks.
    5. Queues.
    6. Heaps.
  6. Kruskal's algorithm.
  7. Huffman's algorithm.
  8. Dynamic Programming.
    1. Longest Common Subsequence.
    2. Etc.
  9. Algorithms for the three versions of the Minimum Path Problem
    1. Simple Dynamic Programming.
    2. Bellman-Ford Algorithm.
    3. Floyd-Warshall Algorithm.
    4. Disjkstra's Algorithm.
    5. Johnson's Algorithm.
    6. The A* Algorithm.

Back to Course Page