Midterm test

When: Saturday February 19 2011, 10:00-12:00
Where: STE G 0-103 (Section A), STE B 0-138 (Section B)
Procedure for reviewing your copy of the midterm examination
What: All the lectures, all the assignments and all the laboratories.

Includes: Primitive and Reference Data Types; Object-Oriented Programming; Inheritance; Interface; Generic Data Structures; Stack Implementations (ArrayStack and DynamicArrayStack); Using Stacks and Posfix Expressions.
But not: Exceptions, graphical user interface.
Examinations from previous years:
- 2001 [ French ]
- 2002 [ English ]
- 2003 [ English, French ]
- 2004 [ English, French ]
- 2005 [ English, French ]
- 2006 [ English, French ]
- 2007 [ English, French ]
- 2008 [ English, French ]
- 2010 [ English, French ]
- 2011 [ English, French ]

Final examination

When: 2011-04-21 Thursday 09:30 - 12:30
Where: Sports Complex (SCS) Room: 2
What: Lectures, laboratories and assignments.
- In particular
  - Stack implementations and algorithms
  - Queue implementations and algorithms
  - Binary search trees implementations and algorithms
  - Circular arrays
  - Linked structures (singly, doubly, dummy node)
  - Iterators
  - Recursive list processing inside the class
  - Interfaces
  - Exceptions
- but not,
  - Recursive list processing outside the class
  - "Fail-Fast" implementation of an Iterator
  - Graphical User Interfaces (GUIs)
  - Input/Output (I/Os)
Examinations from previous years:
- 2001 [ French ]
- 2002 [ English ]
- 2003 [ English, French ]
- 2004 [ English, French ]
- 2005 [ English, French ]
- 2006 [ English, French ]
- 2007 [ English, French ]
- 2008 [ English, French ]
- 2010 [ English, French ]
- 2011 [ English, French ]