2. Created by Terri Street Copyright, 2000

3.  1,000,0001,000,000  500,000500,000  250,000250,000  125,000125,000  64,00064,000  32,00032,000  16,00016,000  8,0008,000  4,0004,000  2,0002,000  1,0001,000  500500  300300  200200  100100

4. Click to return to question, Cont-P to switch to the pen, cross out two incorrect answers, then Cont-A to switch back to pointer.

5. Click to return to the question and poll the class

6. Click on link to Google, or click on this oval to return to question and ask a friend

7.  A. decimal A. decimal  C. char C. char  B. int B. int  D. double D. double Which of these is not a primitive data type?

8. Back to Board  A. decimal

9.  A. multiplier A. multiplier  C. incrementor C. incrementor  B. extender B. extender  D. equalizer D. equalizer Fill in the blank: for({initialization};{exit condition};{________})

10. Back to Board C. incrementor

11.  A. break A. break  C. package C. package  B. case B. case  D. const D. const Which keyword is used to create individual arguments in a switch statement?

12. Back to Board B. case

13.  A. parent classes can have several A. parent classes can have several children classes  C. children classes can have several C. children classes can have several parent classes  B. parent classes can only have a B. parent classes can only have a single child class  D. A and C D. A and C Which of the following is true in java?

14. Back to Board A. parent class can have several children classes

15.  A. public final main(Char [] Object) A. public final main(Char [] Object)  C. private static final main(String args) C. private static final main(String args)  B. private static void main(Char [] args) B. private static void main(Char [] args)  D. public static void main(String [] args) D. public static void main(String [] args) What is the correct syntax for a main method?

16. Back to Board D. public static void main(String [] args)

17.  A. initializes a class A. initializes a class  C. pops the top of a stack C. pops the top of a stack  B. pops a linked-list B. pops a linked-list  D. pops the top of a queue D. pops the top of a queue What does the pop() method do?

18. Back to Board C. pops the top of a stack

19.  A. shortens A. shortens  C. creates C. creates  B. implements B. implements  D. extends D. extends To use an interface,you must write a class that ______ the interface.

20. Back to Board B. implements

21.  A. Deletion of elements A. Deletion of elements  C. Direct access to elements C. Direct access to elements  B. fixed size B. fixed size  D. complex insertion D. complex insertion What is an advantage of using an array over a linked list?

22. Back to Board C. Direct access to elements

23.  A. NoSuchElement A. NoSuchElement  D. RuntimeComplexity D. RuntimeComplexity Which of the following is not a common exception?  C. ArrayIndexOutOfBounds C. ArrayIndexOutOfBounds  B. NullPointer B. NullPointer

24. Back to Board D. RuntimeComplexity

25. Which kind of class does not “pollute” the name space of the package?  A. Hidden Class A. Hidden Class  C. Super Class C. Super Class  D. Outer class D. Outer class  B. Inner class B. Inner class

26. Back to Board B. Inner Class

27.  A. Delegation A. Delegation What technique would allow a object to “change” class over time?  C. Recursion C. Recursion  B. Polymorphism B. Polymorphism  D. Anamorphism D. Anamorphism

28. Back to Board A. Delegation

29.  B. GridBag Layout B. GridBag Layout Which of the following is a Layout Manager?  A. Container Layout A. Container Layout  C. Panel Layout C. Panel Layout  D. Frame Layout D. Frame Layout

30. Back to Board B. GridBag Layout

31.  C. Overrides C. Overrides  A. Hides A. Hides  B. Overloads B. Overloads  D. Equals D. Equals Superclass Instance Method Superclass Static Method Subclass Instance Method ????????Generates a compile-time error Subclass Static Method Generates a compile-time error Hides

32. Back to Board C. Overrides

33.  D. next D. next Fill in the blank: private Node getLastNode() Node cNode=this.first; Node pNode=null; while(cNode != null){ pNode=cNode; cNode=cNode. _____; } return pNode; }  A. null A. null  C. first C. first  B. data B. data

34. Back to Board D. next

35.  A. Because the recursion happens A. Because the recursion happens on nodes, not lists. In implementing a linked list recursively, why do some methods require helper functions?  B. Because the recursion happens B. Because the recursion happens on stacks, not lists.  D. Because the recursion happens D. Because the recursion happens on queues, not stacks.  C. Because the recursion happens C. Because the recursion happens on lists, not nodes.

36.  A. Because the recursion happens on nodes, not lists.

37. Sorry, try again!

38. Thanks for playing! Good Luck!