Assignments
- 07.03.01 - Binary Tree as a Recursive Data StructureNo Points Possible
- Recursion Pre-test10 Points Possible
- Algorithm Analysis Pretest10 Points Possible
- OpenDSA180 Points Possible
- Midterm 1100 Points Possible
- 09.04.01 - Buffer PoolsNo Points Possible
- Midterm 2100 Points Possible
- Final150 Points Possible
- Bank Day BonusNo Points Possible
- 07.21.01 - Summary QuestionsNo Points Possible
- 03.02.02 - RelationsDue May 9, 2016 at 11am2 Points Possible
- 13.03.01 - Sequential Tree RepresentationsDue May 9, 2016 at 11am1 Points Possible
- 03.02.03 - Equivalence RelationsDue May 9, 2016 at 11am1 Points Possible
- 13.02.01 - The Union/Find ProblemDue May 9, 2016 at 11am2 Points Possible
- 03.02.04 - Partial OrdersDue May 9, 2016 at 11am1 Points Possible
- 13.03.02 - Alternative Sequential RepresentationDue May 9, 2016 at 11am1 Points Possible
- 14.01.02 - Graph RepresentationsDue May 9, 2016 at 11am2 Points Possible
- 03.04.01 - LogarithmsDue May 9, 2016 at 11am2 Points Possible
- 12.02.01 - Linear IndexingDue May 9, 2016 at 11am2 Points Possible
- 13.03.03 - Bit Vector RepresentationDue May 9, 2016 at 11am1 Points Possible
- 14.01.03 - Graph Terminology QuestionsDue May 9, 2016 at 11am3 Points Possible
- 03.09.01 - Chapter Summary QuestionsDue May 9, 2016 at 11am1 Points Possible
- 13.03.04 - General Tree Sequential RepresentationDue May 9, 2016 at 11am1 Points Possible
- 12.04.01 - Tree-based IndexingDue May 9, 2016 at 11am1 Points Possible
- 14.03.02 - Depth-First SearchDue May 9, 2016 at 11am2 Points Possible
- 14.03.03 - Breadth-First SearchDue May 9, 2016 at 11am2 Points Possible
- 12.06.01 - B-TreesDue May 9, 2016 at 11am2 Points Possible
- 12.07.01 - Indexing SummaryDue May 9, 2016 at 11am2 Points Possible
- 14.05.01 - Shortest-Paths ProblemsDue May 9, 2016 at 11am2 Points Possible
- 14.06.02 - Prim's AlgorithmDue May 9, 2016 at 11am2 Points Possible
- 14.07.01 - Kruskal's AlgorithmDue May 9, 2016 at 11am2 Points Possible
- Project 4Due May 3, 2016 at 11pm150 Points Possible
- 08.02.01 - Sorting Terminology and NotationDue Apr 12, 2016 at 11am1 Points Possible
- 10.02.01 - Hash Function PrinciplesDue Apr 12, 2016 at 11am1 Points Possible
- 08.03.01 - Insertion SortDue Apr 12, 2016 at 11am1 Points Possible
- 10.03.01 - Sample Hash FunctionsDue Apr 12, 2016 at 11am0.5 Points Possible
- 08.03.02 - Insertion Sort AnalysisDue Apr 12, 2016 at 11am1 Points Possible
- 10.03.02 - A Simple Hash Function for StringsDue Apr 12, 2016 at 11am0.5 Points Possible
- 08.04.01 - Bubble SortDue Apr 12, 2016 at 11am2 Points Possible
- 10.03.03 - String FoldingDue Apr 12, 2016 at 11am0.5 Points Possible
- 08.04.02 - Bubble Sort AnalysisDue Apr 12, 2016 at 11am1 Points Possible
- 10.03.04 - Hash Function PracticeDue Apr 12, 2016 at 11am1 Points Possible
- 08.05.01 - Selection SortDue Apr 12, 2016 at 11am2 Points Possible
- 10.03.05 - Hash Function Review QuestionsDue Apr 12, 2016 at 11am1 Points Possible
- 08.05.02 - Selection Sort AnalysisDue Apr 12, 2016 at 11am1 Points Possible
- 10.04.01 - Open HashingDue Apr 12, 2016 at 11am2 Points Possible
- 08.06.01 - The Cost of Exchange SortingDue Apr 12, 2016 at 11am2 Points Possible
- 10.05.01 - Bucket HashingDue Apr 12, 2016 at 11am1 Points Possible
- 11.04.01 - First FitDue Apr 12, 2016 at 11am2 Points Possible
- 08.06.02 - AnalysisDue Apr 12, 2016 at 11am1 Points Possible
- 10.05.02 - An Alternate ApproachDue Apr 12, 2016 at 11am1 Points Possible
- 08.08.01 - ShellsortDue Apr 12, 2016 at 11am1 Points Possible
- 10.06.01 - Collision ResolutionDue Apr 12, 2016 at 11am1 Points Possible
- 08.08.02 - Putting It TogetherDue Apr 12, 2016 at 11am1 Points Possible
- 10.07.01 - Linear Probing by StepsDue Apr 12, 2016 at 11am2 Points Possible
- 08.08.03 - Shellsort Practice ExerciseDue Apr 12, 2016 at 11am2 Points Possible
- 09.06.01 - External SortingDue Apr 12, 2016 at 11am1 Points Possible
- 10.07.02 - Pseudo-Random ProbingDue Apr 12, 2016 at 11am2 Points Possible
- 08.08.04 - Optimizing ShellsortDue Apr 12, 2016 at 11am2 Points Possible
- 09.06.02 - Multiway MergingDue Apr 12, 2016 at 11am1 Points Possible
- 10.07.03 - Quadratic ProbingDue Apr 12, 2016 at 11am2 Points Possible
- 08.08.05 - Shellsort Summary QuestionsDue Apr 12, 2016 at 11am1 Points Possible
- 10.07.04 - Double HashingDue Apr 12, 2016 at 11am2 Points Possible
- 08.09.01 - Mergesort ConceptsDue Apr 12, 2016 at 11am1 Points Possible
- 10.08.01 - Analysis of Closed HashingDue Apr 12, 2016 at 11am1 Points Possible
- 08.09.02 - Mergsort Practice ExerciseDue Apr 12, 2016 at 11am2 Points Possible
- 10.09.01 - DeletionDue Apr 12, 2016 at 11am2 Points Possible
- 08.10.01 - Implementing MergesortDue Apr 12, 2016 at 11am1 Points Possible
- 10.09.02 - Hashing Deletion Summary QuestionsDue Apr 12, 2016 at 11am1 Points Possible
- 08.11.01 - IntroductionDue Apr 12, 2016 at 11am1 Points Possible
- 10.10.01 - Hashing ReviewDue Apr 12, 2016 at 11am2 Points Possible
- 08.11.02 - PartitionDue Apr 12, 2016 at 11am1 Points Possible
- 08.11.03 - Putting It TogetherDue Apr 12, 2016 at 11am2 Points Possible
- 08.11.04 - Quicksort AnalysisDue Apr 12, 2016 at 11am1 Points Possible
- 08.12.01 - HeapsortDue Apr 12, 2016 at 11am2 Points Possible
- 08.12.02 - Heapsort Proficiency PracticeDue Apr 12, 2016 at 11am2 Points Possible
- 08.12.03 - Heapsort AnalysisDue Apr 12, 2016 at 11am1 Points Possible
- 08.14.01 - Radix SortDue Apr 12, 2016 at 11am2 Points Possible
- 08.14.02 - Array-based Radix SortDue Apr 12, 2016 at 11am1 Points Possible
- 08.15.01 - An Empirical Comparison of Sorting AlgorithmsDue Apr 12, 2016 at 11am1 Points Possible
- 08.16.01 - Lower Bounds for SortingDue Apr 12, 2016 at 11am1 Points Possible
- 08.17.01 - Sorting Summary ExercisesDue Apr 12, 2016 at 11am2 Points Possible
- Project 3Due Apr 7, 2016 at 11pm100 Points Possible
- Project 2Due Mar 16, 2016 at 11pm100 Points Possible
- 06.03.01 - Comparing RecordsDue Feb 23, 2016 at 11pm1 Points Possible
- 04.02.01 - Problems, Algorithms, and ProgramsDue Feb 23, 2016 at 11pm1 Points Possible
- 05.02.01 - List Terminology and NotationDue Feb 23, 2016 at 11pm1 Points Possible
- 07.02.01 - Definitions and PropertiesDue Feb 23, 2016 at 11pm2 Points Possible
- 01.01.01 - Data Structures and AlgorithmsDue Feb 23, 2016 at 11pm1 Points Possible
- 06.04.01 - The Dictionary ADTDue Feb 23, 2016 at 11pm1 Points Possible
- 04.03.01 - Comparing AlgorithmsDue Feb 23, 2016 at 11pm2 Points Possible
- 05.03.02 - Insert Practice ExericseDue Feb 23, 2016 at 11pm1 Points Possible
- 06.01.01 - Design PatternsDue Feb 23, 2016 at 11pm1 Points Possible
- 07.02.02 - Practice QuestionsDue Feb 23, 2016 at 11pm1 Points Possible
- 05.03.03 - Append and RemoveDue Feb 23, 2016 at 11pm1 Points Possible
- 01.02.01 - Abstract Data TypesDue Feb 23, 2016 at 11pm1 Points Possible
- 04.03.02 - Growth Rates Ordering ExerciseDue Feb 23, 2016 at 11pm1 Points Possible
- 04.05.01 - Faster Computer, or Faster Algorithm?Due Feb 23, 2016 at 11pm1 Points Possible
- 05.03.04 - Array-based List Practice QuestionsDue Feb 23, 2016 at 11pm1 Points Possible
- 07.05.02 - ImplementationDue Feb 23, 2016 at 11pm1 Points Possible
- 04.06.01 - Asymptotic Analysis and Upper BoundsDue Feb 23, 2016 at 11pm1 Points Possible
- 05.04.02 - Linked List ImplementationDue Feb 23, 2016 at 11pm1 Points Possible
- 07.05.03 - Postorder Traversal PracticeDue Feb 23, 2016 at 11pm1 Points Possible
- 04.07.01 - Lower Bounds and Theta NotationDue Feb 23, 2016 at 11pm2 Points Possible
- 05.04.03 - Linked List RemoveDue Feb 23, 2016 at 11pm2 Points Possible
- 07.05.04 - Preorder Traversal PracticeDue Feb 23, 2016 at 11pm1 Points Possible
- 05.05.01 - Space ComparisonDue Feb 23, 2016 at 11pm1 Points Possible
- 07.05.05 - Summary QuestionsDue Feb 23, 2016 at 11pm1 Points Possible
- 05.05.02 - Time ComparisonDue Feb 23, 2016 at 11pm2 Points Possible
- 07.06.01 - Implementing Tree TraversalsDue Feb 23, 2016 at 11pm1 Points Possible
- 05.07.01 - List Element ImplementationsDue Feb 23, 2016 at 11pm1 Points Possible
- 07.07.01 - Information Flow in Recursive FunctionsDue Feb 23, 2016 at 11pm2 Points Possible
- 05.08.02 - Array-Based StacksDue Feb 23, 2016 at 11pm1 Points Possible
- 07.07.02 - Collect-and-returnDue Feb 23, 2016 at 11pm4 Points Possible
- 05.08.03 - PopDue Feb 23, 2016 at 11pm1 Points Possible
- 07.07.03 - Combining Information FlowsDue Feb 23, 2016 at 11pm2 Points Possible
- 05.09.01 - Linked Stack ImplementationDue Feb 23, 2016 at 11pm1 Points Possible
- 07.07.04 - Combination ProblemsDue Feb 23, 2016 at 11pm4 Points Possible
- 05.09.02 - Linked Stack PopDue Feb 23, 2016 at 11pm1 Points Possible
- 07.10.01 - Binary Tree Space RequirementsDue Feb 23, 2016 at 11pm2 Points Possible
- 05.12.03 - Array-based Queue ImplementationDue Feb 23, 2016 at 11pm1 Points Possible
- 07.11.01 - Binary Search Tree DefinitionDue Feb 23, 2016 at 11pm1 Points Possible
- 04.08.01 - Calculating Program Running TimeDue Feb 23, 2016 at 11pm1 Points Possible
- 05.12.04 - Array-based Dequeue PracticeDue Feb 23, 2016 at 11pm1 Points Possible
- 07.11.02 - BST InsertDue Feb 23, 2016 at 11pm1 Points Possible
- 04.08.02 - Summary ExerciseDue Feb 23, 2016 at 11pm1 Points Possible
- 05.13.01 - Linked QueuesDue Feb 23, 2016 at 11pm1 Points Possible
- 07.11.03 - BST RemoveDue Feb 23, 2016 at 11pm2 Points Possible
- 04.09.01 - Analyzing ProblemsDue Feb 23, 2016 at 11pm1 Points Possible
- 05.13.02 - Linked DequeueDue Feb 23, 2016 at 11pm1 Points Possible
- 07.11.04 - BST AnalysisDue Feb 23, 2016 at 11pm1 Points Possible
- 05.13.03 - Comparison of Array-Based and Linked QueuesDue Feb 23, 2016 at 11pm1 Points Possible
- 07.13.01 - Binary Tree Guided Information FlowDue Feb 23, 2016 at 11pm2 Points Possible
- 04.10.01 - Common MisunderstandingsDue Feb 23, 2016 at 11pm1 Points Possible
- 05.14.01 - Practice QuestionsDue Feb 23, 2016 at 11pm2 Points Possible
- 07.14.01 - Practice ExercisesDue Feb 23, 2016 at 11pm4 Points Possible
- 05.14.02 - Chapter Review QuestionsDue Feb 23, 2016 at 11pm2 Points Possible
- 07.16.01 - Array Implementation for Complete Binary TreesDue Feb 23, 2016 at 11pm1 Points Possible
- 07.17.01 - Heaps and Priority QueuesDue Feb 23, 2016 at 11pm2 Points Possible
- 07.17.02 - Building a HeapDue Feb 23, 2016 at 11pm1 Points Possible
- 07.17.03 - Removing from the heapDue Feb 23, 2016 at 11pm2 Points Possible
- 07.17.04 - Priority QueuesDue Feb 23, 2016 at 11pm2 Points Possible
- 07.18.01 - Huffman Coding TreesDue Feb 23, 2016 at 11pm1 Points Possible
- 04.14.02 - Summary Exercise: CS3Due Feb 23, 2016 at 11pm1 Points Possible
- Project 1Due Feb 10, 2016 at 11pm100 Points Possible