7. Algorithmic Complexity (LA Review - Sp15)

[lmock]

Your Name:

Overview of Lab Comments: i.e. Was this lab good or bad? Too fast? Too Slow? Does it need something new?

--- For each specific Issue (Copy this section as many times as necessary) ---
- [ ] Page Link:
      Type of Issue: i.e. (code) bug, grammar, typo, lack of clarity, etc
      Severity: i.e. "prevents students from continuing", "minor inconvenience", etc
      Comments: Description of the problem, what can be done to fix it, etc.
- [ ] Page Link:
      Type of Issue: i.e. (code) bug, grammar, typo, lack of clarity, etc
      Severity: i.e. "prevents students from continuing", "minor inconvenience", etc
      Comments: Description of the problem, what can be done to fix it, etc.

[tcabs17]

Tori Cabot

I like the clarity of the lab as an introduction to run time. There is a lot of text but not a lot to break it up. I thought the self tests were good and to help with the amount of text we could add a couple more quizzes. I also liked the additional links to "earlier in the lab" and "two labs ago". It makes it easier for students to return to concepts that they might be shaky on. I did feel like the lab gives a lot away. Students could potentially just click through the lab without doing any thinking. The first three slides are also a little disjointed and lack transitions.

• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/constant-time.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html       Type of Issue: lack of clarity       Severity: minor inconvenience       Comments: The addition example on the constant-time page could get a little confusing. I'm not sure that is the best example to provide clarity. I think the rest of description is enough on its own.
• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/projects/hangman/evil-hangman.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html       Type of Issue: unclear purpose       Severity: aesthetically confusing       Comments: Why is there a big section of the page that says, "Yeah, we don't have that image right there."?

[amy97]

Your Name: Amy Vatcha

Overview of Lab Comments:

• Linking the number guessing game to the same concept in a previous lab is very useful
• Too much reading that isn't supplemented with enough diagrams/code
• The difference between the Gauss and non-Gauss method was well explained
• The evil hangman homework was conceptually adequately explained in the lab but there was not enough programming practice leading up to it
• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/projects/hangman/evil-hangman.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html       Type of Issue: Image missing under Tips & Thoughts       Severity: Minor Inconvenience       Comments: An image saying "Yeah, we don't have that image right here" is on the page under the subheading Tips & Thoughts

[mikomwang]

Your Name: Michael Wang

Overview of Lab Comments: Though this lab was pretty clear in explaining run-time, I think including more examples of coding questions would prepare them more for test-related questions. For example, run-time on testing were mainly concerned with nested for loops, so it might be good to give them an introduction to that here. Also, there is a lot of reading, which I think could definitely use some balancing with images.

• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/linear-time.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html       Type of Issue: Possible confusion       Severity: Can improve clarity       Comments: I remember that run-time was a confusing concept for me when I first came across it and it was only clarified during discussion/lecture. Though the lab explains many of these concepts well, it might be better It would possibly help to incorporate some basic graphs showing correlations between code and their run-time (ie. linear would be an increasing line, as stated. Constant would be a flat line. Exponential would be a steep increasing line, etc.). Adding images would also make the run-time explanation pages more immersive!
• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/a-distinct-difference.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html       Type of Issue:Minor       Severity: Strange image       Comments: The image is a little hard to see since it's stretched wide and thin...
• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/projects/hangman/evil-hangman.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html       Type of Issue: Image error       Severity: Broken image link or source       Comments: "Yeah, we don't have that image right here" takes up almost an entire quarter of a page.

[mfujimoto]

Your Name: Mason Fujimoto

Overview of Lab Comments: I like this lab as it allows students to take a break from just solving problems to understand the processes they create in their solutions. I feel like these concepts are very important for understanding environments in later cs classes. I like how this lab also hints at how to make a slow program faster which may be necessary for some student's projects. My only complaint is that the evil hangman homework prompt is part of the lab when I feel it is unrelated.

--- For each specific Issue (Copy this section as many times as necessary) ---

