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

Computer Science 302
Data Structures
Spring 2014
Assignments and Lecture Topics

Revised May 21, 2014

Tuesday, January 21, 2014
We will begin immediately with Asymptotic complexity. We will discuss "big O" notation, and why it is important.
Thursday, January 23, 2014
Tuesday, January 28, 2014
Turn in Assignment 1 at the beginning of class today.
Thursday, January 30, 2014
Today, we will finish the discussion quicksort. I will also introduce polyphase mergesort. We will not cover heapsort or binary tree sort, since we haven't done heaps or binary trees yet.
The next topic is abstract data types, including stacks and queues.
Tuesday, February 4, 2014
Implementation of stacks and queues:
Thursday, February 6, 2014
Turn in Assignment 2 by midnight tonight.
Tuesday, February 11, 2014
Turn in Assignment 3 by midnight tonight.
Thursday, February 13, 2014
Examination today.
First exam from Fall of 2011
Highest score: 175
75 percentile score:146
Median score: 117
25 percentile score: 90
Mean score: 118
Tuesday, February 18, 2014
Thursday, February 20, 2014
Tuesday, February 25, 2014
Thursday, February 27, 2014
Turn in Assignment 4 by midnight tonight.
Tuesday, March 4, 2014
Thursday, March 6, 2014
Tuesday, March 11, 2014
Turn in Assignment 5 by midnight tonight.
Thursday, March 13, 2014
Examination today.
Practice exam in pdf form.
Practice exam in postscript form.
Highest possible score: 295
Highest score: 285
75 percentile score: 230
Median score: 160
25 percentile score: 110
Mean score: 170
Tuesday, March 25, 2014
I went over Problem 3(c) on the exam with Mr. Andro-Vasko after class. The answer is Θ(n3/2). I will explain it on Thursday.
Thursday, March 27, 2014
Tuesday, April 1, 2014
Thursday, April 3, 2014
Turn in Assignment 6 by midnight tonight.
Tuesday, April 8, 2014
Thursday, April 10, 2014
Tuesday, April 15, 2014
Turn in Assignment 7 by midnight tonight.
Thursday, April 17, 2014
Examination today.
Practice exam, Fall 2010, in pdf form.
Practice exam, Fall 2010, in postscript form.
Practice exam, Fall 2012, in pdf form.
Practice exam, Fall 2012, in postscript form.
addendum
Possible score: 225
Highest score: 205
75 percentile score: 160
Median score: 150
25 percentile score: 124
Mean score: 139
Tuesday, April 22, 2014
Thursday, April 24, 2014
Tuesday, April 29, 2014
Thursday, May 1, 2014
Tuesday, May 6, 2014
Turn in Assignment 8 in class today.
Thursday, May 8, 2014
Tuesday, May 13, 2014
Final Examination, 10:10 to 12:10.
Sample final from Spring, 2005, postscript version. Here is a (pdf).
Some helpful links on data structures.
The practice final from Fall 2008 in portable document format (pdf).
The practice final from Fall 2008 in postscript format.
The practice final from Fall 2007 in portable document format (pdf).
The practice final from Fall 2007 in postscript format.
The practice final from Spring 2007 is in two parts. Here is Part I: (postscript) (pdf)
A study guide for the Spring 2007 final.
More study links.
Here is Part II of the spring 2007 practice final: (postscript) (pdf)
The practice final from Fall 2008: (postscript) (pdf)
The practice final from Fall 2007: (postscript) (pdf)
Some more topics to master..
Additional sample problems, postscript version. Here is a pdf version.
Additional topic: cuckoo hashing.
Wednesday, May 21, 2014
It's almost 2:00 AM, and I have posted the grades.

Back to Course Page