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

clarify what is covered

Browse Source
This commit is contained in:
Jidong Xiao
2023-12-07 15:53:23 -05:00
parent 50d5c6476a
commit 9413d40723
1 changed files with 2 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
lectures/28_concurrency/README.md
View File

@@ -171,8 +171,7 @@ program (or exiting in this example).
- Algorithm analysis: big O notation; best case, average case, or worst case; algorithm running time or additional
memory usage
- STL classes: string, vector, list, map, & set, (we talked about but did not practice using STL stack,
queue, unordered_set, unordered_map, & priority_queue)
- STL classes: string, vector, list, map, & set, stack, queue, unordered_set, unordered_map, & priority_queue.
- C++ Classes: constructors (default, copy, & custom argument), assignment operator, & destructor, classes
with dynamically-allocated memory, operator overloading, inheritance, polymorphism
- Subscripting (random-access, pointer arithmetic) vs. iteration
@@ -180,7 +179,7 @@ with dynamically-allocated memory, operator overloading, inheritance, polymorphi
- Memory: pointers & arrays, heap vs. stack, dynamic allocation & deallocation of memory, garbage collection,
smart pointers
- Implementing data structures: resizable arrays (vectors), linked lists (singly-linked, doubly-linked, circularlylinked, dummy head/tail nodes), trees (for sets & maps), hash sets
- Binary Search Trees, tree traversal (in-order, pre-order, post-order, depth-first, & breadth-first), ropes
- Binary Search Trees, tree traversal (in-order, pre-order, post-order, depth-first, & breadth-first).
- Hash tables (hash functions, collision resolution), priority queues, heap as a vector
- Exceptions, concurrency & asynchronous computing