Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Notes; Professor: Tseng; Class: OBJECT-ORIENTED PROG II; Subject: Computer Science; University: University of Maryland; Term: Unknown 1989;
Typology: Study notes
1 / 7
This page cannot be seen from the preview
Don't miss anything!
Search trees Heaps Hash tables Tries
Topic – Data Structures
Linear Hierarchical Graph Maps & sets
Relationship between elements Operations supported Impact on efficiency
Topic – Graph Algorithms
Traversals Spanning trees Minimal spanning trees Shortest paths
Topic – Compression
Algorithm Implementation Properties
Midterm Question Formats
Multiple Choice Question Example
Sorting is more complex Searching is more complex Sorting takes more space Searching takes more space Sorting compares two items by size
(circle all that apply)
Short 1-Sentence Answer Example
(provide short 1-sentence answer)
Apply & Describe Algorithms
Apply depth-first search, starting at 1 Apply breadth-first search, starting at 1 Apply Djikstra’s algorithm, starting at 1 Apply Kruskal’s algorithm
