CSpartB-KEY-May09 - Computer Science Foundation Exam May 8,...

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

View Full Document Right Arrow Icon
Computer Science Foundation Exam May 8, 2009 Computer Science Section 1B Name: Grading Criteria PID: Max Pts Type Passing Threshold Student Score Q1 10 ANL 7 Q2 10 DSN 7 Q3 10 DSN 7 Q4 10 ANL 7 Q5 10 ANL 7 Total 50 35 You must do all 5 problems in this section of the exam. Partial credit cannot be given unless all work is shown and is readable. Be complete, yet concise, and above all be neat . Do your rough work on the last page.
Background image of page 1

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

View Full DocumentRight Arrow Icon
1) (10 points) Order Notation Using Big-O notation, indicate the time complexity in terms of the appropriate variables for each of the following operations: a) Merging two sorted arrays of n elements each into a single ___________ sorted array b) Adding n elements to an initially empty queue ___________ c) Summing all the numbers in n arrays each containing m integers ___________ d) Sorting n integers using QuickSort ( worst case ) ___________ e) Sorting n integers using QuickSort ( best case ) ___________ f) Inserting another integer into an AVL tree containing n integers ___________ ( best case ) g) Inserting another integer into a binary search tree containing n ___________ integers that does not enforce structure properties ( best case ) h)
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 6

CSpartB-KEY-May09 - Computer Science Foundation Exam May 8,...

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

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