404FinalExam_Spring2004

404FinalExam_Spring2004 - UML CS 91.404 Final Exam Spring,...

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

View Full Document Right Arrow Icon
UML CS 91.404 Final Exam Spring, 2004 NAME:____________________________________ FINAL EXAM This exam is open: - books - notes and closed : - neighbors - calculators The upper bound on exam time is 3 hours. Please put all your work on the exam paper. (Partial credit will only be given if your work is shown.) Good luck! PLEASE DO NOT FORGET TO FILL OUT AN ON-LINE COURSE EVALUATION! 1 of 22
Background image of page 1

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

View Full DocumentRight Arrow Icon
UML CS 91.404 Final Exam Spring, 2004 1. (15 points) Function Order of Growth (a) (6 points) List the 4 functions below in nondecreasing asymptotic order of growth: ( 29 ( 29 ( 29 n! n n n n n lg 5 2 lglg 8 lg 3 2 4lg 3 lg + 1) 2) 3) 4) smallest largest 2 of 22
Background image of page 2
UML CS 91.404 Final Exam Spring, 2004 Given: Circle TRUE or FALSE for each statement below b) (1 point) )) ( ( ) ( 1 4 n f n f TRUE FALSE c) (1 point) )) ( ( ) ( 2 1 n f n f TRUE FALSE d) (1 point) )) ( ( ) ( 3 2 n f O n f TRUE FALSE e) (1 point) )) ( ( ) ( 4 3 n f O n f TRUE FALSE 3 of 22 ) 9 ( ) ( ) 3 3 log 3 n n f ( 29 n n O n f 2 3 4 lg ) ( ) 4 ( 29 n n n f 3 2 1 lg ) ( ) 1 Θ ( 29 n n n f lg ) ( ) 2 2 Θ
Background image of page 3

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

View Full DocumentRight Arrow Icon
UML CS 91.404 Final Exam Spring, 2004 f) (5 points) Circle TRUE or FALSE for the statement below: ) 3 ( 3 1 n n O + TRUE FALSE 4 of 22
Background image of page 4
UML CS 91.404 Final Exam Spring, 2004 this page intentionally left blank for work 5 of 22
Background image of page 5

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

View Full DocumentRight Arrow Icon
UML CS 91.404 Final Exam Spring, 2004 2. (20 points) Pseudocode Analysis. In this problem a linked list L is searched from both ends for a key k. If k is in the list, a pointer to the node containing k should be returned. Otherwise, NIL should be returned. The list L is doubly- linked and has both head and tail pointers. ) , ( k
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 22

404FinalExam_Spring2004 - UML CS 91.404 Final Exam Spring,...

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

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