Picture 1 of 1
Gallery
Picture 1 of 1
Have one to sell?
Algorithms by Dasgupta, Sanjoy paperback Book
US $28.85
ApproximatelyS$ 36.91
Condition:
Acceptable
A book with obvious wear. May have some damage to the cover but integrity still intact. The binding may be slightly damaged but integrity is still intact. Possible writing in margins, possible underlining and highlighting of text, but no missing pages or anything that would compromise the legibility or understanding of the text.
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
Free USPS Media MailTM.
Located in: San Diego, California, United States
Delivery:
Estimated between Sat, 12 Jul and Wed, 16 Jul to 94104
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Shop with confidence
Seller assumes all responsibility for this listing.
eBay item number:157127942767
All net proceeds will support Goodwill Industries of San Diego County
- Official eBay for Charity listing. Learn more
- This sale benefits a verified non-profit partner.
Item specifics
- Condition
- Book Title
- Algorithms
- ISBN
- 9780073523408
About this product
Product Identifiers
Publisher
Mcgraw-Hill Education
ISBN-10
0073523402
ISBN-13
9780073523408
eBay Product ID (ePID)
57031042
Product Key Features
Number of Pages
336 Pages
Language
English
Publication Name
Algorithms
Subject
Programming / Algorithms, Algebra / General
Publication Year
2006
Type
Textbook
Subject Area
Mathematics, Computers
Format
Perfect
Dimensions
Item Height
0.5 in
Item Weight
17.5 Oz
Item Length
9.2 in
Item Width
7.3 in
Additional Product Features
Intended Audience
College Audience
LCCN
2006-049014
Illustrated
Yes
Table Of Content
0 Prologue 1 Algorithms with Numbers 2 Divide-and-Conquer Algorithms 3 Decompositions of Graphs 4 Paths in Graphs 5 Greedy algorithms 6 Dynamic Programming 7 Linear Programming and Reductions 8 NP-complete Problems 9 Coping with NP-completeness 10 Quantum Algorithms
Synopsis
This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include: The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence. An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. In addition to the text, DasGupta also offers a Solutions Manual, which is available on the Online Learning Center. ""Algorithms" is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject. Like a captivating novel, it is a joy to read." Tim Roughgarden Stanford University, This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include: The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence. An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. In addition to the text, DasGupta also offers a Solutions Manual, which is available on the Online Learning Center. " Algorithms is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject. Like a captivating novel, it is a joy to read." Tim Roughgarden Stanford University, This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include:The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence. An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. In addition to the text, DasGupta also offers a Solutions Manual, which is available on the Online Learning Center. " Algorithms is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject. Like a captivating novel, it is a joy to read." Tim Roughgarden Stanford University
LC Classification Number
QA9.58.D37 2007
Item description from the seller
Popular categories from this store
Seller feedback (166,744)
- a***e (97)- Feedback left by buyer.Past monthVerified purchaseExcellent condition, fast shipping.
- a***a (3765)- Feedback left by buyer.Past monthVerified purchaseNice item better than I expected...thanks.
- l***d (338)- Feedback left by buyer.Past monthVerified purchaseThank you!
Popular categories from this store
Seller feedback (166,744)
- a***e (97)- Feedback left by buyer.Past monthVerified purchaseExcellent condition, fast shipping.
- a***a (3765)- Feedback left by buyer.Past monthVerified purchaseNice item better than I expected...thanks.
- l***d (338)- Feedback left by buyer.Past monthVerified purchaseThank you!