CS 61B Lecture 21: Hash Tables
Loading...
Link to this comment:
Top Comments
All Comments (41)
-
imagine if he just scratched his nails down the chalk board.
-
he could get on my nerves. kinda pompous
-
Hot teacher lol
-
7 mod -3 = -2 but 7 % -3 = 1
% is the remainder operator. % is not a modulus operator.
In java the remainder operator is designed to follow the following identity for all integers a and b such that b is not 0 (since n / 0 is undefined for all n):
(a / b) * b + (a % b) == a
So in the example, 7 % -3, we enter in the following numbers:
(7 / -3) * -3 + (7 % -3) = 7
Integer arithmetic discards partial numbers.
(-2) * -3 + (7 % -3) = 7
6 + (7 % -3) = 7
(7 % -3) = 1
-
'pus', 'goo'. LOL
-
@jimmyjubejube One of our professors said that it's forbidden to share data to the outside world, including footage/audio.. bah.
-
If only other lecturers would be like him.
-
Dr. Schewchuk is an excellent lecturer! These videos have helped me so much!
-
he writes so cool lol
-
Great lecture.
39 videos
Computer Science 61B - Fall 2006
1:17:51Computer Science 188 - Lecture 6by UCBerkeley121 views
- 1:16:06Computer Science 164 - Lecture 6by UCBerkeley90 views
- 1:11:56Economics C3 - Lecture 6: Markets and Welfareby UCBerkeley0 views
- 1:21:03Economics 104 - Lecture 6by UCBerkeley41 views
- 50:16Lec 8 | MIT 5.112 Principles of Chemical Scienc...by MIT173,330 views
- 49:21CS 61B Lecture 5: Iteration and Arrays Iby UCBerkeley24,423 views
- 20:31Exam 1, Problem 2 | MIT 3.091SC Introduction to...by MIT5,029 views
- 51:26CS 61B Lecture 4: Types and Conditionalsby UCBerkeley22,505 views
- 46:24Lecture -5 Algorithm Design Techniques : Basicsby nptelhrd37,416 views
- 53:43Lecture - 4 Dictionariesby nptelhrd43,590 views
- 2:23ST364 - Tabelas HASHby Marmelcartiger2,259 views
- 5:29Introduction To Hash Tables Part 1 (beta)by BlueberryTreeTutor3,616 views
- 5:34Binary Search Treesby travelschlepp22,007 views
- 5:10How to use the Java Hashmapby tpjava19,280 views
- 57:48Lecture - 25 Data Structures for Graphsby nptelhrd32,517 views
- 57:02CS 61B Lecture 24: Priority Queuesby UCBerkeley16,657 views
- 43:10CS 61B Lecture 29: Sorting Iby UCBerkeley12,912 views
- 1:01:23Lecture - 5 Hashingby nptelhrd65,750 views
- 48:51CS 61B Lecture 19: Asymptotic Analysisby UCBerkeley19,740 views
- 6:18Java 28 - HashTableby VoidRealms5,455 views
Very helpful and nicelly explained :)
Good work!
MetaBrainX 2 years ago 23
This is awesome, definitely helped me out in my data structures class.
elektrosaurus 2 years ago 16