This preview shows page 1. Sign up to view the full content.
Unformatted text preview: ven an m • n matrix M in which each entry is a 0 or 1. A solid block is a rectangular subset of M in which each entry is 1. Give a correct eﬃcent algorithm to ﬁnd a solid block in M with maximum area. 5 Find bottleneck edges [10 points] In a directed graph, given a start node and an end node, design an algorithm to ﬁnd the minimum number of edges that need to be removed so that the start node and end node are disconnected. 6 Find string in 2D pattern [10 points] Given a 2D array that contains letters, ﬁnd a string in the array. If the string is not in the pattern, report it. The successive letters in the string should be neighbors in the array. Here we deﬁne the neighbors as the letters having row diﬀerence of one or column diﬀerence of one. For example, CSBC is in the following 2D array: 1 ABCDE FGSBL HJQCY IRMOK 7 Walking upstairs [10 points] Design a polynomial complexity algorithm to compute the number of diﬀerent ways to climb up n‐step stairs if we can walk either one step or two steps each time. Analy...
View
Full
Document
This note was uploaded on 01/22/2014 for the course CS 383 taught by Professor Jiang during the Spring '11 term at BC.
 Spring '11
 Jiang
 Algorithms

Click to edit the document details