Final

Question 1

O(1)

Answer 1

Called bounded time
Amount of work is not dependent on the size of the problem

Adding an item to an array has an order of O(1)

Question 2

O(log2n)

Answer 2

Called logarithmic time

Used with algorithms that can cut the amount of data to be processed in half

Binary Search would be O(log2N)

Question 3

O(N)

Answer 3

Called linear time

Adding together the elements of an array is O(N)

Question 4

O(N log2N)

Answer 4

Called N log N time

Quick sort, Heapsort, merge sort have N log N complexity

Question 5

O(N2)

Answer 5

Called quadratic time

Some simple sorting algorithms are O(N2)

Question 6

O(2N)

Answer 6

Called exponential time

Are extremely costly

Question 7

T or F

LLObjectNode class is a self referential class

Answer 7

True

Question 8

When comparing two objects using the equals method inherited from the Object class, the contents of the objects are being compared

T or F

Answer 8

False

Question 9

JDK has always contained the Java Collections Framework

T/F

Answer 9

False

Question 10

Stack is FIFO

T/F

Answer 10

False

Question 11

We allow duplicate elements in our lists

Answer 11

True

Question 12

Final variable

Answer 12

Holds a value that cannot be changed

Question 13

Which sequence of operations leaves a stack unchanged?

Answer 13

Push and then pop

Question 14

The stackunderflowexception could be thrown by which stack methods?

Answer 14

Pop and top

Question 15

The stackoverflowexception can be thrown by

Answer 15

The push method

Question 16

One method calls another method which calls another method, the activation records are stored in

Answer 16

A stack

Question 17

Unchecked exceptions are directly derived from

Answer 17

Runtime Exception

Question 18

Which method of the Object class returns a string representing some of the internal system implementation details of the object

Answer 18

The toString method

Question 19

Elements of an enum are….

Answer 19

Uppercase and constant

Question 20

Pop operation

Answer 20

Removes top element of a stack

Question 21

Push operation

Answer 21

Adds an element to the top of a stack

Question 22

Java implicitly supplies a reference to each instance. This reference is called…

Answer 22

This

Question 23

Why does the pop operation from the stack class require no parameters

Answer 23

It takes the parameter of the value that was push

Question 24

Difference between checked and unchecked exceptions….

Answer 24

Unchecked:
References defects in the program
Errors in code
Subclass of runtime exception

Checked:
Invalid conditions in areas outside the immediate control of the program(user input, database problems)
Subclasses of Exception

Question 25

What does O(1) indicate?...

Answer 25

The time taken is constant and not based on the size of the input to the function

Question 26

T/F An iterator allows traversal in both directions

Answer 26

False

Question 27

T/F The equals method belongs to the comparable interface

Answer 27

True

Question 28

Unchecked exceptions are directly derived from which class?

Answer 28

Runtime exception

Question 29

Objects of the Java.lang.String type are________

Answer 29

Constant

Question 30

The natural ordering of a class is defined by which method?

Answer 30

CompareTo

Question 31

Which package does the Java Collections Framework reside in?

Answer 31

Java.util

Question 32

Which method is used to add an element to a queue

Answer 32

The enqueue method

Question 33

The binary search algorithm has a Big-O of .....

Answer 33

O(log N)

Question 34

Which interface is used to traverse a list in both directions....

Answer 34

Listiterator

Question 35

Fully qualified class name containing method toString() and equals()

Answer 35

Java.lang.object

Question 36

If equals method returns "true" compareTo method should return

Answer 36

A 0

Question 37

Programming to the interface

Answer 37

Use abstract methods and be able to set values and overwrite values later

Question 38

What is the Big-O of a search algorithm for an unordered list?...

Answer 38

O(N)?

Question 39

What class would you use when manufacturing a string in a method such as toString()?...

Answer 39

....

Question 40

What is the big-o for insertion

Answer 40

O(1)

Question 41

Natural ordering

Answer 41

Ordering provided by the comparable interface Implement comparable interface Override compareTo method

Question 42

Total ordering

Answer 42

Implement comparator minterface Use compare method