Learn · CS 61B - Fall 2007

Lecture 33 of 422007-11-1443 min

Pseudo Random Numbers (cont)

Paul Hilfinger · University of California, Berkeley

At Internet Archive

Credits and licence

From
CS 61B - Fall 2007, University of California, Berkeley (at Internet Archive)
Licence
Internet Archive states no licence for it.
Attribution
2006 Regents of the University of California
Who can watch
Teens profiles and older. How courses are placed

All the lectures

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