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
-
Asymptotic classes: O, Omega, and Theta notation.
-
Recurrences.
-
Anti-derivative method.
Sample question.
Answer to sample question.
-
Master Theorem.
-
Substitution.
Sample question.
Answer to sample question.
-
Well-known sorting algorithms.
Sample questions.
Answer to sample questions.
-
Bubblesort.
-
Insertion sort.
-
Selection sort.
-
Mergesort.
Sample question.
Answer to sample question.
-
Quicksort.
Sample question.
Answer to sample question.
-
Polyphase mergesort.
Sample question.
Answer to sample question.
-
Heapsort.
Sample question.
Answer to sample question.
-
Order statistics.
(Finding the kth smallest item
in a set of n items, without sorting.)
-
Elementary data structures.
Sample questions.
-
Linked lists.
-
Doubly linked lists.
-
Cicular linked lists.
-
Stacks.
-
Queues.
-
Heaps.
-
Kruskal's algorithm.
-
Huffman's algorithm.
-
Dynamic Programming.
-
Longest Common Subsequence.
-
Etc.
-
Algorithms for the three versions of the Minimum Path Problem
-
Simple Dynamic Programming.
-
Bellman-Ford Algorithm.
-
Floyd-Warshall Algorithm.
-
Disjkstra's Algorithm.
-
Johnson's Algorithm.
-
The A* Algorithm.

Back to
Course Page