3/13 lecture ratings and replies to some comments/questions. about 59 responses 4 1KnowAnalyze-Performance: 1) very bad 4 1KnowAnalyze-Performance: 2) bad 38 1KnowAnalyze-Performance: 3) ok 11 1KnowAnalyze-Performance: 4) good 3 1KnowAnalyze-Performance: 5) very good 1 1LecAnalyze-Performance: 0) don't remember seeing it 1 1LecAnalyze-Performance: 1) very bad 7 1LecAnalyze-Performance: 2) bad 38 1LecAnalyze-Performance: 3) ok 10 1LecAnalyze-Performance: 4) good 3 1LecAnalyze-Performance: 5) very good 3 2KnowCreate-Matrix: 1) very bad 5 2KnowCreate-Matrix: 2) bad 20 2KnowCreate-Matrix: 3) ok 24 2KnowCreate-Matrix: 4) good 8 2KnowCreate-Matrix: 5) very good 1 2LecCreate-Matrix: 1) very bad 4 2LecCreate-Matrix: 2) bad 24 2LecCreate-Matrix: 3) ok 27 2LecCreate-Matrix: 4) good 4 2LecCreate-Matrix: 5) very good 2 3KnowMatrix-Ops-Funcs: 1) very bad 13 3KnowMatrix-Ops-Funcs: 2) bad 26 3KnowMatrix-Ops-Funcs: 3) ok 12 3KnowMatrix-Ops-Funcs: 4) good 7 3KnowMatrix-Ops-Funcs: 5) very good 9 3LecMatrix-Ops-Funcs: 2) bad 32 3LecMatrix-Ops-Funcs: 3) ok 15 3LecMatrix-Ops-Funcs: 4) good 4 3LecMatrix-Ops-Funcs: 5) very good 1 4KnowMatrix-Indexing: 1) very bad 12 4KnowMatrix-Indexing: 2) bad 20 4KnowMatrix-Indexing: 3) ok 21 4KnowMatrix-Indexing: 4) good 5 4KnowMatrix-Indexing: 5) very good 8 4LecMatrix-Indexing: 2) bad 25 4LecMatrix-Indexing: 3) ok 22 4LecMatrix-Indexing: 4) good 4 4LecMatrix-Indexing: 5) very good 1 5LecOverall: 3) ok 9 6LecOverall: 2) bad 32 6LecOverall: 3) ok 13 6LecOverall: 4) good 5 6LecOverall: 5) very good 4 6LecPace: 2) too slow 42 6LecPace: 3) ok 11 6LecPace: 4) too fast 2 6LecPace: 5) way too fast ---- q> didn't understand any... ---- q> I am very confused about the analyzing performance of functions. q> I think it was presented badly because you seemed to jump right q> into giving lines c*j and c*j^2 etc. And I have no clue what these q> terms represent. I completely understand similar ideas presented in q> last Thursday's lecture. I think you should go over this again, first q> starting with an easier example, I think starting with a triple nested q> for loop was too confusing of an example to start with. The rest of q> the lecture was great. i might briefly go over this again after break. ---- q> use more applicable examples ---- q> We should spend time reviewing for prelims in class instead of going q> over new material. Perhaps we could do the practice problems in class. i hope the tracing example in the 3/15 lecture was helpful. ---- q> It would help if we could go over some of the practice prelim problems q> in class rather than cover new material. ---- q> 2D array information was very rushed. ---- q> rushed a little at the end, but that information had already been q> covered, just not with 2dimensional matrices yes, that's the key thing: matlab's behavior on 2D matrices is simply an extension of its behavior on 1D matrices -- it follows the same basic principles. ---- q> This examples are confusing and very abstract. ---- q> lecture using the board rather than using the projection monitor... ---- q> when u introduce new concepts, can you slow down a bit? yeah, sorry about that, i get excited and rush. please try to help all of us out by asking questions or asking me to slow down and pause to let things sink in. ---- q> Presenting the lecture using Matlab demo made it so much more q> effective, I thought I grasped the concept quicker this way. q> PS: Since there is no feedback form for T2 review session, I just q> want to say that the review session was great! I thought it was really q> time well-spent. THANKS!!!! ---- q> Went through the 2-D arrays too quickly. ---- q> The explanation of the matrix indexing was good, and easy to q> understand. ---- q> matrices are pretty easy to understand for math majors. ---- q> I still am very confused about big-oh notation completely, and asked q> a few people who took the course in the fall what they knew about q> it, and they said they never heard of it... the content of the course varies from semester to semester and instructor to instructor. i think prof. teitelbaum often covers it, but at the very end of the course. i thought it made sense to cover it now because its gives us a way to talk about performance, which is an important consideration in programming. also, it allows us to more concisely say "do not use unbounded vectors": this can be summed up as "use O(1) space". q> Also, I don't think that q> the extent of 2d arrays that was gone over is enough to do E11, but q> maybe that's just my opinion. Other than that, the intro to 2d arrays q> was pretty good. ---- q> Not quite sure I understand especially on the exercise. The first q> parts ar ok, but filling in the circle is tough. that's why i suggested that people who are pressed for time might want to skip the circle part. ---- q> Lectures are much better and my understanding of the material is much q> clearer now that you use Matlab while you lecture. ---- q> great lecture ---- q> I really found it useful that you used Matlab instead of writing q> on paper. ---- q> I thought this lecture was good. It stated clearly what needed to be q> done to do some of the stuff. ---- q> The lecture was OK, but I'm unhappy that an exercise was assigned q> Tuesday and due Thursday when we have a prelim on Thursday. We have q> other classes besides CS 100M!!! OK, so exercises don't count for q> much, but still, most of us feel obligated to do them, and so we q> spend time doing the exercise when we could be doing work for other q> classes or studying for the prelim! exercises are graded more on effort than correctness. the primary intent is to get you to started thinking on the issues involved. ---- q> This seemed rather straightforward, so far. The exercise would have q> been difficult without the hints, but I feel like I have a pretty q> good grip on 2-D arrays so far. ---- q> The matrix part of the lecture was rushed! ---- q> do more examples on the computer ---- q> very good lecture, well explained ---- q> I still believe that performance analysis is not very useful. The q> explanation of matrices was good and this topic was interesting and q> useful(finally).