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 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 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
         /   \
        /     \
       /       \
      /…

Jess: Blog Post, Week 8

This week I continued working on blog posts and also started working through the Android UI Tutorial online. In this tutorial, I would create a Linear Layout in XML and add a button and text field.