University of Nevada Las Vegas
Howard R. Hughes
College of Engineering
Department of Computer Science
My Home Page
Computer Science 302
Data Structures
Fall 2012
Notes and Assignments
Revised May 9, 2013

-
Tuesday, August 28, 2012
-
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, August 30, 2012
-
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 4, 2012
-
Turn in Assignment 1 at 1:00 PM today.
-
Thursday, September 6, 2012
-
- Tuesday, September 11, 2012
-
Turn in Assignment 2 electronically
to the graduate assistant by midnight tonight.
- Thursday, September 13, 2012
-
Examination today.
-
The highest score was 145, out of 150.
The 75 percentile score was 121.
The median score was 85.
The 25 percentile score was 63.
The mean score was approximately 89.
-
Tuesday, September 18, 2012
-
We will discuss recursion. (I realize that you already
thoroughly
understand recursion, but we'll review it anyway.)
-
We will go over mergesort and quicksort; Sections 7.6 and 7.7 of
your textbook.
-
One of the most critical things for you to learn from this lecture
is the loop invariant of the inner loop of quicksort.
It is my experience that it is almost impossible
to write the code of quicksort
correctly if you do not first write down the loop invariant.
-
-
We will introduce stacks and queues; Chapter 3 of your textbook.
-
Thursday, September 20, 2012
-
Continue the topics of Tuesday.
- Thursday, September 27, 2012
-
Due to a meeting of the Faculty Affair Committee, I will not be in my
office at 11:00. I hope to be back by noon, but I will certainly be in
class.
- Tuesday, October 2, 2012
-
Turn in Assignment 3 electronically
to the graduate assistant by midnight tonight.
- Thursday, October 11, 2012
-
Turn in Assignment 4 electronically
to the graduate assistant by midnight tonight.
- Tuesday, October 16, 2012
-
Turn in Assignment 5 electronically
to the graduate assistant by midnight tonight.
- Thursday, October 18, 2012
-
The examination scheduled today is postponed, because we
need to cover more material first.
- Thursday, October 25, 2012
-
Examination today.
-
Practice exam in pdf form.
-
Practice exam in postscript form.
-
The highest score was 230, out of 240.
The 75 percentile score was 210.
The median score was 188.
The 25 percentile score was 153.
The mean score was approximately 180.
- Tuesday, November 13, 2012
-
Turn in Assignment 6 electronically
to the graduate assistant by midnight tonight.
-
Those
Dynamic Progamming Problems I found on the internet.
- Tuesday, November 20, 2012
-
Examination today.
-
Practice exam in pdf form.
-
Practice exam in postscript form.
-
Updated summary:
-
The highest score was 210, out of 210.
The 75 percentile score was 167.
The median score was 151.
The 25 percentile score was 124.
The mean score was approximately 144.
-
Tuesday, December 11, 2012
-
Final Examination today, 1:00 to 3:00.
-
Some helpful links on data structures.
-
The practice final from Fall 2008:
(postscript)
(pdf)
The capital Greek letter Omega is used in problem 1 (c) and (d).
We didn't go over the meaning of Omega this semester.
Skip problems 19 and 20, since we didn't cover that material this semester.
-
The practice final from Fall 2007:
(postscript)
(pdf)
The capital Greek letter Omega is used in problem 1 (c) and (d).
We didn't go over the meaning of Omega this semester.
Skip problems 19 and 20, since we didn't cover that material this semester.
-
The practice final from Spring 2007 is in two parts.
Here is Part I:
(postscript)
(pdf)
The capital Greek letter Theta is used in problem 1 (a),
and Omega is used in problem 1 (c) and (d).
We didn't go over the meanings of Theta and Omega this semester.
In problem 10, forget the option of Theta.
Skip problem 13, since we didn't cover that material this semester.
-
Here is Part II of the spring 2007 practice final:
(postscript)
(pdf)
In problem 18 you are supposed to use Huffman's algorithm.
Skip problem 24.
-
Some more topics to master..
-
-
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.
-
The final examination has been graded.
The highest score was 275, out of 295.
The 75 percentile score was 238.
The median score was 205.
The 25 percentile score was 165.
The mean score was approximately 198.
-
Tuesday, December 18, 2012
-
I have entered grades into the system. If you cannot find
your grade at
MyUNLV, please let me know.
-
Have a Merry Christmas and a Happy New Year!

Back to
Course Page
