Computer Science 431
Algorithms

Spring 2015, The College of Saint Rose

Home     Syllabus     Schedule

Agenda

• Announcements
  • Software engineering talk tonight, AH 205, 7:30 PM, Tim Kelliher and Wes Turner from SimQuest
  • Fall 2015 schedule
• Problem Set 6: Trees [HTML] [PDF] continues (now posted online)
• Lecture 16 assignment recap
• More on heaps
• Heapsort

Lecture 17 Assignment

Due at the start of class, Wednesday, March 25.

Please submit answers to these questions in Submission Box under "LA17" or in hard copy 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.

Please note that this is a longer-than-usual lecture assignment.

You'll need to read Levitin Section 6.5 about Horner's algorithm, which we will not discuss in class as many of you are likely familiar with the idea from math.

• Levitin Exercise 6.4.7, p. 233 (6 points)
• Levitin Exercise 6.4.8, p. 233 (4 points)
• Levitin Exercise 6.5.1, p. 239 (2 points)
• Levitin Exercise 6.5.2, p. 239 (3 points)
• Levitin Exercise 6.5.3, p. 239 (3 points)
• Levitin Exercise 6.5.4, p. 239 (2 points)