Jenway / CS61B

Record my CS61B Spring 2018🎥

My? CS61B

Solutions for CS 61B Data Structures, Spring 2018

Note: This repository is for personal use only. Please do not copy any code from this repository for your own assignments.

I finally give up that delusion of being perfect. I'm not. Actually I'm bad and I tend to lie to myself. 'I'm just a student who is trying to be better.' Really? pretend to be may better describe ... I'm not a genius, I'm not a prodigy, I'm not a perfect student

HW

• HW 1 : Java Syntax and Sound Synthesis

  ASAG: The rumors are true.

• HW 2 : Percolation

  I AM ERROR

• HW 3 : Hashing

  On the other hand, you have different fingers.

• HW 4: Puzzle Solver

  ASAG: I like your outfit today!

• HW 5: Seam Carving

  ¯\_(ツ)_/¯ ASAG: Not a substitute for human interaction.

• Makeup HW 6 : Boggle

  ¯\_(ツ)_/¯ ASAG: I graded your code with MACHINE LEARNING, aka I gave it my best guess.

• Makeup HW 7 : Huffman Coding

  ¯\_(ツ)_/¯ CONFLICT (content): Merge conflict in LITERALLY EVERYTHING. Automatic merge failed; fix conflicts and then commit the result

Lab

• Lab 1 : Welcome to Java

• Lab 2 : Unit Testing with JUnit and IntLists

  ASAG: Scratch here to reveal prize.

• Lab 3 : Testing, Debugging

  ASAG: Post this on Overheard at UC Berkeley for good luck!

• Lab 4 : Project 1A Peer Review

  ASAG: Losing is fun!

• Lab 9 : Tree Maps vs. Hash Maps

  ASAG: A Quiet Voice Of Reason In A Noisy World

• Lab 10 : Priority Queues and Heaps

  ASAG: Collect all fifty billion!

• Lab 11 : Graphs

  On the other hand, you have different fingers.

• Lab 12 : Merge and Quick Sorts

  The autograder tests your code, but who tests the autograder?

• Lab 13 : Radix Sorts

  ASAG: Now with microtransactions!

• Lab 14 : Fractal Sound

  It is pitch black. You are likely to be eaten by a grue.

• Makeup Lab 15 : HugLife

  ¯\_(ツ)_/¯ The autograder failed to execute correctly. Contact your course staff for help in debugging this issue. Make sure to include a link to this page so that they can help you most effectively.

Project

• Project 0 : NBody

  Difficult. Very difficult. Plenty of courage, I see. Not a bad mind either. There's talent, A my goodness, yes -- and a nice thirst to prove yourself, now that's interesting.... So where shall I put you?

• Project 1A : Data Structures

  Warning: Not suitable for children under the age of 4.

• Project 1B : Applying and Testing Data Structures

  ASAG: Unfiltered. Uncensored.

• Project 1 Gold : Randomized Testing

  ASAG: Optimized for Retina displays!

• Project 2 : Lab Demo Score and Partner Form

  ASAG: Now with stories!

• Project 2 : Phase 1

  ¯\_(ツ)_/¯ IT'S DANGEROUS TO GO ALONE! TAKE THIS.

• Project 2 : Phase 2

  ¯\_(ツ)_/¯ The 'S' stands for SUBDERMATOGLYPHIC.

• Project 2 : Gold Points

  ¯\_(ツ)_/¯ Please make sure that your video doesn't show any of your code

• Project 3 : BearMaps Part I

  ASAG: Made you look!

• Project 3 : BearMaps Part II & III

  We apologize for the strange autograder messages. Those responsible have been sacked.

• Project 3 : BearMaps Gold

  ¯\_(ツ)_/¯ I gave it up

• Extra Credit 1 : Algorithm Design

  April Fools!

  These problems are known NP-Complete problems, which means they're (probably) not solvable in the runtimes we gave to you, or any polynomial runtime. Solving them in any polynomial runtime is equivalent to proving that P = NP, a famous unsolved problem in computer science.

  Please don't work on them too hard. For your reference, if you do manage to solve one of these problems in an acceptable runtime, you can win $1 million dollars from the Millenium Problems challenge.