CS 605.202

Assignment 2 – Stacks Write pseudo-code not Java for problems requiring code. You are responsible for the appropriate level of detail. 1. a) Use the operations push, pop, peek and empty to construct an operation which sets i to the second element from the top of the stack, leaving the stack unchanged. h = pop (s); i = pop (s); push (s, i); push (s, h); b) Use the operations push, pop, peek and empty to construct an operation which sets i to the nth element from the top of the sta...

Homework Assignment 1 - Complexity and ADTs Q1 - Q4 are related to the ADT material. In the lecture, we talked about "outside the black box" and "inside the black box". The related discussion question will give you some practice with working "outside the black box". The assignment is intended to help you think about "inside the black box", by having you look at alternative representations. In Q1, you look at an alternative to binary. In Q2, you look at an where stuff might be stored...

Assignment 3 – Recursion Write pseudo-code not Java for problems requiring code. You are responsible for the appropriate level of detail. Q1 and Q2 are intended to help you get comfortable with recursion by thinking about something familiar in a recursive manner. Q3 – Q6 are practice in working with nontrivial recursive functions. Q7 and Q8 deal with the idea of conversion between iteration and recursion. 1. Write a recursive algorithm to compute a+b, where a and b are nonnegative inte...