Index A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W A Algorithm analysis All labs and assignments are to be turned in on time via Gradescope Ancestor of a Node Array Arrays Assignments Assumption Asymptotic analysis Attend Lectures & Labs Average-case? B Bad News [birthday problem] Best-case? Binary search Bins and Balls Bloom filters Bubble sort C Child Node Come to Office Hours Computational cost Condition Statements Contact TAs Cycle D Dead-code elimination Definition, [1], [2] Degree of a Node Depth of a node Descendant Directed Cycle Directed Path E Every program is a digraph, [1] F Forward List G Goal, [1] Good News Graph, [1] Graph search Graph search algorithms Graphs H Hash tables Hashing algorithms Heaps Height of a node Height of the Tree I Infinite-loop detection Insertion sort Internal node Iterative Statements J Jump Statements K Key data structure Key idea, [1] L Labs Leaf Node or External Node Level of a node Linear search Linked Lists List M Memory cost Merge sort Minimum spanning tree algorithms N Neighbor of a Node Note Number of edges O Organize your time P Parent Node Parent-link representation of paths from s Participate / Think Critically Path Plagiarism? Post on EdStem Priority Queues Problem, [1], [2], [3], [4] Proof, [1] Proposition, [1] Q queue Queues Quick sort R Reachable objects Recursive relation Repeat until queue is empty Root Node Roots S Sequence Sequence Containers Series Shortest path algorithms Sibling Solution, [1], [2] Sorting algorithms Space complexity stack/recursion Stacks Start early!! Subtree T Time complexity To visit vertex v:, [1] Tree traversal Tree traversal algorithms Trees Tries Typical applications, [1] U Use adjacency-lists V Vector Vertex representation W Worst-case?
