Learn · Internet Archive

Course42 lectures31 h 7 min

CS 61B - Fall 2007

Paul Hilfinger · University of California, Berkeley

Start with lecture 1 At Internet Archive

About

CS 61B: Data Structures - Fall 2007. Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

Data Structures (three day delay)

Lectures

  1. Course Introduction 2007-08-27 · 47 min · Audio
  2. Developing a Simple Program 2007-08-29 · 48 min · Audio
  3. Mechanics of Objects 2007-08-31 · 50 min · Audio
  4. Single Pointer Manipulation 2007-09-05 · 50 min · Audio
  5. Arrays and Objects (audio is distorted) 2007-09-07 · 42 min · Audio
  6. Growing an Array 2007-09-10 · 45 min · Audio
  7. Java Library List Classes 2007-09-12 · 43 min · Audio
  8. Object-Oriented Mechanisms (lecture is from Spring 2006) 2007-09-14 · 49 min · Audio
  9. Interfaces and Abstract Classes (noisy audio) 2007-09-17 · 48 min · Audio
  10. A Puzzle (technical error - lecture only 27 minutes) 2007-09-19 · 28 min · Audio
  11. Comparable and Reader 2007-09-21 · 46 min · Audio
  12. Various Odds and Ends in Support of Abstracton 2007-09-24 · 48 min · Audio
  13. Modluarization Facilities in Java 2007-09-26 · 47 min · Audio
  14. Access Control Static Only 2007-09-28 · 50 min · Audio
  15. Integers 2007-10-01 · 47 min · Audio
  16. Bit Twiddling - Cost Measures 2007-10-03 · 46 min · Audio
  17. Asymptetic Cost 2007-10-05 · 41 min · Audio
  18. Merge Sort 2007-10-08 · 40 min · Audio
  19. Views - Maps 2007-10-10 · 46 min · Audio
  20. Implementing with Arrays 2007-10-12 · 47 min · Audio
  21. Arrays - Continued 2007-10-15 · 44 min · Audio
  22. Introduction to Trees 2007-10-17 · 44 min · Audio
  23. Tree Representation and Searching 2007-10-19 · 48 min · Audio
  24. Java Support for Generic Programming 2007-10-22 · 41 min · Audio
  25. Prority Queues, Range Queries, Java Utilities 2007-10-24 · 44 min · Audio
  26. Hashing 2007-10-26 · 44 min · Audio
  27. Hashing - Continued 2007-10-29 · 42 min · Audio
  28. Classifications and Sorting 2007-10-31 · 43 min · Audio
  29. Sorting - continued 2007-11-02 · 40 min · Audio
  30. Balanced Search Structures 2007-11-05 · 42 min · Audio
  31. Balanced Search Structures (con't) 2007-11-07 · 37 min · Audio
  32. Pseudo Random Numbers 2007-11-09 · 49 min · Audio
  33. Pseudo Random Numbers (cont) 2007-11-14 · 43 min · Audio
  34. Game Trees, Minimax 2007-11-19 · 48 min · Audio
  35. Threads and Concurrency 2007-11-21 · 49 min · Audio
  36. Graphs, Instroduction 2007-11-26 · 48 min · Audio
  37. Minimal spanning trees, Union-find 2007-11-28 · 26 min · Audio
  38. Dynamic Programming 2007-11-30 · 47 min · Audio
  39. Storage Management 2007-12-03 · 47 min · Audio
  40. Project Overview 2007-12-05 · 49 min · Audio
  41. Storage Management - Project 2007-12-07 · 55 min · Audio
  42. Semester Review 2007-12-10 · 50 min · Audio

Credits and licence

Institution
University of California, Berkeley
Teacher
Paul Hilfinger
Year
2007
Level
Undergraduate
Language
English
Source
Internet Archive
Licence
Internet Archive states no licence for it. Internet Archive's terms
Attribution
2006 Regents of the University of California
Who can watch
Internet Archive gives no rating. Invisible Network shows it to Teens profiles and older, judged from what the source says about it. How courses are placed