Computer Science 302
Data Structures
Spring 2013
Assignments and Lecture Topics

Revised May 12, 2013

Tuesday, January 22, 2013

Thursday, January 24, 2013

Tuesday, January 29, 2013

Turn in Assignment 1 at the beginning of class today.

Thursday, January 31, 2013

Tuesday, February 5, 2013

Thursday, February 7, 2013

Turn in Assignment 2 by midnight tonight.

Tuesday, February 12, 2013

Today we will discuss asymptotic complexity of code fragments.

We will also go over Kruskal's Algorithm and Huffman's Algorithm, two well-known greedy algorithms..

Thursday, February 14, 2013

Examination today.

First exam from Fall of 2011

Highest score: 225
75 percentile score:161
Median score: 138
25 percentile score: 116
Mean score: 143

Tuesday, February 19, 2013

Thursday, February 21, 2013

Tuesday, February 26, 2013

Today we will finish the array implementation of the binary tree implementation of a heap

We will introduce heapsort, which uses that implementation.

If time permits, we will discuss left and right rotation.

Thursday, February 28, 2013

Tuesday, March 5, 2013

Thursday, March 7, 2013

Turn in Assignment 3 by midnight tonight.

Our GA's correct email address is: androvas"at"unlv"dot"nevada"dot"edu Sorry about the error!

Tuesday, March 12, 2013

Turn in Assignment 4 by midnight tonight.

Our GA's correct email address is: androvas"at"unlv"dot"nevada"dot"edu Sorry about the error!

Thursday, March 14, 2013

Examination today.

Examination today.

Practice exam in pdf form.

Practice exam in postscript form.

Highest possible score: 240
Highest score: 235
75 percentile score: 183
Median score: 152
25 percentile score: 130
Mean score: 153

Tuesday, March 19, 2013

Thursday, March 21, 2013

Tuesday, April 2, 2013

Turn in Assignment 5 by midnight tonight.

Thursday, April 4, 2013

Tuesday, April 9, 2013

Some interesting history about dynamic progrmming: why that name?

Some dynamic programming problems.

Thursday, April 11, 2013

Turn in Assignment 6 by midnight tonight.

If you wish, you can turn in Assignment 7 at the same time.

Tuesday, April 16, 2013

Turn in Assignment 7 by midnight tonight.

You can reuse code from Assignment 6.

Thursday, April 18, 2013

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.

If it turns out that we cover material not on either of those practice exams, I'll put up a small addendum later.

Some topics not on either of those practice exams:

• Cuckoo hashing.
• The Bellman-Ford algorithm.
• Dynamic programming, such as finding the maximum length monotone subsequence, or finding the edit distance between two strings,
• We did not go over how to implement higher than two dimensional arrays in main memory, so on the test, the dimension of the array will not exceed 2.
• Dijstra's algorithm and Union/find will not be on the test.

Highest score: 210
75 percentile score: 180
Median score: 150
25 percentile score: 134
Mean score: 151

Tuesday, April 23, 2013

Thursday, April 25, 2013

Tuesday, April 30, 2013

Thursday, May 2, 2013

Turn in Assignment 8 at the beginning of class today.

Tuesday, May 7, 2013

Thursday, May 9, 2013

Tuesday, May 14, 2013

Final Examination, 10:10 to 12:10.

Some helpful links on data structures.

In all of these practice finals, ignore any problem that mentions heapsort or Dijkstra's algorithm.

The practice final from Fall 2008: (postscript) (pdf)

The practice final from Fall 2007: (postscript) (pdf)
Ignore Problem 20.

The practice final from Spring 2007 is in two parts.
Here is Part I: (postscript) (pdf)
Ignore Problem 13.

Here is Part II of the spring 2007 practice final: (postscript) (pdf)
Ignore Problem 24.

Some more topics to master..

Additional topic: cuckoo hashing.