CS 61B Lecture 39: Augmenting Data Structures
47:04
Added: 3 years ago
From: UCBerkeley
Views: 15,036
Sort by time | Sort by thread (beta)

Link to this comment:

Share to:
see all

All Comments (9)

Sign In or Sign Up now to post a comment!

  • Parsing

    prankmakers95 1 year ago

  • Sir can i have your lectures on the following titles.. Title(1): Greedy& divide and conquer which includes the following.. 1.tree- vertex splitting 2. job sequencing with deadlines 3.optimal storage on tapes 4.convex hull Title(2): Dynamic programming and backtracking which includes the following.. 1.multistage graphs 2.0/1 knapsack using dynamic programming 3. Flow shop scheduling 4. 8 queens problem 5.graph colouring 6.knapsack using backtracking

    rajeshchristopher 1 year ago

  • I'm left handed and do lectures sometimes. His left handed blackboard writing is flawless I swear LOL. Usually people have to wait for me to move to get things in view.

    Entertainmentwf 1 year ago

  • Thanks for the lectures.

    yasuodances 1 year ago

  • very informative

    CISCOSDM 2 years ago 2

  • Since the Instructor Jonathan Shewchuk asked for a specific bit of advise or feedback, I'll ask that this course in the future also include Shell Sort as one of the sorting Algorithms taught instead of stopping at a Radix Sort method. Great Course and I can't get enough lectures upon the CS field of study, thank you once again Berkeley!

    heavensrevenge 2 years ago 7

  • Thank you for the lectures.... its very generous of you guys !

    scarletsmile80 3 years ago 6

  • Is it the last lecture of CS 61B ? Thanks for doing all the uploads.

    lavoisier8 3 years ago 10

View all Comments »
Loading...
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more