Aidan Wu Individual Final

[archkitten]

Aidan Wu Individual Final

[Archkitten]

Topic 1 (Binary Math Signed Addition): Pair share journal with CB notes demonstration for binary, good link to Binary Math Signed Addition. The tour of code was also very nice. 2/2

Topic 2 (Binary Math Unsigned Addition): Conditionals and Booleans on college board connects to unsigned addition with multiple rows. Tour of code was clear. 2/2

Topic 3 (Week 8 TPT): Starts off mentioning iteration, although could be a bit more clear to say it came from collegeboard. Excellent understanding on the topic and mention of lazy programming with detailed explanations in your tour of code. Nice work! 1.75/2 (The lower score is not indicative of your actual performance, I just followed the rubric on myconnect. Same as William, excellent demonstration of knowledge on the last example!)

Overall: 5.75/6

[Tyler929]

Big Idea 1 Signed addition (Binary): Good explanation and demonstration of understanding through pair share journal, along with a showcase of code. As a viewer, you helped me understand how these python commands function and the purpose of their existence 2/2
Big Idea 2 Unsigned Addition (Binary): You had a nice connection for the navigation through the code and had a good explanation of why the code needed to be there. Although you displayed the code working correctly, I had a little hard time understanding how the binary combines to output the unsigned addition. Because of this I believe this topic deserve a 1.75/2
Big Idea 3 Lazy programer TPT: I think you did a really nice job showing the iteration and big O notation, which connects the idea of a lazy programer to the code. 2/2

Overall: 5.75/6

[willcyber]

Great job explaining how the binary code worked. You explained very clearly what the purpose of the parsint and fromcharcode is in the code. 2/2 Very clever and effective use of if else statements. You explained how the carry worked in your code and on the website very clearly, demonstarting a clear knowledge of the code. 2/2 Very effective use of iteration that shortens the amount of code written while still achieving the same result. This way, it goes through the l function in the range (0,2,n) without needing to type the same thing over and over again. 2/2 One suggestion I have for you is to implement a nicer looking user interface for the extra credit challenge. Overall, you explained all the code very well. Great job! 6/6

[David-Xie123]

You demonstrated how each big idea was utilized very well. I also like how you demonstrated the Binary Math minilab. The explanation of how if-else statements contribute to a "lazy programmer" is good as well. A point of improvement would be that the code was a little too small and blurry, so you should make them bigger and easier to read. 6/6

[jm1021]

On binary and binary signed addition I like how you shared your notes, runtime, and code. All of these show understanding. On the next topic and addition I like that you shared how to manage carry and the conditionals to support it, this is a difficult topic to explain but with your conditions and assignment you represented it well. Iteration example was a little less clear for me as you spoke about "l" a couple of times and I missed the setup for what it is? This could be my attention, but a little setup on this wold have been helpful. 5.75/6

[mahimak19]

I like how you went in-depth on the binary lab and explained how each feature worked like the ASCII, addition, and the bulb change. You used conditionals and iteration well by walking us through each part. Maybe in the future, you can talk about multiple features in your website as opposed to just binary.

5.75/6