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

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.

John’s Week 9 Data Structures Homework

Queues:

1. In the contiguous storage implementation of a queue, is it possible to keep track of only the location of the front element (using a variable frontIndex) and the rear element (using a variable rearIndex), with no count variable…

Jess: Data Structures, Week 6

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

John’s Data Structures Week 10

Ruby Maps:

Jess: SW Arch, Week 8

Chapter 6: From Models to Patterns

This chapter went over patterns and how they represent knowledge and provide a way to convey what’s really going on in a given system. It went over Web 2.0 design patterns as a way to help understand what Web 2.0 really is.