Koofers

Past Exam for CP SC 212 - ALGS/DATA STRUCTURES at Clemson (Clemson)

Exam Information

Material Type:Exam 2
Professor:Staff
Class:CP SC 212 - ALGS/DATA STRUCTURES
Subject:COMPUTER SCIENCE
University:Clemson University
Term:--
Login / Sign Up to View Document
Preview Page 1Preview Page 2Preview Page 3

Sample Document Text

CPSC 212-301 Test #2B\n\nName: _____________________________ October 26, 2005\n\nHonor Pledge: I pledge that I have neither given nor received unauthorized assistance on this test. Signed: _______________________ Date: _____________\nClosed books. Closed Notes. Calculators OK. 85 points. 60 minutes. Weight of each question in parentheses. Please use a pencil. For more space, use the back of the sheet. 1. (10) Perform the following operations on an initially empty Leftist minHeap. Note that “D” represents a “Delete” operation. Ignore duplicates. Draw the final heap.\n7 9 15 26 33 47 D D 23 19 16 14 D 18\n\n2.\n\n(10) Perform the following operations on an initially empty Binary maxHeap. Note that “D” represents a “Delete” operation. Ignore duplicates. Draw the final heap.\n7 9 15 26 33 47 D D 23 19 16 14 D 18\n\n3.\n\n(10) Explain clearly why QuickSort is O(n log n). Your answer should include an explanation of why the selection of the pivot element is so important.\n\n 4.\n\n(10) Consider the ...
155, "/var/app/current/tmp/"