Thursday April 3
Huffman (a[n]) /*Array a[n] of structureseach structure includes members : character, key , left and right
/initialize the MIN-priority queue Q with characters from a[n] using frequ
Maximum Value contiguous subsequence (MVCS)
Problem: Given an array A[1.n] of numbers
output: the largest sum in a contiguous subsequence in A
31 -41 59 26 -53 58 97 -93 -23
find indices j,k such that (sum A[i] = max, from i=j to k)
CPS616: Lab 9 Floyd-Warshall algorithm to compute all shortest paths lengths
Read your lecture notes. Also, you can read Daniel Jimnez lecture at
Closure and All-Pairs/Shortest P
Definition: A tree is a connected acyclic graph
Definition: a spanning tree of a connected graph G = (V,E) is a subset
Sort the edges from smallest to biggest
For i 1 to n
For i1 to m
Computer Networks Lab Week 4
The Basic HTTP GET/response interaction
1. Is your browser running HTTP version 1.0 or 1.1? What version of HTTP is the server running?
Browser is running HTTP version 1.1.
Server is running HTTP version 1.1.
2. What languages