Category Archives: Computer Science

Suggest a modification of the binary search algorithm that emulates this strategy for a list of names.

1. Suppose that a list contains the values

20 44 48 55 62 66 74 88 93 99

at index positions 0 through 9. Trace the values of the variables left, right, and midpoint in a binary search of this list for the target value 90. Repeat for the target value 44.

2. The method we usually use to look up an entry in a phone book is not exactly the same as a binary search because, when using a phone book, we don’t always go to the midpoint of the sublist being searched. Instead, we estimate the position of the target based on the alphabetical position of the first letter of the person’s last name. For example, when we are looking up a number for “Smith,” we….

Explain why insertion sort works well on partially sorted lists.

1. Which configuration of data in a list causes the smallest number of exchanges in a selection sort? Which configuration of data causes the largest number of exchanges?

2. Explain the role that the number of data exchanges plays in the analysis of selection sort and bubble sort. What role, if any, does the size of the data objects play?

3. Explain why the modified bubble sort still exhibits O(n2) behavior on the average.

4. Explain why insertion sort works well on partially sorted lists.

Draw a class diagram that shows the relationships among the classes in this new version of the system

Jack decides to rework the banking system, which already includes the classes BankView, Bank, SavingsAccount, and RestrictedSavingsAccount. He wants to add another class for checking accounts. He sees that savings accounts and checking accounts both have some common attributes and behaviors that they can inherit from a superclass named Account. The bank contains zero or more instances of each of the three types of accounts. Draw a class diagram that shows the relationships among the classes in this new version of the system

Explain why insertion sort works well on partially sorted lists.

1. Which configuration of data in a list causes the smallest number of exchanges in a selection sort? Which configuration of data causes the largest number of exchanges?

2. Explain the role that the number of data exchanges plays in the analysis of selection sort and bubble sort. What role, if any, does the size of the data objects play?

3. Explain why the modified bubble sort still exhibits O(n2) behavior on the average.

4. Explain why insertion sort works well on partially sorted lists.

Explain the difference between black-box testing and white-box testing.

1 Explain the difference between black-box testing and white-box testing.

2 List three advantages of a unit test tool.

3 What is the purpose of the method setup in a unit test?

4 UML class diagrams show

a the interactions among objects

b the relationships among classes

5 Aggregation is a relationship in which

a an instance of one class can contain instances of another

b one class inherits data and operations from another