Comp 210 MT2 Review

Choose all of the following which describe instances of abstraction.

Select all that apply.

• Looking at the raw binary data of a certain program.

• Only needing to know how to steer, brake, and accelerate to drive a car.

• Creating a String in Java.

• Using Windows to utilize a computer to surf the web.

Which of the following implementations & instantiations of a 'Dog' object adhere to encapsulation?

Select all that apply.

• 
• 
• 

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

• It simplifies the code & class complexity.

• It is more efficient in terms of computational efficiency.

• It allows you to utilize the "this" keyword, so that we return the instance values.

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

Assume this interface is written.

If we created a class: public class Human implements Organism,

which of the following must be implemented in human?

Select all that apply.

• eat()

• getAge()

• setAge()

• move()

• private int age;

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

Assume a development team is creating a Java class implementing a simulation of a collection of things. The team wants any future users of this class to use anything they want to store in the class, so long as one thing can be compared to another.

Which of the following would be the proper class header for this simulation?

• public class Simulation<T implements Comparable<T>>

• public class Simulation implements Comparable

• public class Simulation

• public class Simulation<T>

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.

• True

• False

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?

• Doubly: o(n)

  If Singly: o(n)

• Doubly: o(1)

  If Singly: o(1)

• Doubly: o(n)

  If Singly: o(1)

• Doubly: o(1)

  If Singly: o(n)

Assume elements are inserted into a BST in exactly the following order:

52, 23, 77, 65, 9

What would the resulting BST look like?

• 
• 
• 

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