F01FE - CET 230 Name: 1. (3 points) Why Applied Data...

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

View Full Document Right Arrow Icon
CET 230 Applied Data Structures Fall 2001 Final Exam Name: 1. (3 points) Why is the order of an algorithm generally more important than the speed of the processor? 2. (3 points) Why is writing easily modifiable code important? A. Easily modifiable code generally has a quicker run time. B. Most real world programs require change at some time. C. Most text editors make it easy to modify code. D. Several people may be writing the same function at the same time. 3. (3 points) What term is used to describe an O(n) algorithm. A. Constant B. Linear C. Logarithmic D. Quadratic 4. (3 points) Why is it important to test boundary values when testing programs? A. Calculating by hand, it's easy to find the right answers for boundary values. B. Debuggers are easier to use when testing boundary values. C. In practice, a large proportion of errors arise from boundary values. D. The correct execution of a function on all boundary values proves a function is correct. 5. (4 points) In what situation does Java automatically provide a no-argument (default) constructor and what does the automatic no-arguments constructor do? 1/6
Background image of page 1

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

View Full DocumentRight Arrow Icon
CET 230 Applied Data Structures Fall 2001 Final Exam Name: 6. (3 points) What is the primary purpose of a constructor? A. To allow multiple classes to be used in a single program. B. To copy an actual argument to a method's parameter. C. To initialize each object as it is declared. D. To maintain a count of how many objects of a class have been created. 7. (3 points) Which is the best approach to copying elements from part of one array b to another array c? A. Use a for loop. B. Use b.clone( ). C. Use the assignment operator c = b. D. Use System.arraycopy. 8. (3 points) Who needs to know about the invariant of an ADT? A.
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.

This note was uploaded on 01/02/2012 for the course COMPUTER 101 taught by Professor Dr.kahan during the Spring '11 term at Akademia Ekonomiczna w Krakowie.

Page1 / 6

F01FE - CET 230 Name: 1. (3 points) Why Applied Data...

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