Review for Final CS 261 Fall 2006
Be able to write the code for:
dynamic array (all operations). dynamic array bag, stack, set, map, deque, sorted merge
Linked List Stack, Queue, Bag, sorted lists – both singly and doubly linked
Tree sort
Hash tables (both varieties, all operations)
Be able to explain (but you don’t need to memorize the code)
Skip lists (all operations)
Tree traversals
AVL tree insertion
Heap sort, skew heaps, priority queues
graph representations (adjacency matrix, edge list representation, weighted and
unweighted)
Be able to simulate
Radix Sort, Heap Sort, Heap operations, Dijkstras algorithm
Know the big-Oh for all the algorithms and data structures we have looked at this term.
Answer questions related to the course learning objectives:
1. describe the properties, interfaces, and behaviors of basic abstract data types, such as
collection, bag, indexed collection, sorted collection, stack, and queue
2. read an algorithm or program code segment that contains iterative constructs and
analyze the asymptotic time complexity of the algorithm or code segment
3. state the asymptotic time complexity of the fundamental operations associated with a
variety of data structures, such as vector, linked list, tree, and heap
4. recall the space utilization of common data structures in terms of the long-term
storage needed to maintain the structure, as well as the short-term memory requirements
of fundamental operations, such as sorting
5. design and implement general-purpose, reusable data structures that implement one
or more abstractions
6. compare and contrast the operation of common data structures (such as linear
structures, priority queues, tree structures, hash tables, maps, and graphs) in terms of time
complexity, space utilization, and the abstract data types they implement