Bit Wizardry. 1. the art of a binary wizard 10. a bit of sorcery 11. bit by bit, it looks like magic 100. a great ability in using bits. Who do we think we are?. We. Dhruv Matani (tall guy) Ashwin Jain (thin guy) Shilp Gupta (fat guy). We. Programmers

Download Presentation

Bit Wizardry

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

Why? • 2n is common • Tower of Hanoi • Dynamic Programming • Set cover

Why Tower of Hanoi? • 3n states • Optimal sequence contains • (2n - 1) moves • General case?

Why DP? • Weighted Matching • TSP • Domino Tiling • The list goes on..

Why Set Cover? • Statement • Given ‘n’ items, you are given the cost of covering, each subset of items. Which mutually exclusive subsets to select, such that the union selects all items and the total cost of cover is minimal among all covers.

Why 2n? • n-bits to mask them all,n-bits to find them,n-bits compress them alland in an array bind them