Berkeley CSUA MOTD:Entry 36384
Berkeley CSUA MOTD
 
WIKI | FAQ | Tech FAQ
http://csua.com/feed/
2025/07/08 [General] UID:1000 Activity:popular
7/8     

2005/2/23-24 [Computer/Theory] UID:36384 Activity:nil
2/23    In the CLR book, chap 4.1-4.3, there are 3 basic ways of solving
        recurrence. The first way, 4.1, is the substitution method, which
        I think is straightforward and simple (albeit sometimes time
        consuming). The second way, 4.2, is the tree method, which I
        think is great, but a bit too informal as a proof. The last
        one, 4.3, master's theorem, is GREAT. Now suppose you're taking
        a test and forgot your master's theorem, can you actually get
        prove everything using 4.1? In another word, are there recurrences
        that can't be derived using 4.1, but can using 4.2 or 4.3? ok thx
        \_ Hey are you the 'contiguous sequence sum' guy?  Why do you feel
           the need to get the motd to solve your 170 for you?
           \_ this is kind of embarrassing but it's for the quals and since
              I haven't done this in ages (several years) I've pretty much
              forgotten everything.
              \_ Isn't this the case with math in general? I am having
                 a hard time remembering some things if I haven't used them
                 for about year, although the knowledge seems to come
                 back quicker than when learning things for the first time.
        \_ Just curious, which class is this for?
2025/07/08 [General] UID:1000 Activity:popular
7/8     

You may also be interested in these entries...
2010/3/7-30 [Computer/SW/Languages] UID:53743 Activity:nil
3/7     My sister is graduating soon with a decree in information management.
        She was orignally CS, but couldn't cut the math, so her GPA sucks.
        However, she has had a couple of internships and did fine.  She did
        desktop support at RockYou and is currently doing web programming
        at UC Santa Cruz, but they can't keep her on after graduation.
        Anyone got any jobs?  She wanted to be a network admin, but right now
	...
2009/9/18-29 [Computer/Theory] UID:53378 Activity:nil
9/18    I forgot my math.  Say the probability of a bug happening is the
        unknown fixed value p in [0,1].  I attempt to reproduce the
        bug until it happens once.  Then it happens at my n-th trial, so I
        stop.  Now, what is the expected value of p?  Is it E(p) = 1/n?  Thx.
        \_ Did a quick program to test.  Looks like E(p) = 1/n
           (given assumption n(p) = sum x = 1 to inf of x*(1-p)^(x-1)*p
	...
2009/8/3-13 [Computer/Companies/Google, Computer/SW/Security] UID:53230 Activity:high
8/1     Yahoo to get 88% of the ad revenue in team up with m$.  Y!m$,
        discuss?
        \_ I thought Jerry Yang would never sell!
           \_ He's gone, replaced by some broad.
        \_ 88% of pittance is still pittance, I don't know how people
          think there is money in click through ads.  Who clicks on them?
	...
2009/7/14-27 [Academia, Academia/GradSchool, Computer/Theory] UID:53139 Activity:nil
7/22    (redux)
        To those in academia, how do you organize the journal articles
        you keep (hard copies, that is)? By date? Author? Subject?
        Something else? Thanks.
        \_ I am not in academia, but author makes most sense. If you want, you
           can group by subject (Sun Spots, Solar Wind, Solar Flares) and then
	...