






















Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Material Type: Exam; Professor: Uhlmann; Class: Algorithm Design and Programming II; Subject: Computer Science; University: University of Missouri - Columbia; Term: Fall 2009;
Typology: Exams
1 / 30
This page cannot be seen from the preview
Don't miss anything!
CS‐ 2050 Exam 1 F
Instructions: Mark the single best answer for each of the following questions. Although there are 23 questions, the exam will be scored out of a maximum of 20 points.
CS‐ 2050 Exam 1 F
Instructions: Mark the single best answer for each of the following questions. Although there are 23 questions, the exam will be scored out of a maximum of 20 points.
CS‐ 2050 Exam 1 September 19, 2008
Directions : Mark the single best answer for each of the following questions. Do not make assumptions that are not explicitly stated in the question (e.g., don’t assume an array is sorted unless the question states that it is sorted).
CS‐ 2050 Exam 1 September 19, 2008
Directions : Mark the single best answer for each of the following questions. Do not make assumptions that are not explicitly stated in the question (e.g., don’t assume an array is sorted unless the question states that it is sorted).
sumfor =(i=0; 0; i < N; i += 1000) { for (j=1000;sum += i*j; j > 0; j -= 10) { } }
sumfor =(i=0; 0; i < N; i += 1000) { for (j=1000;sum += i*j; j > 0; j -= 10) { } }