Humanities, Social Science and Language


Digital Products


Connect®
Course management, reporting, and student learning tools backed by great support.

ALEKS®
Personalize learning and assessment

ALEKS® Placement, Preparation, and Learning
Achieve accurate math placement

SIMnet
Ignite mastery of MS Office and IT skills

McGraw-Hill eBook & ReadAnywhere App
Get learning that fits anytime, anywhere

Services


Inclusive Access
Reduce costs and increase success

LMS Integration
Log in and sync up

Math Placement
Achieve accurate math placement

Content Collections powered by Create®
Curate and deliver your ideal content

Custom Courseware Solutions
Teach your course your way

Professional Services
Collaborate to optimize outcomes

Lecture Capture
Capture lectures for anytime access

Remote Proctoring
Validate online exams even offsite

Institutional Solutions
Increase engagement, lower costs, and improve access for your students

Support


General Help & Support Info
Customer Service & Tech Support contact information

Online Technical Support Center
FAQs, articles, chat, email or phone support

Support At Every Step
Instructor tools, training and resources for ALEKS, Connect & SIMnet

Instructor Sample Requests
Get step by step instructions for requesting an evaluation, exam, or desk copy

Platform System Check
System status in real time

Algorithms https://www.mheducation.com/cover-images/Jpeg_400-high/0073523402.jpeg 1 2008 9780073523408 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
09780073523408
Algorithms

Algorithms, 1st Edition

ISBN10: 0073523402 | ISBN13: 9780073523408
By Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani
© 2008

Purchase Options:

* The estimated amount of time this product will be on the market is based on a number of factors, including faculty input to instructional design and the prior revision cycle and updates to academic research-which typically results in a revision cycle ranging from every two to four years for this product. Pricing subject to change at any time.

Purchase Options:

* The estimated amount of time this product will be on the market is based on a number of factors, including faculty input to instructional design and the prior revision cycle and updates to academic research-which typically results in a revision cycle ranging from every two to four years for this product. Pricing subject to change at any time.

Additional Product Information:

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

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

About the Author

Sanjoy Dasgupta

Christos Papadimitriou

Umesh Vazirani

Need support?   We're here to help - Get real-world support and resources every step of the way.