CMSC 341 Data Structures — Sections 01 & 04 — Spring 2017

News Archive

• [Tue Mar 14 14:20 2017]
  

  If you missed the midterm review chat we had earlier today, you can still read it on Hangouts: chat link. Alternatively, you can download the 28-page PDF Transcript.

  Also, here are the "fair game" topics for the midterm:

  • Big-Oh notation, Big-Omega notation
  • Running times of stack and queue operations implemented as linked-lists and arrays.
  • Estimate the running time of code snippets using Big-Oh and Big-Omega notation.
  • Writing functions (member and/or non-member) for linked lists.

  Here are topics that will not be on the exam

  • Theta notation
  • graphs
  • Binary-search trees, AVL trees
  • Proof by induction
  • Other proofs
  • Writing functions that use recursion
  • Coding with doubly-linked lists

• [Fri Mar 10 10:45 2017]
  Last semester's midterm exam.

• [Fri Mar 10 10:30 2017]
  Class attendance (worth five percent of your total grade) has been updated on your grade report through Thu March 9.

• [Fri Mar 10 10:30 2017]
  Here's some code we went over in class:
  • Binary search trees
  • AVL trees

• [Fri Mar 10 10:30 2017]
  Here is one website for AVL Tree Visualization. The same site also has visualizations for a bunch of data structures.

• [Thu Feb 23 16:30 2017]
  Here are the examples of using typedef and function pointers shown in class today (slightly modified):
  • typedef1.cpp
  • typedef2.cpp
  • fptr1.cpp
  • fptr2.cpp

• [Tue Jan 31 23:11 2017]
  Posted reading schedule in Schedule page.

• [Sun Jan 29 14:15 2017]
  Please check our section's schedule for exam dates.

• [Fri Jan 27 09:15 2017]
  Web page up!