CS 61A Lecture 4: Higher-Order Procedures

respighisvoice Says:

May 14, 2012 - He notes that from his experience grading many mid-terms, many students seem not to understand how Let works. I'd like to suggest that the reason for that may be his miserably lousy explanation in this lecture. I have no background in CS, but have very strong analytical and quantitative skills. There is nothing difficult about the material so far. But the quality of the teaching in both the Berkeley and MIT lectures is just abominable. They make the simple seem far more complex than it is.

grykekj Says:

Mar 16, 2012 - Witam Zapraszam Wszystkich na nowo powstały Serwer (only Dust2)i(dd2+ bf2) Platforma : S&NS Tryb Gry: FFA Slotowy: 24 a drugi dd2 20 Cos o serwerach: Kultura, Miła Atmosfera, Kulturalni Admini, Ip: Only dd2:178.19.107.18:27074 i DD2 + bf2 :178.19.106.138:27071 forum: CsWitch.pl Admini Za DARMO!!!

MrNefski Says:

Jan 17, 2012 - @xssive405, Thanks, to say the true, decision came intuitively. I was watching one per day, as I remember. I've got purple book of wisdom, but have not enough time and energy to study, now... sad, but true.

xssive405 Says:

Jan 17, 2012 - By the by: On me NetBSD system with Gambit-C as scheme environment it does 100000 with no problems.

xssive405 Says:

Jan 17, 2012 - That's neat. Encapsulating the lambda within a lambda in order to label the function fn. Seems like the most direct approach. I wouldn' t have thought it up, but I've been watching all 4 videos straight in a row :) Which might be a bit too much at once.

Argcz Says:

Jan 12, 2012 - I love how empty the classroom compared to week1 vid lol :)

ArchSaur Says:

May 7, 2011 - BASIC (-:

ArchSaur Says:

May 7, 2011 - Dumb syntax is first problem you get here, everything else seems actually simple to me. Why can't let ((N1 V1) (N2 V2) ... (Nn Vn)) have syntax like let {N1:V1; N2:V2; ... Nn:Vn}. Why create all that mess with "different kind of parenthesis"?..

harleybristowabc Says:

Feb 5, 2011 - Java

apilash Says:

Dec 30, 2010 - what language is good to start with? please reply :d apilash 1 minute ago

apilash Says:

Dec 30, 2010 - what language is good to start with? please reply :d

anantnewbie Says:

Aug 30, 2010 - Brilliant! 

banzaimonkey Says:

Aug 6, 2010 - The example code is written in Scheme. The functions described on the board between 4:05 and 7:30 correspond to Python's map (every), filter (keep), and reduce (accumulate), which are also designed to work with lambda functions.

weedipikia Says:

Jun 5, 2010 - Lambda Lambda Lambda and Omega Mu

TheNefski Says:

Jan 6, 2010 - Regarding a talk on 42:04 sec. Is this correct solution? ((lambda (x fn) (fn x fn)) 10000 (lambda (x fn) (if (= x 0) 1 (* (fn (- x 1) fn) x)))) Works quite fine with 10000 (less then sec) gives nice looking long result. Fails with 100000 (Segmentation fault).

rycemuffin Says:

Sep 18, 2009 - thanks

aaronarmstrongskomra Says:

Sep 4, 2009 - The contents of lectures 5 and 6 is a video lecture by Alan Key - it is also available at the internet archive (in better quality) under the titles "AlanKeyD1987" and "AlanKeyD1987_2" Lecture 7 is a regular lecture. I have no idea why it is marked private.

ogrish84 Says:

Aug 28, 2009 - Why have some of these been made private?!