Note: As per CS61B's Academic Dishonesty guidelines, my solution code will not be made public. If applicable, please contact me through the details I have provided to view my solutions for verification purposes.
CS 61B covers fundamental dynamic data structures, including linear lists, queues, trees, graphs and other linked structures; arrays strings, and hash tables. It also includes storage management, abstract data types and the elementary principles of software engineering. Additionally, algorithms for sorting and searching are covered. Java, the programming language, is taught during the first phase of the course. Additional information on CS 61B's curriculum can be found here.
The HW, Labs & Projects for each week are graded using an autograder on Gradescope. The autograder runs unit tests that check the correctness of the code. Do note that the Total Points score is equivalent to the Autograder Score but is unavailable for the public version of the course. The scores are categorised by the week that they were issued.
For some weeks, the HWs/Labs/Projects were not issued/not available to be graded by the autograder. As such, some weeks do not have any gradescope results.
View Week 1 Scores
View Week 2 Scores
View Week 3 Scores
View Week 4 Scores
View Week 5 Scores
View Week 6 Scores
View Week 7 Scores
View Week 8 Scores
View Week 12 Scores (Final Week for assigned HWs, Labs & Projects.)
-
Install IntelliJ IDEA.
-
Create an account on Gradescope using the Course Entry Code "MB7ZPY" & the School as "UC Berkeley".