lecture 09 - Amrita

# lecture 09 - Amrita - Design Strategies Design Strategies...

This preview shows pages 1–18. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Design Strategies Design Strategies Branch & Bound Backtracking Dynamic Greedy Divide & Conquer Divide & Conquer : How to feed a mass of people ? Greedy : What to select from a collection of items ? Dynamic What options should I choose after 10 th class ? What should I do after +2 ? How should I proceed after B.Tech? Backtracking I shall proceed until I get a solution or I hit a dead end. Then I retrace , find an alternate way and follow the same strategy to proceed deep further. Branch & Bound I shall explore all possible options at every level Divide & Conquer : P Divide P 1 P 2 P n Solve Solve Solve Find Global Solution If P: Problem P P 1 P2 P3 P 21 P 22 P 23 P 221 P 222 P 2221 P 2222 P 31 P 32 What to solve? What to solve? Stop at when how to solve is known Then the algorithm is P P 2 P 3 P 1 P 2.1 P 2.2 P 2.3 P 3.1 P 3.2 P 1 P 2.1 P 2.3 P 3.1 P 3.2 P 1 P 2.2.1 P 2.2.2 P 2.2.2.1 P 2.2.2.2 P 1 P 2.1 P 2.3 P 3.1 P 3.2 P 2.2.1 This is strictly not called ‘DIVIDE & CONQUER’ This is not a Design Strategy This is a Design Methodology (Studied in Software Engineering) This is called Top-Down Design Methodology Then What is Divide & Conquer ? In Divide & Conquer it is not the ‘ PROBLEM ’ which is divided , it is the ‘ DATA SPACE ’ of the problem which is divided DATA Partition the data into different ‘groups’ satisfying certain homogeneity conditions Gr 1 Gr 2 Gr 3 Gr k Alg 1 Alg 2 Alg 3 Alg k Solve by ‘specialized’ algorithm suitable for each group One Specific Case Is it possible to get the groups of data in such a way that the same algorithm could be utilized to work on each group of data For Instance : Let us assume that there are two floors in a house Ground Floor First Floor Let us assume each floor has two wings Left Wing Right Wing Let us assume each wing has two rooms Room 1 Room 2 Let us assume each room has two working tables Table 1 Table 2 I have misplaced my ‘mobile’ somewhere?I have misplaced my ‘mobile’ somewhere?...
View Full Document

## This document was uploaded on 04/22/2010.

### Page1 / 107

lecture 09 - Amrita - Design Strategies Design Strategies...

This preview shows document pages 1 - 18. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online