Explore BrainMass
Share

java stack and heap

This content was STOLEN from BrainMass.com - View the original, and get the already-completed solution here!

I was given the following questions regarding stack and heap drawings. How are stack and heap drawings done? How would one go about these questions? I am posting the questions as reference, but I am requesting information about how to do these types of questions generally, not to have them done for me.

Stack and Heap Drawings:

1.
String s;
Fraction f, g;
Point w, x;
JFrame j;
f = new Fraction(25, 35);
g = f;
w = new Point(5, 10);

Draw a picture to illustrate what the stack and heap will look like.

2. String title = "Push Me"
JButton one = new JButton(title);
JButton two;
two = one;

Draw a picture to illustrate what the stack and heap will look like.

3. String y, z;
y = new String("This is easier than I thought!");
z = y.substring(11, 13);

Draw a picture of the stack and heap.

4. Consider the following code:
//Case 1
String word1 = "Easy";
String word2 = word1;
if (word1 == word2)
System.out.println("The words are the same");
else
System.out.println("The words are different");

This code will display "The words are the same" on the screen. However, if the code is written as:

// Case 2

String word1 = new String("Easy");
String word2 = new String("Easy");
if (word1 == word2)
System.out.println("The words are the same");
else
System.out.println("The words are different");

Most surprising however is that if you try the following code:

//Case 3

String word1 = "Easy";
String word2 = "Easy";
if (word1 == word2)
System.out.println("The words are the same");
else
System.out.println("The words are different");

This code will display "The words are the same" on the screen.

© BrainMass Inc. brainmass.com October 25, 2018, 9:38 am ad1c9bdddf
https://brainmass.com/computer-science/java/java-stack-heap-581021

Solution Summary

The expert examines a stack and heap drawings. How stack and heap drawings are done are given.

$2.19
See Also This Related BrainMass Solution

JAVA- Data Structures and Algorithms

1. Show the list configuration resulting from each series of list operations using the List ADT of Figure 4.1. Assume that lists L1 and L2 are empty at the beginning of each series. Show where the current position is in the list.

• L1.append(10);
• L1.append(20);
• L1.append(15);
• L2.append(10);
• L2.append(20);
• L2.append(15);
• L2.moveToStart();
• L2.insert(39);
• L2.next();
• L2.insert(12);

2. Show the steps of the following operations on a stack S of Integers graphically. Assume S is empty initially.

s.push(5);
s.push(3);
s.push(7);
s.pop();
s.push(8);
s.pop();
s.pop();
s.push(10);
s.pop();

3. Show graphically the resulting BST trees after inserting the following same set of numbers in different orders. To find the element 5, how many comparisons would you need for each tree structure? Which one needs the least number of comparisons and which one the most? What conclusion can you make about the searching on BST? Namely, when would the searching time for certain element be the best in the worst cases?

1) {9,6,5,4,7,3,8,1,2}
2) {1,2,3,4,5,6,7,8,9}
3) {9,8,7,6,5,4,3,2,1}
4) {5,9,4,8,3,7,2,6,1}

4. Given the following max heap H, show graphically the results of the following operations on H. Use the same following start state when you perform each operation. (Will put in attached document)

1) H.removeMax();
2) H.insert(15);
3) H.remove(4);

View Full Posting Details