Sp09FinalCrit - CS307 Spring 2009 Final Solution and...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS307 Spring 2009 Final Solution and Grading Criteria. Grading acronyms ABA - Answer by Accident AIOBE - Array Index out of Bounds Exception may occur BOD - Benefit of the Doubt. Not certain code works, but, can't prove otherwise ECF - Error carried forward. Gacky or Gack - Code very hard to understand even though it works or solution is not elegant. (Generally no points off for this.) GCE - Gross Conceptual Error. Did not answer the question asked or showed fundamental misunderstanding NAP - No answer provided. No answer given on test NN - Not necessary. Code is unneeded. Generally no points off NPE - Null Pointer Exception may occur OBOE - Off by one error. Calculation is off by one. 1. As written or -1.5. No partial credit unless stated. On Big O, missing O() is okay. A. 22 / \ 8 63 / / -20 49 B. AGAISNO C. AGANSOI D. AGNOSIA E. AGIASNO F. No G. O(N^2) H. O(NlogN) (base 2 okay) I. SSNI J. O(N) K. O(N) L. open address hasing (or probing) and chaining (or buckets) M. 9 N. 5 bits O. O(logN) P. 5000 * 1000 = 5,000,000 (5 million) +/- 1 million Q. Yes, it is a red black tree. R. No it is not a red black tree. Rule 5 is violated. (The path rule). There are
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/30/2010 for the course CS 307 taught by Professor Scott during the Spring '08 term at University of Texas.

Page1 / 5

Sp09FinalCrit - CS307 Spring 2009 Final Solution and...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online