Fall 01/02
CSC 415 Section 105
Foundations of Computer Science I

1. Course Materials

• Class Announcement
  
  • [11/14] The grades are updated with hw8. Notice also that the hw with lowest grade is dropped.
  
  
  • [11/01] The Final will be on 11/14/01. It will be an In-class Exam.
    You will have 3 hours, form 6:15 to 9:15. It will be an open book/notes Exam.
  
  
  • [11/01] Hw9 is canceled, there will be no more hw. However, It's good to do the questions that were given in class yesterday.
  
  
  • [10/25] Hw8 is posted below.  
  
  
  • Grades     last updated: 11/14/01 
    • The StdID is the four last digits of your Student ID.
    • N/A means hw not submitted yet.
  
  
  • Useful Notations and Formulas
  
  
  •   The take-home midterm is posted below.
  
  
  • Please note that Hw 4 has been changed.  
  
  
  • A sample solution for Hw1 is posted bellow.  
  
  
  • Some Errata
  
  

• Assignments
  
  • Homework #8 (due 10/31) 
  
  
  
  • Homework #7 (due 10/24) 
  
  
  • Homework #6 (due 10/17) 
  
  
  • Take-home Midterm (due 10/10)
  • Some Sample Algorithms
  
  
  • Homework #5 (due 10/10) 
  
  
  • Homework #4 (due 10/03) 
  
  
  • Homework #3 (due 09/26) 
  
  
  • Homework #2 (due 09/19) 
  • Sample Solution Homework #2
  
  
  • Homework #1(extended to 09/19)
  • Sample Solution Homework #1

• Lecture Notes
  • week 11 (11/14): Final Exam
  
  
  • week 10 (11/07):
    Graph Theory
    • Reading: [ch. 6]
  
  
  • week 9 (10/31):
    Recurrence Relations (3)  
    Recurrence Relations, Master Theorem  
    • Reading: [ch. 6]
  
  
  • week 8 (10/24):
    Recurrence Relations (cont.)  
    Insertion Sort  
    Sorting Demo
    • Reading: [ch. 5.3, 6.1]
  
  
  • week 7 (10/17):
          Midterm Solution
          Recurence Relations  
    • Reading: [ch. 5.3]
  
  
  • week 6 (10/10):
            Complexity of Algorithms -- cont. Linear and Binary Search
    • Reading: [ch. 3.5] [ch. 5.1, 5.2]


• week 5 (10/03):
        Complexity of Algorithms
        Additionnal Notes  
  • Reading: [ch. 3.5]
        Practice Exercises.


• week 4 (09/26): Algorithms(2), Recursive Algorithms
  • Reading: [ch. 3.3, 3.4] and [ch. 3.5]


• week 3 (09/19): Induction, Algorithms  
  • Reading: ch. 1.6, 3.1, 3.2]


• week 2 (09/12): Quantifiers, Proofs, Mathematical Induction  
  • Additional notes for lecture1 Proofs and Quantifiers,
  • Reading: ch. 1.3 - 1.6


• week 1 (09/05): Propositional Logic  
  • Reading: ch. 1.1, 1.2, 1.3

• Syllabus & Schedule  

• Useful Notations and Formulas  

• Textbook Web Site

• CTI Tutoring

(Thanks to Tomuro)

2. Some Math Links

On-line Lecture Notes

• (Discrete Math) http://hebb.cis.uoguelph.ca/~deb/27190/ugly.html
• (Algebra) http://www.algebrahelp.com/
• (Algebra) http://library.thinkquest.org/10030/algecon.htm