C S 314 Midterm: Spring_2014_M1
Document Summary
Points off 1 2 3a 3b 4 total off net score. Instructions: there are 4 questions on this test. Scores will be scaled to 200 points: you have 2 hours to complete the test, place you answers on this test. Not the scratch paper: you may not use a calculator or any other electronic devices while taking the test, when writing a method, assume the preconditions of the method are met. Place your answer on the line next to or under the question. For example selection sort has an average case big o of o(n2), but per the formal definition of big o it is correct to say selection sort also has a big o of o(n3) or o(n4). I want the most restrictive, correct big o function. (closest without going under. ) Recall, t(n) is the function that represents the actual number of executable statements for an algorithm.
