NoteBook

CS61B Data Structure UC Berkeley. Spring 2018. @source Josh Hug 01/10/2019-

Javascript: Understanding The Weird Parts Udemy

CS61B Data Structure

• Lecture 1 Intro, Hello World Java

• Lecture 2 Define and Using Classes

• Lecture 3 References, Recursion, and Lists

• Lecture 4 SLLists, Nested Classes, Sentinel Nodes

• Lecture 5 DLLists, Arrays

• Lecture 6 Lecture 6 ALists, Resizing, vs. SLists + proj1a

• Lecture 7 Testing + lab3 + disc03 + Exam Prep 03: Linked Lists, Arrays

• Lecture 8 Inheritance, Implements + Project 1B: Testing and HoFs

• Lecture 9 Extends, Casting, Higher Order Functions

• Lecture 31 Dynamic Programming Course

• Lecture 32 Basic Sorting Algorithms

• Lecture 33 Quick Sort

• Lecture 34 More Quick Sort, Stability, Shuffling

• Lecture 35 Sorting and Algorithmic Bounds

• Lecture 36 Radix Sorts

• Lecture 37 Overview, Tries

• Lecture 38 Compression

  • todo:
    • figure out why SuperZip is impossible.

• Lab9 Tree Maps vs. Hash Maps

  • todo: optimize remove

• Lab10 Heap Min PQ

  • todo:
    • get the fullscore from Gradescope
    • sink: figure out a clear and simple implementation

• Lab11 Graphs

  • todo:
    • optimize A* algorithm

• Lab12 Merge Sort and Quick Sort

• Disc10 Heaps, Traversals & Trees

• Disc11 Graphs

• Disc12 Graphs, Sorting

• Exam Prep 10 Heaps and Graphs

• Exam Prep 11 Graphs

• Exam Prep 12 MST/SP

  • todo:
    • figure out the concept of the Q3

• HW3 Hashing

  • figure out: testWithDeadlyParams problem

• HW4 Puzzle

• Midterm 2

NOT FINISIH:

• Lecture 39 Reductions, Algorithmic Bounds, NP Completeness

• Lecture 40 Summary, Fun

• Proj2

• Proj3: BearMaps

• HW 5: Seam Carving

• Disc13 More Sorting

• Exam Prep Sorting

• Lab12 Radix Sorts

• Lab13 Fractal Sound

• Makeup Lab: HugLife

• Makeup HW 6 boggle

• Makeup HW 7 Compression

Project

• BOT Design Note

Javascript: Understanding The Weird Parts