COSC 2011 Section N
Tuesday, March 20 2001
In this lecture as well as the lecture on Thursday, Loop
Invariants, Mathematical Induction
and Recursion will be covered. While
covering these topics, basic recursive algorithms on Trees and Binary
trees will also be examined. You are encouraged to review the following
material available in the text as it will be useful:
A Quick Mathematical Review:
-
first edition: pages 35-38
-
second edition: pages 103 - 106.
Pseudo Code: (which has already been covered in the lectures)
-
first edition: pages 32-35
-
second edition: pages 100-103
Here are the sections of the textbook:
| Pages |
Section |
| 134-136 |
4.4 |
| 40-42 |
2.4.3 |
| 162-163 |
5.3.1 |
| 152-161 |
5.2.1-5.2.3 |
| 165-172 |
5.3.3 |
| Pages |
Section |
| 211-214 |
5.4 |
| 108-110 |
3.4.3 |
| 249-250 |
6.3.3 |
| 236-246 |
6.2.1-6.2.4 |
| 251-257 |
6.3.4 |
Additional Material:
Additional Material (related to Thursday's lecture):
-
Implementation of a stack, queue and deque with linked lists in pseudocode
PDF
format (written by Professor Franck van Breugel)
-
Java Source Code (written by Professor Franck van Breugel)