15-200/111 Advanced Programming/Practicum
Exam 1 (100 points)
80 minutes
Name: _________________________________ Section: _____________
This is a closed book exam. However, you are allowed one page of notes.
๎๎๎๎๎
๎๎
๎๎
๎๎๎๎๎๎๎
๎๎๎๎
๎๎๎๎๎
๎๎๎๎๎๎๎
๎๎๎๎
๎๎๎๎
๎๎๎๎๎๎๎๎๎๎
๎๎๎๎๎๎๎๎๎๎
๎๎๎๎
๎๎๎๎๎๎๎
๎๎
๎๎
๎๎๎๎
๎๎๎๎๎๎
1. Java is ______________ programming language
a. procedural b. object oriented c. assembly d. none of the above
2. One of the strongest features of Java programming language is
a. efficiency b. platform independence c. low level access to memory d. none of the above
3. The class ______________ helps create and initialize objects
a. Constructor b. state variables c. methods d. none of the above
4. Java arrays can hold primitives as well as references
a. TRUE b. FALSE
5. The notion of combining state and methods in an object is called
a. inheritance b. encapsulation c. interface d. none of the above
6. An object is an instance of a class
a. TRUE b. FALSE
7. Package is a collection of ___
a. related classes b. related methods c. related variables
8. Which one of the following is not a primitive data type
a. int b. String c. float d. char e. None of the above
9. Public members of a class are:
a. Accessible only by the class members
b. Accessible by all outside objects
c. Accessible only by other public members of the class.
d. None of the above
10. What can you say about the following code segment? int[] Arr = new int(15); Arr[15] = 15;
a. Assigns the value 15 to the last location of the array b. throws array index out of bounds error
c. The Arr declaration should be int[ ] Arr = new int(15); d. None of the above
11. If A is an array of ints, which of the following statements best describes the effect of A = NULL;
a. All elements of A are assigned 0 b. Only the first element of A is assigned 0
c. All memory allocated for array A is freed during garbage collection c. None of the above
12. The best algorithm to search a sorted list is
a. linear search b. binary search c. Bubble Sort d. None of the above
13. What statement best describes the following code segment
int [] A = new int(15); int[] B = A;
