CSE 143: Computer Programming II, Summer 2012

Mar 3 2012 12:01 AM

Section 17: Sorting (Tue Aug 14)

Problems: Solve the following two (2) problem on paper (hand-written or printed) and bring your sheet of paper to your section:

1. Self-Check 13.12 (p818): How many calls on...
2. Self-Check 13.13 (p818): Consider the following array...

Mar 3 2012 12:01 AM

Section 16: Polymorphism (Thu Aug 9)

Problems: Solve the following one (1) problem on paper (hand-written or printed) and bring your sheet of paper to your section:

1. Self-Check 9.14 (p622): Suppose that the following variables referring to the classes from the previous problem are declared: ... Which of the following statements produce compiler errors? For the statements that do not produce errors, what is the output of each statement? (Answer for all five lines of code shown. You'll need to look at the Bay / Pond / Ocean / Lake classes declared on the previous page.)

Mar 3 2012 12:01 AM

Section 15: Advanced Lists (Tue Aug 7)

Problems: Solve the following one (1) problem on paper (hand-written or printed) and bring your sheet of paper to your section:

1. Self-Check 9.21 (p622): What's wrong with the code for the following interface? (Explain what is wrong in 1-2 sentences, then show the code for a corrected version of the interface.)

Feb 18 2012 12:01 AM

Section 14: Comparable (Thu August 2)

Problems: Solve the following two (2) problems on paper (hand-written or\ printed) and bring your sheet of paper to your section:

1. Self-Check 10.16 (p675): Indicate whether the result of each of th e following comparisons ... (solve all of (a) - (f). You do not need to show your work.)
2. Exercise 10.18 (p677): Modify the TimeSpan class from Chapter 8 .. . (You can use the following file as a template: TimeSpan.java)

Feb 25 2012 12:01 AM

Section 13: Binary Trees 2 (Tue July 31)

Problems: Solve the following two (2) problems on paper (hand-written or printed) and bring your sheet of paper to your section:

1. Self-Check 17.15 (p1027): Which of the following trees are valid binary search trees? (consider all of (a) - (e).)
2. Self-Check 17.17 (p1028): Draw the binary search tree that would result if the given elements were added to an empty binary search tree in the given order: Leia, Boba, ...

Feb 18 2012 12:01 AM

Section 12: Binary Trees (Thu July 26)

Problems: Solve the following two (2) problems on paper (hand-written or printed) and bring your sheet of paper to your section:

1. Self-Check 17.3 (p1025): How many levels... (solve all of (a) - (e)).
2. Self-Check 17.5 (p1026): Write the elements of the given tree in the order in which they would be seen by a pre-order, in-order, and post-order traversal.

Feb 11 2012 12:01 AM

Section 11: More Recursive Backtracking (Tue July 24)

There are no pre-section problems for Section 11. To get credit for the section points for this week, you will need to do the problems for Section 12. Sorry for the inconvenience.

July 16 2012 12:01 AM

Section 10: Recursive Backtracking (Thu Feb 19)

Problems: Solve the following one (1) problem on paper (hand-written or printed) and bring your sheet of paper to either one of the sections this week:

1. (not from textbook): Modify the permute code from slide 19 of Monday's lecture slides so that it outputs the permutations in the opposite order. That is, instead of permute("JANE") outputting JANE, JAEN, JNAE, ..., it should output ENAJ, ENJA, EANJ, ... Reverse the order by modifying the algorithm and the order in which it chooses various paths to explore, not by literally reversing strings as they are about to be printed. Use the code on slide 19 of Monday's lecture slides as a starting point.

Feb 4 2012 12:01 AM

Section 9: Sets, Maps and Recursive Backtracking (Tue July 17)

Problems: Solve the following two (2) problems on paper (hand-written or printed) and bring your sheet of paper to your section:

1. Self-Check 11.10 (p711): A List has every ... (A few sentences will suffice.)
2. Self-Check 11.20 (p713): What keys and values are contained ... (write the final contents of the map in the following format; the relative order of the keys doesn't matter. {key1=value1, key2=value2, ...}

July 10 2012 12:01 AM

Section 8: Recursive programming (Thu July 12)

Problems: Solve the following two (2) problems on paper (hand-written or printed) and bring your sheet of paper to your section:

1. Self-Check 12.14 (p767): The following method has a bug ... (Indicate the bug and explain why it causes the method to fail. Why does your change solve the problem?)
2. Exercise 12.12 (p767): For each of the following calls, indicate the value that is returned: (Solve only parts (a), (c), and (e). Show your work by writing out the series of calls that are made before writing the final output. For example, if mystery1(5) calls mystery1(4), write the sequence of such calls before your answer.

July 9 2012 12:01 AM

Section 7: Recursion (Tue July 10)

Problems: Solve the following one (1) problem on paper (hand-written or printed) and bring your sheet of paper to your section:

1. Self-Check 12.3 (p764): mystery1 method. For each of the following calls, indicate the output that is produced by the method: (Solve only parts (a), (b), (e) and (f)). Show your work by writing out the series of calls that are made before writing the final output. For example, if mystery1(5) calls mystery1(4), write the sequence of such calls before your answer.

July 2 2012 12:01 AM

Section 6: Linked lists (Thu July 5)

Problems: Solve the following two (2) problems on paper (hand-written or printed) and bring your sheet of paper to your section:

1. Self-Check 16.19 (p976): An element can be inserted at or removed from the beginning, middle, or ...
2. Exercise 16.1 (p977): Write a method called set that ... (You can base your solution on the get method we wrote in lecture on Wednesday. If you're having trouble, do the best that you can in < 30 minutes and turn in your best effort.)

July 2 2012 12:01 AM

Section 5: Linked nodes (Tue July 3)

Problems: Solve the following one (1) problem on paper (hand-written or printed) and bring your sheet of paper to your section:

1. Self-Check 16.6 (p975): Draw a picture of what the given linked nodes would look like after the given code executes.

   list.next = new LinkNode(3, list.next);

June 25 2012 12:01 AM

Section 4: Complexity and more stacks and queues (Thur June 27)

Problems: Solve the following one (1) problem on paper (hand-written or printed) and bring your sheet of paper to your section:

1. Self-Check 13.4 (p816): Approximate the runtimes of ... (all four parts)

June 25 2012 12:01 AM

Section 3: Stacks and queues (Tue June 26)

Problems: Solve the following three (3) problems on paper (hand-written or printed) and bring your sheet of paper to your section:

1. What is the point of using stacks and queues, when an ArrayList can already do all the things they do and more?
2. What is the difference between a stack and a queue? Why might we want to use one versus the other? Can you name a situation (real-world or programming) where you want one of these kinds of structures?
3. Describe, in English or in pseudo-code, the general idea of an algorithm to reverse the contents of a stack of integers, using only one stack or queue as auxiliary storage. For example, if the stack stores the values [10, 20, 30, 40] from top to bottom, how would you modify it to store [40, 30, 20, 10]?

Jan 7 2012 12:01 AM

Section 2: implementing ArrayIntList and binary search (Thur June 20)

Problems: Solve the following three (3) Self-Check problems on paper (hand-written or printed) and bring your sheet of paper to your section:

1. Self-Check 13.7 (p817): Why does the binary search ... (One sentence is fine.)
2. Self-Check 15.7 (p924): An element can be inserted at ...
3. Self-Check 15.8 (p924): Write methods called min and max that ... (Write just one of the two methods. Either one is fine. You don't need to write both.)

You don't need to write a complete program; just the relevant lines of code to answer the question.

Jan 2 2012 12:01 AM

Section 1: ArrayList (Tue June 19)

No problems are due for the first section.

Here are some optional Practice-It problems that would be useful review: arrayMystery, indexOf, findMin, numUnique, stretch, rotateRight, add.