Computer Science 433
Programming Languages

Fall 2012, The College of Saint Rose

Home     Syllabus     Schedule

Agenda

• Announcements
  • Reminder: no class a week from today, so we'll next meet Wednesday, 11/28
  • Related: office hours this afternoon, but none after that until Tuesday, 11/27
  • Program/Problem Set 7 continues
  • Language project progress reports due now
• Lecture assignment 21 recap
• Assignment Statements
• Control Structures

Lecture Assignment 22

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

Please submit answers to these questions either as a hard copy (typeset or handwritten are OK) or by email to terescoj AT strose.edu by the start of class. Please use a clear subject line when submitting by email (e.g., CSC 433 Lecture Assignment 22, Joe Student). We will discuss these questions at the start of class, so no late submissions are accepted.

The readings for next class are Sebesta Chapter 8.

• Briefly discuss the relative advantages of Pascal's choice of assignment operator (:=) and equality operator (=) and that in the C-based languages (= and ==, respectively). (5 points)
• Sebesta Problem Set Question 4, p. 382. (3 points)
• Sebesta Problem Set Question 5, p. 382. (3 points)
• Sebesta Problem Set Question 9, p. 382. (3 points)

Examples

• switch
• gotoloops

Links

• For Loops in Ada Control, Wikibooks