Summary Notes for Entire Course
Subject notes for UTS 31251
Description
These notes thoroughly cover all lecture content for the entire course - for the final exam. Notes include but are not limited to the following topics: - I/O - destructors - templates - stacks - queues - vectors - iterators - algorithm analysis - divide and conquer - recursion - master theorem - graphs - traversing graphs - greedy algorithms - binary trees - heaps - sorting algorithms - maps - hashing - collision maps - dynamic programming - shortest paths - topological sorting - string search - Rabin-karp algorithm - computational complexity - P and NP
UTS
Autumn session, 2021
40 pages
5,165 words
$54.00
Campus
UTS, Broadway & Markets
Member since
May 2020