Koofers

Past Exam for COMP 385 - DATA STRUCTURES II at Wentworth Institute of Technology (WIT)

Exam Information

Material Type:Final
Professor:Staff
Class:COMP 385 - DATA STRUCTURES II
Subject:Computer Science
University:Wentworth Institute of Technology
Term:--
Keywords:
  • Bi-Directional
  • Directional
  • Following Sets
  • Professional
  • Parking Lot
  • Hash Function
  • Concordance
  • Data Structure
  • Programming
  • Data Structures
Login / Sign Up to View Document
Preview Page 1Preview Page 2Preview Page 3Preview Page 4

Sample Document Text

NAME___________________________________________________ Wentworth Institute of Technology Division of Professional and Continuing Studies COMP385 Section 71 - Data Structures II - Fall, 2005 P1 P2 Total Final – Open Book L I N V G K M R C J E T Z X A 1. For the above Binary Tree, write the In-Order and Pre-Order traversal 2. For the above Binary Tree, write the array that represents the Heap Representation of the tree 3. Write a generic method, toStringMiddle, that accepts an array of generic datatypes (T), finds the middle element, and returns it as a string to the calling programming, using the toString method of the datatype (if the number of elements in the array is even, there is no “middle” element, so return the item before what would be the middle element). . /opt/scribd/conversion/tmp/scratch9/21107360.doc 8/19/2009 1 4. Given the below recursive method, what is the value of int ffudge( int n) { if (n == 0) return 1; if (n==1 ) return 2; return 2*ffudge(n-2) + 3*ffudge(n-1);...
155, "/var/app/current/tmp/"