CS 225 honors — Spring 2024

Show Details

Lectures from the Spring 2024 honors section of CS 225 (Data Structures).

…Read more Less…

Σ. HashLife 1 of 12

duration 55 minutes 20 seconds

Σ. HashLife

Σ. HashLife

Σ. HashLife

Σ. HashLife

From Jeff Erickson

35 plays 0
11. Sweep-line algorithms 2 of 12

duration 55 minutes 17 seconds

11. Sweep-line algorithms

11. Sweep-line algorithms

11. Sweep-line algorithms

11. Sweep-line algorithms

From Jeff Erickson

13 plays 0
10. Range trees and segment trees 3 of 12

duration 57 minutes 39 seconds

10. Range trees and segment trees

10. Range trees and segment trees

10. Range trees and segment trees

10. Range trees and segment trees

From Jeff Erickson

28 plays 0
9. Range-minimum queries and LCA queries 4 of 12

duration 53 minutes 59 seconds

9. Range-minimum queries and LCA queries

9. Range-minimum queries and LCA queries

9. Range-minimum queries and LCA queries

9. Range-minimum queries and LCA queries

From Jeff Erickson

30 plays 0
8. Fibonacci heaps and pairing heaps 5 of 12

duration 53 minutes 4 seconds

8. Fibonacci heaps and pairing heaps

8. Fibonacci heaps and pairing heaps

8. Fibonacci heaps and pairing heaps

8. Fibonacci heaps and pairing heaps

From Jeff Erickson

19 plays 0
7. Mergeable (leftist and binomial) heaps 6 of 12

duration 51 minutes 25 seconds

7. Mergeable (leftist and binomial) heaps

7. Mergeable (leftist and binomial) heaps

7. Mergeable (leftist and binomial) heaps

7. Mergeable (leftist and binomial) heaps

From Jeff Erickson

20 plays 0
6. Splay trees and ropes 7 of 12

duration 53 minutes 9 seconds

6. Splay trees and ropes

6. Splay trees and ropes

6. Splay trees and ropes

6. Splay trees and ropes

From Jeff Erickson

32 plays 0
5. Scapegoat trees, augmented BSTs 8 of 12

duration 52 minutes 54 seconds

5. Scapegoat trees, augmented BSTs

5. Scapegoat trees, augmented BSTs

5. Scapegoat trees, augmented BSTs

5. Scapegoat trees, augmented BSTs

From Jeff Erickson

17 plays 0
4. Binary search trees, scapegoat trees 9 of 12

duration 53 minutes 40 seconds

4. Binary search trees, scapegoat trees

4. Binary search trees, scapegoat trees

4. Binary search trees, scapegoat trees

4. Binary search trees, scapegoat trees

From Jeff Erickson

27 plays 0
3. Concatenation and tombstones 10 of 12

duration 51 minutes 19 seconds

3. Concatenation and tombstones

3. Concatenation and tombstones

3. Concatenation and tombstones

3. Concatenation and tombstones

From Jeff Erickson

20 plays 0
2. Ended list data types, implementing a queue… 11 of 12

duration 51 minutes 15 seconds

2. Ended list data types, implementing a queue…

2. Ended list data types, implementing a queue with 2 stacks

2. Ended list data types, implementing a queue…

2. Ended list data types, implementing a queue with 2 stacks

Zoom Recording ID: 3582179261 UUID: pfjsQLCCQ4KFl+2ri9sR1A== Meeting Time: 2024-02-05 11:03:18pmGMT

From Jeff Erickson

51 plays 0
1. Amortized analysis, array-lists 12 of 12

duration 44 minutes 17 seconds

1. Amortized analysis, array-lists

1. Amortized analysis, array-lists

1. Amortized analysis, array-lists

1. Amortized analysis, array-lists

From Jeff Erickson

97 plays 0

Search for ""

Public, Restricted

12 Media

1 Members

Managers:: Jeff Erickson

	Contact Technology Services to report an issue, offer feedback, or request assistance.
	Technology Services Home \| Kaltura Help \| Privacy Policy
	Illinois Media Space, © 2022 Board of Trustees of the University of Illinois