Computer Science 501
Data Stuctures and Algorithm Analysis

Fall 2013, The College of Saint Rose

Home     Syllabus     Schedule     Style Guide

Agenda

• Announcements
  • Midterm exam score improvement opportunity next week - see the email for details, discussion after our regular class meeting tonight
  • Lab 6: The Two Towers [HTML] [PDF] due - discussion next week
  • Programming Project 2: Analyzing Sorting Algorithms [HTML] [PDF] due date now 6:00 PM, November 6
• Lab 5: Sorting With Comparators [HTML] [PDF] discussion
• Lecture 8 assignment recap
• More linked lists
  • simple singly-linked
    • complexity of public operations
    • iterator
    • adding a count
    • adding a tail pointer
  • circular
    • complexity of public operations
    • iterator
  • doubly-linked
    • complexity of public operations
• Linear structures
  • stacks
    • array-based
    • Vector-based
    • List-based
    • comparisons
  • queues
    • List-based
    • Vector-based
    • array-based
  • why these restricted structures?
• Lab 7: P.S.: It's Just a Stack [HTML] [PDF] out

Lecture 9 Assignment

Due at the start of class, Wednesday, November 6.

Please submit answers to these questions in Submission Box under "LA9" by the start of our next class. We will discuss these questions at the start of class, so no late submissions are accepted. Please be sure that your name is clearly indicated in all submissions.

• Bailey Problem 9.4, p. 212. (4 points) [Be sure to do the one in the "Problems" section at the bottom of the page, not the one in the "Self Check Problems" section at the top.]
• Bailey Problem 9.16, p. 213. (4 points)
• Bailey Problem 10.8, p. 246. (3 points)
• Bailey Problem 10.10, p. 246. (3 points)
• Bailey Problem 10.12, p. 246. (6 points)