CSCC73H3 Study Guide - Final Guide: Vertex Cover, Minimum Cut, Binary Tree

164 views10 pages
19 Oct 2011
School
Course

Document Summary

Aids allowed: one 8. 5 11 handwritten, non-photocopied cheat sheet". B: (10 marks) below is a full binary tree that represents an encoding of the symbols a, b, C, d, e, and f (shown as leaves of the tree), where each symbol appears with the frequency indicated below the leaf that corresponds to the symbol. Shown below if a ow graph, and a ow through its edges. The label f : c on an edge indicates that the capacity of the edge is c and the ow through the edge is f . a. Answer: (3 marks) find a minimum cut of the above ow graph. Dijkstra"s algorithm does not always work correctly if edges can have negative weights. Suppose you have access to a software package that performs e ciently basic linear algebra operations including matrix inversion and multiplication of a matrix by a vector. Let a[1n] be a sorted array of distinct integers.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers

Related Documents

Related Questions