• [ ] Page Link:http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/projects/hangman/evil-hangman.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html       Type of Issue: clarity       Severity: i.e. moderate       Comments: i think students would be surprised to see a homework prompt as the last page of the lab. Perhaps this page is better included in another url as it would separate the lab and the homework. I think this would make more sense as the evil hangman game is not related to algorithm complexity.
• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/projects/hangman/evil-hangman.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html       Type of Issue: missing image       Severity: minor       Comments: There is a missing image (or maybe there isn't supposed to be an image) above the tips and trick section for the last page

[jesslarson]

Your Name: Jessica Larson

Overview of Lab Comments: I like this lab, I agree that the random homework page at the end was kinda weird.

--- For each specific Issue (Copy this section as many times as necessary) ---

• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/do-you-have-time-to-add.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html       Type of Issue: clarity       Severity: inconvenience       Comments: This slide really confused me last semester because I thought I wasn't reading it right, and that I was supposed to be doing something more than just adding 1 +10000. It might benefit from more information on the page, or directly writing (1+10000) so its clear that it shouldn't take any time.
• [ ] Page Link:http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/timing-sum-things-up.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html       Type of Issue: bug       Severity: inconvenience       Comments: The add all the numbers block doesn't have an input for the list as shown on the lab page. It is also made as a command block in the file, but shown as a reporter on the lab page.

[lizapraprotnik]

Liza Praprotnik

I think that this lab provides a great introduction to runtime. At the end of the lab, I would add a graph or chart comparing the runtimes discussed in the lab. I'd also add a few more examples of code for each runtime.

Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/projects/hangman/evil-hangman.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html Type of Issue: image not showing Severity: minor Under the Tips and Thoughts section, the image is replaced by "Yeah, we don't have that image right there."

[yifatamir]

Yifat Amir

Overview of Lab Comments: I think that this lab is really interesting and eye-opening! It definitely demonstrates the creativity involved in problem-solving. Also the intro activities definitely make the content more approachable and concrete. The content is good, but it could use some more images since right now it's pretty plain. Symbolic images of run time could be very cool!

• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/time-is-of-the-es-sense.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&course=cs10_sp15.html&novideo&noreading&noassignment       Type of Issue: lack of clarity       Severity: might cause distraction       Comments: The sentence at the top that says that snap allows us to do the converse [of waiting for a function to return] doesn't make much sense to me. I don't think these ideas would be converses, and so the use of that word in this context may confuse people. On another note, on the same page but at the very bottom, I think the last sentence should be reworded to clarify that they need to save THIS script as a BLOCK called "timing framework". Otherwise they may think to save it as an xml file or something.
• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/constant-time.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&course=cs10_sp15.html&novideo&noreading&noassignment       Type of Issue: lack of visuals       Severity: minor       Comments: This page (and the one before it) has a lot of text on it. I would add an image that shows a constant time function called on a small input and on a larger input and states that they take the same amount of time approximately to run since it's a constant time function.

[rwason]

[lmock]

@rwason can you not upload images of your comments? we can't click on the links or mark them as completed when we go through all your comments if they're stuck as images. thanks!

[juliaalcaraz]

Your Name: Julia Alcaraz

Overview of Lab Comments: I like this lab because its different from all other labs. Instead of teaching the students about ways of coding it teaches them other important concepts. The reading for the lab is kind of a lot though, and I agree that it could use more pictures so that the students will be discouraged to skip through the content.

• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/a-non-video-game.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html       Type of Issue: typo       Severity: minor       Comments: On the second line the sentence says "decide who will be the guesser and the the picker."
• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/all-the-numbers-all-the-time.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html       Type of Issue: lack of clarity       Severity: i.e. minor inconvenience       Comments: In this page I was initially confused about whether the block mentioned was already filled in or if the students would have to fill it in but after rereading it, it was clear.

[eurieoh]

Your Name: Eurie Oh

Overview of Lab Comments: I think that this lab was a great way to introduce run-time. But I do agree with the others that maybe adding more visuals would help with reading the entire lab.

• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/do-you-have-time-to-add.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&course=cs10_sp15.html&novideo&noreading&noassignment Type of Issue: Lack of Clarity Severity: Minor Comments: When it says "add 1 to 100000" I remember me and a few of my fellow classmates getting kind of confused, thinking that we had to add 1 through 10000 with a "for" block. Maybe it would be a good idea to change that phrase to " do 1 + 10000".

[carolinekim]

Your Name: Caroline Kim

Overview of Lab Comments: The topic of algorithmic complexity is not the easiest concepts to grasp. The lab however gives the students a detailed explanation (with examples) and the chances to try out different codes to identify the specific runtime of certain blocks. Even though more explanations of some of the runtimes could be added, the lab is successful in teaching the students the basic concepts of algorithmic complexity.

--- For each specific Issue (Copy this section as many times as necessary) ---

• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/do-you-have-time-to-add.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html       Type of Issue: Lack of clarity       Severity: Minor inconvenience       Comments: When I first read this page, I thought it was instructing the students to add all the numbers from 1 to 100000 (as the previous page explains with the Gauss method). I think that a lot of students may get confused, and end up trying to all the numbers from 1 to N. It would be clearer to simply state to add 1 and N.
• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/quadratic-time.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html       Type of Issue: Lack of clarity       Severity: Minor inconvenience       Comments: For the explanation of the Constant runtime, I feel like the explanations were way easier to understand and relate to. It seems like the other runtimes (like quadratic and logarithmic runtimes) are a little rushed at the end with not enough examples. It would be helpful if some additional pages were added for a more detailed explanation of the concepts, or in-depth explanation in discussion sections would be helpful as well.

[sayabe]

Your Name: Satoko Ayabe

Overview of Lab Comments: I thought that the lab was really helpful for teaching algorithmic complexity to students (it can get really complicated). However, I think adding images/GIFs could help students understand better (just a suggestion). Also, I think that students won't be able to understand algorithmic complexity perfectly just by going through this lab once. I think it could be emphasized that this topic is complicated, and it's ok/ it is encouraged to ask your TAs a lot of questions during the following discussion section.

[ArielleSpencer]

Name: Arielle Spencer

Overview: Lots of big concepts but explained well and very thoroughly. The exercises are on the hard side but definitely do-able. Perhaps more specific examples or visuals would help a bit. I thought the lab was overall pretty good.

The only problem I found (the Adding 1 to 1000) has been already addressed above so I don't have any specific problems!

[Omarb62]

Your Name: Omar Buenrostro

Overview of Lab Comments: Overall, I feel this lab serves as a good introduction to algorithm complexity. A majority of this lab was just reading which made the lab shorter in general, but the lack of problems may allow the information to just fly over a person's head. As a result, this lab felt like it was lacking interaction. Adding one or two more check-up questions somewhere in the lab might help the student become more engaged.

[knmcgauley]

Your Name: Katherine McGauley

Overview of Lab Comments: I found the page I left links for below a bit confusing (I think some simple changes could be made to update it and make it more clear), but overall, I thought this was a well-paced introduction to algorithmic complexity analysis. There are several pages of blocks of text, which I think could be brightened up with some pictures or quiz questions, but overall, I think the examples were helpful and well explained.

• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/timing-sum-things-up.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&course=cs10_sp15.html&novideo&noreading&noassignment       Type of Issue: Hyperlink leads to a page slightly different from the lab       Severity: i.e. Likely to cause a bit of confusion       Comments: The "earlier in the lab" hyperlink leads to a page concerning a reporter block that gives a list of consecutive numbers. While related, this was not part of the lab, which had students implement this code in a command block. I think an easy fix would be to redirect the hyperlink to the page actually used in the lab (this one: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/all-the-numbers-all-the-time.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&course=cs10_sp15.html&novideo&noreading&noassignment).
• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/timing-sum-things-up.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&course=cs10_sp15.html&novideo&noreading&noassignment       Type of Issue: i.e. Screenshot/Given code mismatch       Severity: i.e. Possibly confusing       Comments: The blocks in the Snap! window that opens up for "add all numbers (non-Gauss)" and "add all numbers (Gauss)" do not contain variables (students will have to add a variable slot to input the NUMBERS list), whereas the screenshots of these blocks do. The screenshot also lists them in order (Gauss) then (non-Gauss), while the instructions refer to them in order (non-Gauss), (Gauss). These are mild annoyances, but I think we could easily fix them.

[Hungukaroo]

Elizabeth Steger

Overview: I think this is a great lab for understanding a bit more about the importance of efficient algorithms. It's also a great opportunity to see the consequences of handling large data. I found this lab a little bare on the pages, and although I know there aren't many scripts we need to show them, a break from the text could be more engaging. I do really like how the lab transitions to the homework, as algorithms are vital for Evil (Snow?)Hangman.

Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/do-you-have-time-to-add.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html

Issue: Opportunity to make their lives easier Severity: Extremeley minor Comments: I think that telling them to continuously run the program by clicking on it makes sense because we want them to know not to put it in a repeat block, but I think it would be better to encourage them to link it with a key (when __ key pressed) just to make their lives easier. I suppose they could do it themselves, but they shouldn't think it's the incorrect way to do it, either. Also sometimes repeatedly clicking in snap! gets very frustrating.

Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/quadratic-time.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html

Issue: Explanation could be better? Severity: Minor Comments: I think the best way to understand different run times is to visualize them with graphs. I think the textual descriptions are well done, but a nice big graph comparing the run-times and proving how quickly quadratic shoots up compared to constant would be great.

[thomaslee4]

Your Name: Thomas Lee

Overview of Lab Comments: I think that is lab has a lot of room for improvement. From a content perspective, I think the lab should spend more time conveying the idea that runtime isn't based off of a stopwatch, but rather the number of steps a computer has to take in executing code. Most of the lab focused on students attempting to use Snap! to time runtime, when I think that students should be more focused on the number of steps that are run through in order to execute code. In terms of style, I thought that the lab was extremely text-heavy and could use some more interactive examples. Perhaps animations would be a good addition to help explain some of the runtime concepts, rather than just reading though several paragraph

• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/do-you-have-time-to-add.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html Type of Issue: Lack of Clarity Severity: Medium inconvenience Comments: The instructions on this page are very vague and ambiguous. I wasn't sure if the directions were to add 1 to a number until that number became 100000 or if the directions were to add 1 and 100000.

[Meghna15]

Your Name:Meghna Dasgupta

Overview of Lab Comments: The lab this week was fairly paced however it was a little text-heavy. I think some of the slides (defining the different runtimes) should use tables or bullet points to make it clearer. Also it may be useful to define runtime in the beginning of the lab as the number of steps the computer takes while performing a certain function. Another suggestion I had was that we can include a table with the different runtimes, examples of each etc. at the end of the lab to make it more concise.

• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/constant-time.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html       Type of Issue: Lack of Clarity       Severity: Minor       Comments: This page is very text-heavy so students may not pay too much attention to the content even though it is important. One possible solution could be putting bullet points to make it more visually appealing and easier to understand.
• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/projects/hangman/evil-hangman.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html       Type of Issue: Wrong Name       Severity: Minor       Comments: I believe this year's project was called 'Snowman' instead of 'Hangman' but this page refers to the old project as Hangman instead of Snowman.

[anushasyed]

Name: Anusha Syed

Overview: All the concepts are explained thoroughly and backed with some really helpful examples. Perhaps the concepts could be even easier to understand if there were more diagrams and more examples of each type of run time. The timer exercise with the Gauss/Non-Gauss count numbers I think was really helpful in understanding that linear time is less efficient than constant time, however I do agree there should be some type of visual to show that this is because more steps are being executed as the length of the list of numbers gets larger. In addition, to ensure that the students really understand complexity, I think there should be a few more quiz questions between the exercises.

[michen-ml]

Michelle Chen

Overview: The lab is pretty clear on the concept of run-time. It's a little text-heavy, and I think some of the concepts could be more direct instead of using a bunch of examples until finally getting to the point of run-time. I think in the future, some example problems such as "determine the run-time of this block" could be helpful for students to use the content learned in the lab in a practical setting. Otherwise, it's a well-placed lab and pretty easy to understand

• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/projects/hangman/evil-hangman.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic       Type of Issue: organization       Severity: minor       Comments: Little odd to suddenly introduce homework at the end of the lab, considering it's not that related to the contents of the lab. Maybe put this on piazza instead or mention it in lab with a link to the homework description?

[william0cheung]

William Cheung

Overview: This lab was effective in giving good examples of runtime. I like the quiz on the eighth page to check to see if the student is paying attention. Maybe implement a few more during the lengthy and wordy pages as well. Also this lab requires lots of reading and not much coding. Algorithmic complexity is an important concept but students at this time may not know why it is being introduced. Especially when introducing the Evil Hangman homework, this lab doesn't really lead up to it. All in all, this is a pretty well-organized and should be easy to follow.

Specific Issues: Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/constant-time.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html Type: wordy Severity: aesthetics Comments: Lots of text, maybe screenshots would make this page look better.

[Justin-Kim72]

Justin Kim

Overview of the Lab comments: The concept of runtime can be difficult to understand and even thought reading through this lab is really long, I feel like it is necessary in order to understand runtime better. I would of liked it if there was a lot of realistic situation questions. Also, it would be nice if there was also SNAP! code runtime questions, because that's what the midterms are going to test you on, so introducing the students to both realistic and SNAP! code runtime would be beneficial. It was a good lab.

[nzoghb]

Your Name: Nicolas Zoghb

Overview of Lab Comments: a not-so-challenging lab in terms of coding, it allows the student to take a break to just understand the concept being provided. Some pages were, however, a little on the dry side with too much text clogging up parts of the screen.

• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/logarithmic-time.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html       Type of Issue: not enough examples       Severity: minor       Comments: coming to the end of the lab, some students found that runtime was an odd concept and wanted more examples to be able to understand it more. Quadratic- and Logarithmic-Time especially seemed to get no love from the students. A visual tool like a graph would be handy!
• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/quadratic-time.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html Type of Issue: too much text       Severity: jarring       Comments: text on this page and the next is too heavy and intimidating for students. Can be cut down into several other pages or diluted with images.

[morganewing]

Your Name: Morgan Ewing

Overview of Lab Comments: Overall, I think this lab is pretty conceptually challenging but a good introduction to algorithm runtimes. I think it’s helpful that the students are told to guess how long an algorithm will take or try it out for themselves before they are told what the runtime is. The only thing I would add to this lab is something at the end which provides and overview of all of the runtimes presented with tables like the quadratic runtime table.

• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/projects/hangman/evil-hangman.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html

Type of Issue: Incorrect image

Severity: minor inconvenience

Comments: Shows an image which says "Yeah, we don't have that image." so there is something else that is probably supposed to go there.

[janicechui]

Janice Chui

Concepts are easy to follow, but there could be more clarification in terms of the differences between each kind of running time.

presented with tables like the quadratic runtime table.

Page Link:http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/constant-time.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html

Type of Issue: a little wordy

Severity: minor

Comments: Too much text for explaining the easiest type of running time. I feel like the proportion of explanation can focus more on the harder types like logarithmic and quadratic.

[18epedersen]

Your Name: Emily Pedersen

Overview of Lab Comments: This lab clearly demonstrates the difference between run-times. I like the example of gauss vs. non-gauss because I think it shows the different because a constant run time and a linear run time really well. However, I think this lab is a lot of explaining, and not enough doing. I lot of the tabs is just reading, and I think that students may just read without completely absorbing the information as if they were to with an applications problem.

[JiazhenChen]

Your Name: Jiazhen Chen

Overview of Lab Comments: I think this one is a pretty good and clear lab. It gives the students a clear demonstration and explanation about different running times. One thing that can be improved is that some important words or sentences could be highlighted (like use another color or larger font?). So that students can find the emphasis immediately. Also, I feel like it would be better if we have a conclusion page that contains and compares all the running time we've mentioned at the end of the lab. A table will be really nice and direct.

--- For each specific Issue (Copy this section as many times as necessary) ---

• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/quiz-searching-through-time.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html       Type of Issue: lack of clarity       Severity: minor inconvenience       Comments: In the question, it mentions "worst-case". Though it's kind of easy for students to understand. I feel it would be better to mention it officially before the question. I think it's better to move the description from page: (http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/a-distinct-difference.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html) to here.

[danielduazo]

Your Name: Daniel Duazo

Overview of Lab Comments: I liked the anecdote with Gauss at the beginning of the lab. The "competition" to see which method is faster (Gauss's or manually adding) is a good introduction to run time

--- For each specific Issue (Copy this section as many times as necessary) ---

• [ ] Page Link: http://inst.eecs.berkeley.edu/~cs10/labs/cur/programming/algorithms/timing/a-distinct-difference.html?topic=berkeley_bjc%2Fareas%2Falgorithm-complexity.topic&novideo&noreading&noassingment&course=cs10_sp15.html       Type of Issue: Lot of information to process       Severity: i.e. "minor inconvenience"       Comments: This page is a big wall of text with a lot of instructions. It would be better if it was formatted like a list with bullet points.

[Rshahatit]

Your Name: Rami Shahatit

Overview of Lab Comments: To this day I still have a hard time understanding run time. but i think this lab does a good job in explaining how there is a difference between the amount of time and run time of a program. I think after this lab they will be ready to determine the run time of programs.

--- For each specific Issue ---

• [ ] Page Link: I think it should be added       Type of Issue: minor       Severity: none       Comments:I think it would be helpful to include a chart of things to look for when attempting to figure out the run time of programs for example i remember when you see two for loops it is most likely quadratic. I think a chart like that would even be helpful to me today in CS61A