{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

midterm-sample-4

# midterm-sample-4 - CSE 143 Sample Midterm Exam#4(based on...

This preview shows pages 1–4. Sign up to view the full content.

CSE 143 Sample Midterm Exam #4 (based on Summer 2009's midterm; thanks to Alyssa Harding) 1. ArrayList Mystery . Consider the following method: public static void mystery4(ArrayList<Integer> list) { for (int i = list.size() - 2; i > 0; i--) { int a = list.get(i); int b = list.get(i + 1); list.set(i, a + b); } System.out.println(list); } Write the output produced by the method when passed each of the following ArrayList s: List Output (a) [72, 20] ____________________________________ (b) [1, 2, 3, 4, 5, 6] ____________________________________ (c) [10, 20, 30, 40] ____________________________________

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2. ArrayList Programming . Write a method removeShorterStrings that takes an ArrayList of strings as a parameter and that removes from each successive pair of values the shorter string in the pair. For example, suppose that an ArrayList called "list" contains the following values: ["four", "score", "and", "seven", "years", "ago"] In the first pair of strings ( "four" and "score" ) the shorter string is "four" . In the second pair of strings ( "and" and "seven" ) the shorter String is "and" . In the third pair of strings ( "years" and "ago" ) the shorter string is "ago" . Therefore, the call: removeShorterStrings(list); should remove these shorter strings, leaving the list with the following sequence of values after the method finishes executing: ["score", "seven", "years"] If there is a tie (both strings have the same length), your method should remove the first string in the pair. If there is an odd number of strings in the list, the final value should be kept in the list. For example, if the list contains the following values: ["to", "be", "or", "not", "to", "be", "hamlet"] After calling removeShorterStrings , it should contain the following: ["be", "not", "be", "hamlet"] You may not use any other arrays, lists, or other data structures to help you solve this problem, though you can create as many simple variables as you like. You may assume that the list passed is not null .
3. Stack and Queue Programming . Write a method called isSorted that takes a stack of integers and returns true if the stack is sorted and false otherwise. A stack is considered sorted when its integers are in non-decreasing order (i.e. increasing order with duplicates allowed) when read from bottom to top. So, a sorted stack has its smallest integer on the bottom and its largest integer on the top. A stack that contains fewer than two integers is sorted by definition. For example, suppose that a variable called s stores the following sequence of values: bottom [-12, 0, 1, 8, 8, 8] top then a call on isSorted(s) should return true . If s had instead contained the following values: bottom [-9, 10, 43, 24, 97] top then a call on isSorted(s) should return false , because 24 is less than 43.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 11

midterm-sample-4 - CSE 143 Sample Midterm Exam#4(based on...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online