CMSC 341 — Data Structures — Section 01 — Fall 2016

News Archive

• [Mon Dec 12 11:00 2016]
  Here's a copy of an old final exam: old-final.pdf. We will discuss in class which questions are appropriate.

• [Mon Dec 12 10:45 2016]
  Prof. Chang's office hours on Wednesday 12/14 is moved to 2:30pm.

• [Tue Dec 06 07:50 2016]
  Homework 6 posted. Due date/time is Tuesday Dec 13, 9:00pm, online.

• [Tue Nov 22 09:45 2016]
  Homework 5 posted. Due date is Thursday Dec 1. Please turn in on paper, in class.

• [Mon Nov 21 11:58 2016]
  A Project 5 posted.

• [Thu Nov 10 09:45 2016]
  Project 4 due date is pushed back to Tuesday, November 22.

• [Fri Nov 04 10:15 2016]
  Clarified that in Homework 4, Question #2 has a min heap and Question #3 has a max heap.

• [Thu Nov 03 11:28 2016]
  Here is a nice write up of Skew Heaps including the amortized analysis.

• [Thu Nov 03 07:25 2016]
  A Draft of Project 4 posted.

• [Tue Nov 01 13:00 2016]
  Homework 4 posted.

• [Tue Nov 01 12:30 2016]
  Reference for Leftist Heaps:
  • The Wikipedia article on Leftist Heaps is a bit terse. Note that the "S-value" that they talk about is what we've been calling the null-path length.
  • Chapter 5 of the Handbook of Data Structures and Applications is viewable in Google Books.
  • Leftist Heaps section in Data Structures and Algorithms with Object-Oriented Design Patterns in C++.
  • As usual, you can use David Galles' visualization tool to play with Leftist Heaps.

• [Thu Oct 27 09:50 2016]
  Exam 1 Key is available in our shared Google folder.

• [Thu Oct 27 09:50 2016]
  Prof. Chang's office hours on Wed November 2 is moved to 2:30pm - 3:30pm.

• [Thu Oct 27 09:50 2016]
  Temporary mirror web site on GL web server has been removed.

• [Wed Oct 19 09:25 2016]
  The official version of Project 3 posted. Looks about the same as we discussed in class.

• [Sat Oct 08 15:55 2016]
  These topics are fair game for Exam 1:
  • Big-Oh notation
  • Give upper bound on the worst case running time of a code fragment uisng big-Oh notation.
  • Stacks and queues implemented as arrays and linked lists including pros and cons of each and running times.
  • Writing linked list code.
  Here's a copy of an old exam, but it is in Java and we didn't cover Ω() or Θ() this semester. Also, the last question is ask about coding using Java Collections. This would be the equivalent of asking you to write code using STL, which would be appropriate in Exam 2, after you have completed Project 2.
  Old Exam 1 (PDF).

• [Thu Oct 06 09:30 2016]
  Here is one website for AVL Tree Visualization. The same site also has visualizations for a bunch of data structures.

• [Tue Oct 04 17:45 2016]
  Project 2 posted.
  I included a temporary unofficial copies of cards.txt and commodities.txt. You should use the official copies when they come out.

• [Tue Oct 04 17:45 2016]
  Code we looked at today to get command line arguments: args.cpp.

• [Thu Sep 29 13:30 2016]
  A slightly cleaned up version of the code for binary search trees that we looked at in class today is available in our shared folder on Google Drive, under BST.

• [Thu Sep 29 09:30 2016]
  Homework 3 posted.

• [Tue Sep 27 12:30 2016]
  Binary search implementations we looked at today
  • bsearch1.cpp
  • bsearch2.cpp
  • bsearch3.cpp
  • bsearch4.cpp

• [Tue Sep 13 09:50 2016]
  Homework 2 posted.

• [Tue Sep 13 01:10 2016]
  Project 1 posted.

• [Thu Sep 01 14:00 2016]
  Examples of string parsing shown in class today.

• [Thu Sep 01 09:43 2016]
  Homework 1 posted.

• [Thu Sep 01 09:43 2016]
  Setting up submission directory

• [Thu Sep 01 09:40 2016]
  Project 0

• [Thu Sep 01 09:31 2016]
  Please check the Projects page for due dates for all of the projects this semester and plan your calendar accordingly!

• [Thu Sep 01 09:30 2016]
  Web page is up.