Methodology for problem solving: the case of iterator live-out value

888.11 seminars




[<< home] [Lecture 1] [Lecture 2] [Lecture 3] [Lecture 4] [Lecture 5] [Lecture 6]

Lecture 1: Overview and definition of the problem



Assignment for next class

Note: students will present their solution for the exercices on the whiteboard during the class.


Exercise 1
Write at least three sample input C programs that respect the Static Control Part constraints, and the associated desired output. Each input program must contain at least 4 loops and one conditional.


Lecture 2: Writing algorithms



Assignment for next class

Note: students will present their solution for the exercices on the whiteboard during the class.


Exercise 1
Write an algorithm which implements the description below:
Exercise 2
Write an algorithm which implements the description below:

Lecture 3: Solving the problem, part I



Assignment for next class

Note: students will present their solution for the exercices on the whiteboard during the class.


Exercise 1
Write an algorithm which implements the description below:

Lecture 4: Solving the problem, part II



Assignment for next class

Note: students will present their solution for the exercices on the whiteboard during the class.


Exercise 1
Write an algorithm which implements the description below:

Lecture 5: General algorithm for the Live-out Iterator Problem



Assignment for Wednesday, Sept. 15th

Note: students will present their solution for the exercices on the whiteboard during the class.


Exercise 1
Write an algorithm which implements the description below:


Lecture 6: Proving your Algorithm



Assignment for Friday, Oct. 1st

Note: students will present their solution for the exercices on the whiteboard during the class.


Exercise 1
Given an algorithm which implements the description below, prove its correctness.