This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Signature ______________________ Name_________________________ Student ID _____________________ Score: Quiz 2 CSE 21 Spring 2010 Professor Sally Mander has 25 students in her Data Structures class and 17 students in her Discrete Math class. Assuming that there are no students who take both classes, how many students does Sally have? _____ A) 50 B) 34 C) 8 D) 42 E) 26 Assuming there are 8 students who take both classes, how many students does Sally have? _____ A) 50 B) 34 C) 8 D) 42 E) 26 Which of the following would require the use of strong induction and which would require the use of weak induction in a proof? A) weak induction B) strong induction _____ T(n) = T(n1) + T(n3) _____ T(n) = T(n1) + T(n2) _____ T(n) = T(n1) + 2 n _____ T(n) = 2*T(n1) _____ T(n) = n*T(n1) _____ T(n) = T(n1) + 5 Define a function for P(T) that displays the nodes in PreOrder for a binary search tree T. B1 and B2 are possible base cases. R1 and R2 are possible recursive cases. Fill in the blanks with the number associated with possible base cases....
View
Full
Document
This note was uploaded on 01/07/2011 for the course CSE CSE11 taught by Professor Cs during the Spring '10 term at UCSD.
 Spring '10
 CS
 Data Structures

Click to edit the document details