Jess: Data Structures, Week 4

Chapter 3: Lists, Stacks, and Queues

3.1 You are given a list, L, and another list, P, containing integers sorted in ascending order. The operation printLots(L,P) will print the elements in L that are in positions specified by P. For instance, if P =…

Jess: Data Structures, Week 8

9.1 Find a topological ordering for the graph in Figure 9.81.
s, G, D, H, A, B, E, I, F, C, t

9.5
a. Find the shortest path from A to all other vertices for the graph in Figure 9.82.
A->B, A->C, A->B->G, A->B->E, A->C->D…

Week 7 Data Structures.

A stack can be used to ensure that an arithmetic expression has balanced parentheses. Write a function that takes an arithmetic expression as an argument and returns the position in the expression where a parenthesis is missing. An example of an arithmetic expression with unbalanced…

Jess: Data Structures, Week 10

7.1 Sort the sequence 3, 1, 4, 1, 5, 9, 2, 6, 5 using insertion sort.

7.4 Show the result of running Shellsort on the input 9, 8, 7, 6, 5, 4, 3, 2, 1 using the increments {1, 3, 7}.

Jess: Data Structures, Week 1

1.1 Write a program to solve the selection problem. Let k = N/2. Draw a table showing the running time of your program for various values of N.

Jess: Data Structures, Week 7

7.2 What is the running time of insertion sort if all elements are equal?O(n) is best case

7.10 Do either of the following modifications to the Shellsort routine coded in Figure 7.4 affect the worst-case running time?
a. Before line 11, subtract one…

Jess: Data Structures, Week 3

Finish the fizz buzz problem as a Java program. Given the list of numbers from 1 to 100, for each number,
if it is divisible by 3, print out “fizz”
if it is divisible by 5, print out “buzz”
if it is both divisible by 5 and 3, print out “fizz buzz”

Jess: Data Structures, Week 9

6.2 (b) Show the result of using the linear-time algorithm to build a binary heap using 10, 12, 1, 14, 6, 5, 8, 15, 3, 9, 7, 4, 11, 13, and 2.

Initial heap:

          10
         /   \
        /     \
       /       \
      /…

Dom Week 8 Data Structures

Modify the Queue class to create a Deque class. A deque is a queue-like structure that allows elements to be added and removed from both the front and the back of the list. Test your class in a program.

Jess: Data Structures, Week 5

Chapter 4: Trees

4.1 For the tree in Figure 4.70:
a. Which node is the root?
/usr is the root

b. Which nodes are leaves?
junk, junk, work,