mobile wallpaper 1mobile wallpaper 2mobile wallpaper 3
354 words
2 minutes
CS61B
2026-04-10

Notice#

OrbisLumen
/
cs61b
Waiting for api.github.com...
00K
0K
0K
Waiting...

CS61B 2024 Spring

Learning Track#

4.10#

Wasted my whole afternoon and evening setting up the IntelliJ environment…

Finally found that it was neither an IntelliJ version problem nor a JDK version problem…

I only needed to open one project at a time to build the correct debug environment.

->_<-

4.12#

The autograder was annoying and made me change my GitHub repository structure several times.

4.13#

Finished Project 0.

Since it was a FA19 project, some libraries were deprecated, which made it annoying to deal with.

What a pity — I couldn’t see the universe animation…

Er…

Finally decided to switch from the FA19 skeleton to the SP24 skeleton.

The reasons were mentioned above.

4.15#

Lab 3 made me speechless…

Tell me how to rewrite a pile of shit?!

4.19#

Finished Project 1A and got a glimpse of test-driven programming.

4.20#

Finished Project 1B and built a deque with an array list.

I improved my ability to write tests and even found a bug that GPT didn’t notice at first.

4.21#

Finished Project 1C, extended the deque methods, and used deques in practice.

Started the data structures part of CS61B.

4.24#

Finished learning the lectures on asymptotics, disjoint sets, BSTs, B-trees, and red-black trees.

Started the homework and labs to review these ADTs.

Skipped Lab 4, which was about GitHub.

4.26#

Finished HW2, Percolation, and learned the application of Quick Union.

Finished Lab 5, Disjoint Sets, and implemented Weighted Quick Union with Path Compression.

4.28#

Finished Lab 6, BSTMap, and completed the remove method with GPT’s help.

4.30#

Finished Lab 7, LLRB Trees. The base case was difficult to figure out, so I completed it with GPT’s help.

5.9#

Finished lec21, started the graph part.

5.11#

Finished lec22, 23, 24, 25, learned the dijkstra’s algorithm.

5.15#

Finished lec26, 27, 28.

5.16#

Started the last unit with sorting and algorithm.

5.18#

Finished selection, heap, merge, insertion sort.

5.19#

Learned quick sort and the theoretical bounds of compare sort.

5.20#

Reminder: skip the software engineering III and IV, plz watch it after proj 2.

Reminder: skip the last three lec.

Reminder: proj 2, 3 remained uncompleted.

Share

If this article helped you, please share it with others!

CS61B
https://orbislumen.pages.dev/posts/cs-3/post/
Author
Orbis Lumen
Published at
2026-04-10
License
CC BY-NC-SA 4.0

Some information may be outdated

Table of Contents