Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
1. What makes a program easy to modify?
2. Describe the order of magnitude of the following code section using Big(O) notation.
j = 1;
While (j < N)
{
j = j * 2);
}
3. What are the benefits we accrue by using a Java interface construct to formally specify the logical level of ADTs?
4. Suppose we have a linked list of Strings, as defined in the textbook, named presidents. Suppose it contains three nodes, with the first node holding "Adams", the second node "Washington", and the third node "Kennedy". What would be output by the following code:
LLStringNode temp = presidents;
while (temp != null)
temp = temp.getLink();
System.out.println(temp.getInfo());
5. Suppose a collection object is defined to hold elements of class Object, and you use it to store String objects. Describe what you must do when you retrieve an object from the collection and intend to use it as a String.
6. Show what is written by the following segment of code, given that item1, item2, and item3 are int variables, and stack is an object that fits our abstract description of a stack. Assume that you can store and retrieve variables of type int on stack.
item1 = 1;
item2 = 0;
item3 = 4;
stack.push(item2);
stack.push(item1);
stack.push(item1 + item3);
item2 = stack.top();
stack.push (item3*item3);
stack.push(3);
item1 = stack.top();
stack.pop();
System.out.println(item1 + " " + item2 + " " + item3);
while (!stack.isEmpty())
System.out.println(item1);
7. Explain the relationship between dynamic storage allocation and recursion.
8. Analyze the factorial method and answer the following questions:
int factorial (int n)
if (n > 0)
return (n * factorial (n - 1));
else
if (n == 0)
return 1;
a. What is the base case?
b. What is the general case?
c. What are the constraints on the argument values?
d. What does the method do?
9. What are the three interfaces we defined related to our Queue ADT?
10. Describe in general terms the approach we use to implement an unbounded queue based on an array.
11. What does it mean for a class's equals and compareTo methods to be "consistent"?
12. Questions a-e below refer to the following figure:
a. What are the ancestors of node J?
b. What are the descendants of node T?
c. What are the descendants of node B?
d. What is the order in which the nodes are visited by a preorder traversal?
e. What is the order in which the nodes are visited by a postorder traversal?
13. If a heap is used to implement a priority queue, what is the big O efficiency of the enqueue operation, assuming the size of the priority queue is N?
14. What would be the order of the following list after two iterations of the "inner" part of the Insertion Sort algorithm?
13 4 16 19 2 15 12 3 23 20
16. Programming Sorting Algorithms: For this section, use the Sorts.java test harness.
a. Describe an approach to modifying the Sorts.java program so that after calling a sorting method the program prints out the number of swaps needed by the sorting method.
b. Implement your approach.
c. Test your new program by running the selectionSort method. Your program should report 49 swaps.
d. Now, modify your program to also output the number of comparisons (compares) needed. You must include one or more statements to increment your counter within the sorting methods themselves. For each of the listed methods, make and test the changes needed, and list both the number of swaps and the number of compares needed by the Sorts program to sort an array of 50 random integers.
selectionSort swaps:____ compares:____
bubbleSort swaps:____ compares:____
shortBubble swaps:____ compares:____
insertionSort swaps:____ compares:____
Write a Java windowed application to do online quiz on general knowledge and the application also displays the quiz result.
Create GUI Interface in java programing with these function: Sort by last name and print all employees info, Sort by job title and print all employees info, Sort by weekly salary and print all employees info, search by job title and print that emp..
Build the Build the GUI layout of the game in java.
Write a JAVA program that would get the locations of all the POIs from the file and plot them on a map.
Develop a reliable transfer protocol over UDP. Focus on a Stop- and-Wait protocol.
Interface that contains a generic type. Create two classes that implement this interface.
In this project we will develop a Web server in two steps. In the end, you will have built a multi-threaded Web server that is capable of processing multiple simultaneous service requests in parallel.
Complete the recursive method match in the code below which will determine whether or not two strings match.
Implement AVL trees that allows both iterative traversal and recursive traversal.
This assignment contains a java project. Project evaluates the day of the week for New Year's Day.
This project is designed a game in java. you choose whether you'd like to write a wolf or a sheep agent. Then, you are assigned to either a "sheep" or a "wolf" team.
Write a recursive instance method
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd