Quiz2.fa10

Quiz2.fa10 - Signature ______________________...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: Signature ______________________ Name_________________________ Student ID _____________________ Score: Quiz 2 CSE 21 Fall 2010 How many different strings can be formed by rearranging the letters in the word ABCABCA? _____ A) C(7,3) B) P(7,3) C) 7!/(3!2!2!) D) 7! E) 7 3 F) (3!2!2!)/7! 26 refrigerator magnets (A-Z). No duplicates. How many 5-letter strings can be formed from them? _____ A) C(26,5) B) P(26,5) C) 26 5 D) 26! E) 5 26 F) 5! Which of the following would require the use of strong induction and which would require the use of weak induction in a proof? A) strong induction B) weak induction _____ T(n) = T(n-1) + T(n-3) _____ T(n) = T(n-1) + T(n-2) _____ T(n) = T(n-1) + 2 n _____ T(n) = 2*T(n-1) _____ T(n) = n*T(n-1) _____ T(n) = T(n-1) + 5 Define a function for P(T) that displays the nodes in Post-Order 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 an appropriate statement. Not all blanks need to be filled. If there is only one base case, only put a number in an appropriate statement....
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.

Page1 / 2

Quiz2.fa10 - Signature ______________________...

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