At Dartmouth, Chakrabarti has developed and taught a new course on ``Lower Bounds in Computer Science.'' The courses is designed to give beginning graduate students (and advanced undergraduates) a gentle introduction to lower bound techniques for a variety of problems studied in complexity theory. A website for the course contains a detailed day-by-day plan, homework excercises and solutions [4]. The second installment of this course will lead to lecture notes that will be made available publicly on the Web to benefit other teachers.