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…


Leave a Comment »

No comments yet.

RSS feed for comments on this post. TrackBack URI

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

Create a free website or blog at WordPress.com.

%d bloggers like this: