Data Structures and Algorithms Lecture Notes

4 May 2011 • Assignment Code Review

---

Outline

• Assignment 1, linked lists.
• Assignment 2, finding skylines.
• Assignment 3, shortest games.

Assignment 1, Linked Lists

• Implement a linked list.
• Implement a cursor into the list for element access and traversal.
  • The cursor should include some notion of invalidity.

Linked-List Cursors

• Cursor routines are split across two interface:

  LinkedSequenceCursor<E>
  
    E get()
  
    void put(E v)
  
  LinkedSequence<E>
  
    LinkedSequenceCursor<E> 
      next(LinkedSequenceCursor<E> c)
  
  

Assignment 2, Skylines

Assignment 3, Shortest Games

---

This page last modified on 2010 April 22.