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

Computer Science 302
Data Structures
Fall 2011
Notes and Assignments

Revised December 8, 2011

Tuesday, August 30, 2011
This Wikipedia page gives an excellent summary of "Big O" notation, otherwise known as Landau notation. You've heard that Wikipedia is unreliable, and that's true. However, most of the articles are correct.
Read only down to, but not including, the section "Related asymptotic notation." Some of those further topics will be covered later.
Also, skip the section Infinitesimal Asymptotics, as that section does not apply to the usage of Landau notation in computer science.
Thursday, September 1, 2011
Turn in Assignment 1 at 1:00 PM today.
Time complexity of simple blocks of code, such as these.
Binary Search: a recursive algorithm for searching for an item in an ordered list.
Tuesday, September 6, 2011
Thursday, September 8, 2011
Turn in Assignment 2 electronically to the graduate assistant by midnight tonight.
Tuesday, September 13, 2011
We have to change again! This time, to room TBE B178.
Thursday, September 15, 2011
Turn in Assignment 3 electronically to the graduate assistant by midnight tonight.
Tuesday, September 20, 2011
Work Assignment 4 by class time today, but do not turn it in.
Thursday, September 22, 2011
The first examination will be given today.
Some topics that could be on the exam.
Tuesday, September 27, 2011
Thursday, September 29, 2011
Tuesday, October 4, 2011
Thursday, October 6, 2011
Tuesday, October 11, 2011
Turn in Assignment 5 electronically to the graduate assistant by midnight tonight.
Thursday, October 13, 2011
More on graphs.
More on search structures.
Search structure implementation of a sparse array.
Tuesday, October 18, 2011
Thursday, October 20, 2011
Today, I will spend 15 minutes going over the programming assignment that is due next week.
Tuesday, October 25, 2011
Turn in Assignment 6 electronically to the graduate assistant by midnight tonight.
Thursday, October 27, 2011
The second examination will be given today.
Practice exam in pdf form.
Practice exam in postscript form.
Tuesday, November 1, 2011
Thursday, November 3, 2011
Tuesday, November 8, 2011
Thursday, November 10, 2011
Tuesday, November 15, 2011
Turn in Assignment 7 electronically to the graduate assistant by midnight tonight.
Turn in Assignment 8 electronically to the graduate assistant by midnight tonight.
Turn in Assignment 9 electronically to the graduate assistant by midnight tonight.
Thursday, November 17, 2011
The third examination will be given today.
Last year's practice exam in pdf form.
Last year's practice exam in postscript form.
There are very few areas we covered this year that are not on this practice exam. They include Union-Find, components, strong components, and trees (all the different kinds of trees, that is).
Tuesday, November 22, 2011
Tuesday, November 29, 2011
Three algorithmic paradigms:
  1. Greedy.
    • Huffman coding.
    • Kruskal's algorithm.
  2. Divide and Conquer.
    • Mergesort.
    • Quicksort.
  3. Dynamic Programming.
Thursday, December 1, 2011
Tuesday, December 6, 2011
Turn in Assignment 8 in handwritten form to the graduate assistant by 1:00 PM today.
Thursday, December 8, 2011
Tuesday, December 13, 2011
Final Examination today, 1:00 to 3:00.
Some helpful links on data structures.
The practice final from Fall 2008: (postscript) (pdf)
The practice final from Fall 2007: (postscript) (pdf)
The practice final from Spring 2007 is in two parts. Here is Part I: (postscript) (pdf)
Here is Part II of the spring 2007 practice final: (postscript) (pdf)
A study guide for the Spring 2007 final.
More study links.
There are some questions on these old practice finals that deal with topics that we did not cover this semester. You are not responsible for those topics.
If there is any topic that you are responsible for that is not covered in one of the above practice exams (including practice exams for the first, second and third exams) I will put up additional material as soon as possible.

Back to Course Page