Course40 lectures31 h 2 min
Computer Science 61B - Fall 2008
Paul HILFINGER · University of California, Berkeley
About
COMPSCI 61B LEC 001 Fa08
DATA STRUCTURES
Lectures
- Lecture 2
- Lecture 4
- Lecture 5
- Lecture 6
- Lecture 7
- Lecture 8
- Lecture 9
- Lecture 10
- Lecture 11
- Lecture 12
- Lecture 13
- Lecture 14
- Lecture 15
- Lecture 16
- Lecture 16: Continuation of Lecture 15
- Lecture 18
- Lecture 19
- Lecture 20
- Lecture 21
- Lecture 23
- Lecture 24
- Lecture 25: Generic Programming
- Lecture 26
- Lecture 27
- Lecture 28: Sorting
- Lecture 29: Sorting, contd.
- Lecture 30: Balanced Search Structures
- Lecture 31: Balanced Search Structures, contd.
- Lecture 32: Pseudo-Random Sequences
- Lecture 33
- Lecture 34
- Lecture 35: Enumeration Types, Threads and Concurrency
- Lecture 36
- Lecture 37
- Lecture 38
- Lecture 39
- Lecture 40
- Lecture 41: Storage Management, contd., reflection
- Lecture 42: Summary, Course Evals
- Lecture 17: Collections overview
Credits and licence
- Institution
- University of California, Berkeley
- Teacher
- Paul HILFINGER
- Year
- 2008
- Level
- Undergraduate
- Language
- English
- Subjects
- Computer science, Engineering
- Source
- Internet Archive
- Licence
- CC BY-NC-ND 3.0, as Internet Archive states it. Non-commercial use only, and no changed versions. Internet Archive's terms
- Who can watch
- Internet Archive gives no rating. Invisible Network shows it to Tweens profiles and older, judged from what the source says about it. How courses are placed