CS 580's course blog

Monday, September 24, 2012

Hint on homework 2

Some student asked me hint for problem 2 of homework 2.  The suggestion is that prove your claim with simple examples. For example, can you prove you claim on trees of size 3?




Posted by yi at 7:05 AM
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Labels: homework 2

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Labels

  • announcement (4)
  • data structure (8)
  • homework (1)
  • homework 2 (1)
  • lecture (21)

Blog Archive

  • ▼  2012 (61)
    • ►  December (5)
    • ►  November (15)
    • ►  October (15)
    • ▼  September (14)
      • Lecture 17 Union Find (1)
      • change of Siddharth's office hour
      • Lecture 16 Fibonacci heap (3)
      • Hint on homework 2
      • Lecture 15. Fibonacci Heap (2)
      • Lecture 14 Binomial Heap and Fibonacci Heap
      • lecture 13 Binomial Heaps (2)
      • Lecture 12. Binomial Trees and clarifications
      • Lecture 11 Splay Tree
      • Lecture 10 Splay Tree
      • Lecture 9 Amortized Analysis and Splay Tree
      • Good news(?)
      • Lecture 8. Amortized Analysis (2)
      • Lecture 7. Amortized Analysis (1)
    • ►  August (12)

Contributors

  • Siddharth
  • Unknown
  • yi
Simple theme. Powered by Blogger.