Comp 210 MT2 Review

Front

What is the reason why utilizing getters & setters are preferred to making instance variables public?

Back

It allows for enforcement of formatting / validation when getting & setting data.

Front

When implementing an interface, to implement a specific method we should use this keyword:

Back

@Override

Front

Which of the following would be the proper class header for a Java class implementing a simulation of a collection of things that can be compared?
Options:
public class Simulation<T implements Comparable<T>>
public class Simulation implements Comparable
public class Simulation
public class Simulation<T>

Back

public class Simulation<T implements Comparable<T>>

Front

TRUE OR FALSE: Searching for an element in a doubly linked list has a better average time complexity than searching through a singly linked list.

Back

False

Front

Assume we have a doubly linked list, and a particular element to be deleted's pointer is on hand (but NOTHING else). How does the time complexity for this deletion compare to if this was a singly linked list?

Back

Doubly: o(1), If Singly: o(n)

Front

Assume elements are inserted into a BST in exactly the following order: 52, 23, 77, 65, 9. What would the resulting BST look like?

Back

Front

The best case time complexity of searching a BST is o( _ )

Back

1

Front

The average / worst time complexity of searching a BST is o ( _ ) (One letter)

Back

h

Front

Assuming there are n nodes in our balanced BST, we can say that o(h) is equivalent to saying o( ____ )

Back

logn

Front

TRUE OR FALSE: A perfectly balanced BST's worst case time complexity for a search is O(n)

Back

False