Hamman’s Study Diary

March 14, 2007

Permutations and Pigeonholes!

Filed under: CSC 213, Spring 2007 — Hamman @ 7:11 pm

This day’s topics were…

  • Permutations
  • Combinations
  • Pigeonhole principle
  • Recurrance relations

From the Pigeonhole principle, we learnt about some of its applications in finding the minimum value that guarantees a certain condition. We also discussed the very interesting classical programming exercise “Towers of Hanoi”, in which we have begun on how to find the time taken to execute the algorithm for solving the puzzle…

Hanoi

The Planning Game

Filed under: SEN 261, Spring 2007 — Hamman @ 7:02 pm

Today we learnt about how to create, revise, estimate, rank, code and accept user stories: the planning game. We also learnt about how the client we learn about in books is different from the real world client.

Test review and next chapter

Filed under: MAT 211, Spring 2007 — Hamman @ 8:31 am

We got back our test papers back from the mid-term exam. We went through solutions and corrections, and will now be getting into the next chapter on partial derivatives and 4-space! I love 4-space!

4-D Cube

Image source: http://www.geocities.com/CapeCanaveral/7997/

Blog at WordPress.com.