CS-KEY-PartB-Sum08 - Computer Science Part B KEY Computer...

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

View Full Document Right Arrow Icon
Computer Science Part B KEY Page 1 of 6 Computer Science Foundation Exam August 8 , 2008 Computer Science Section 1B Name: SSN: Max Pts Passing Pts Category Score Q1 10 6 KNW Q2 8 4 CMP Q3 12 8 ANL Q4 8 6 DSN Q5 12 8 DSN Total 50 32 You have to do all the 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 . KEY
Background image of page 1

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

View Full Document Right Arrow Icon
Computer Science Part B KEY Page 2 of 6 1. [ 10 pts ] Circle the correct choices in each of the following parts: (i) The worst case complexity of searching for a value in an unsorted array of n integers is a) O(1) b) O(log n) c) O(n) d) O(n log n) (ii) The worst case complexity of dequeuing one item from a queue using an array implementation is a) O(1) b) O(log n) c) O(n) d) O(n log n) (iii) The time complexity of attaching a linked list containing k elements at the end of another linked list containing j elements would be a) O( j) b) O(k) c) O( j+k) d) O( jk) (iv) The status of function calls during the execution of a computer program is best
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.

{[ snackBarMessage ]}

Page1 / 6

CS-KEY-PartB-Sum08 - Computer Science Part B KEY Computer...

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