Held: Tuesday, 18 November 2014

Back to Outline 42 - Higher-Order Procedures, Revisited. On to Outline 44 - Association Lists.

Summary

We consider techniques for analyzing the number of calls made in evaluating procedures, particularly recursive procedures. We consider why such analysis is useful.

Related Pages

• Reading: Analyzing Procedures
• Lab: Analyzing Procedures
• EBoard 43 (Source 43) (HTML 43)

Overview

• Comparing algorithms.
• Two related metrics: Time and Number of steps.
• Counting procedure calls by printing.
• Tools for analysis.

Administrivia

• Continue partners.
• Project sketches due!
  • I plan to comment on your proposals and sketches tonight.
• Quizzes likely returned tomorrow. (I had four hours reserved for work this a.m.; three got used for administrative work.)
• Reminder: Review sessions on Wednesday and Thursday!

Upcoming Work

• No lab writeup.
• Reading for Wednesday:
  • Association Lists
• Part two of the project due next Tuesday.
• Nothing due the week after Turkey break.
  
  • We may distribute exam 4 next Wednesday for those who want to use break time to work on the exam. But it will be designed as if we distributed it immediately after break.

Extra Credit Opportunities

Academic

• CS Extras Thursday: Text Recognition in Maps
• CS Table Friday: One Year After Healthcare.gov
• CS Extras Tuesday the 25th: Summer Opportunities in CS

Peer Support

• Karan's radio show 11pm Thursday nights on KDIC
• Evan's radio show 5pm Friday nights on KDIC
• Donna's radio show Sunday midnight on KDIC
• One acts, coming soon
• Swimming and Diving at Loras on Saturday

Miscellaneous

• VP Student Affairs Candidate Open Sessions
  • Wednesday, 4:15, JRC 209
  • Friday, 4:15, JRC 209

Overview

• When comparing algorithms, we often care which one is faster.
• We can analyze by hand.
• We can carefully study the code and predict (covered in future CS courses)

Lab

• Do the lab