CSC 148H - INTRODUCTION TO COMPUTER SCIENCE

Announcements and Advice about Assignment 4

Tu, 7 November:

Question: Problem 6 says: "She explained to the suitor that each inscription is either true or false (not both)". Does it mean that one of them is true, then the other is false? or could it be possible that both of them are true or both are false?
Answer: Both inscriptions can be true and both can be false. However, a given inscription is either true or false but not both.

---

Su, 5 November: Typo in Question 4

Another typo in the assignment. Fibonacci numbers should be defined as F(n) = F(n-1) + F(n-2) for n > 2, not n >= 2. The new version of the assignment has now been posted.

---

Su, 29 October: Typo in Question 2

There was a typo in the assignment, question 2 (a), in Induction Hypothesis. It should read "(k+1)(k+1) + 5(k+1) + 1" instead of "+ 2". The assignment has been updated to reflect this change.

---