JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

adding lecture 27

Browse Source
This commit is contained in:
Jidong Xiao
2023-12-04 15:47:09 -05:00
parent ed2a87691a
commit 9390592f0e
1 changed files with 2 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
lectures/27_hybrid_data_structures/README.md
View File

@@ -23,15 +23,10 @@ different aspects of these variants.
This term we’ve already discussed / implemented a number of data structure variants: This term we’ve already discussed / implemented a number of data structure variants:
- single vs. doubly linked lists - single vs. doubly linked lists
- using more memory can improve convenience and running time for key operations - using more memory can improve convenience and running time for key operations
- 2D arrays/vectors (HW3) or 2D linked grid/matrix (HW5) - 2D arrays/vectors
- hash table: separate chaining vs open addressing – reduce memory and avoid pointer dereferencing - hash table: separate chaining vs open addressing – reduce memory and avoid pointer dereferencing
- stack and queue – restricted/reduced(!) set of operations on array/vector and list - stack and queue – restricted/reduced(!) set of operations on array/vector and list
- priority queue
In the remaining lecture & homeworks we’ll cover 2 additional classic data structures and several more variants...
- priority queue with backpointers (may be used in Homework 10) – when you need to update data already in the
structure
- leftist heap (might mention this in Lecture 25...)
We’ll discuss just a few additional variants today. We’ll discuss just a few additional variants today.