算法导论及课后习题与思考题答案(完整英文版第2版)

3星(超过75%的资源)
所需积分/C币:44 2013-03-25 11:00:47 1.66MB PDF
47
收藏 收藏
举报

算法导论的重点以及课后习题答案和思考题答案。是英文的
Contents Revision History R-1 Preface P-l Chapter 2: Getting Started Lecture notes 2- Solutions 2-16 Chapter 3: Growth of Functions Lecture notes 3-I Solutions 3-7 Chapter 4: Recurrences Lecture notes 4-1 Solutions 4-8 Chapter 5: Probabilistic Analysis and Randomized algorithms Lecture notes 5-1 Solutions 5-8 Chapter 6: Heapsort Lecture notes 6-7 Solutions 6-10 Chapter 7: Quicksort Lecture Notes 7- Solutions 7-9 Chapter 8: sorting in Linear Time ecture notes 8- Solutions 8-9 Chapter 2: Medians and Order statistics 9-1 Solutions 9-9 Chapter 11: Hash Tables Lecture notes //- Solutions 11-16 Chapter 12: Binary Search Trees Lecture notes 2-1 Solution 72-72 Chapter 13: Red-Black Trees Lecture notes 3-1 Solutions 3-13 Chapter 14: Augmenting Data Structures ecture Notes 4-I Solutions 14-9 Conten Chapter 15: Dynamic Programming Lecture notes 15-I Solutions 15-19 Chapter 16: Greedy Algorithms Lecture Notes 6- Solutions 10-9 Chapter 17: Amortized Analysi Lecture Notes // Soluti l7-14 Chapter 21: Data Structures for Disjoint Sets Lecture notes 21- Solutions 21-6 Chapter 22: Elementary Graph algorithms Lecture notes 22-7 Solutions 22-12 Chapter 23: Minimum Spanning Trees Lecture notes 23-1 Solutions 23-8 Chapter 24: Single-Source Shortest Paths Lecture notes 24-7 Solutions 24-13 Chapter 25: All-Pairs Shortest Paths Lecture notes 25-1 Solutions 25-8 Chapter 26: Maximum Flow Lecture notes 26-1 Solutions 26-15 Chapter 27: Sorting Networks Lecture notes 27-1 Solutions 27-8 Index- Revision History Revisions are listed by date rather than bcing numbered. Because this revision history is part of each revision, the affected chapters al ways include the front matter in addition to those listed below 18 January 2005. Corrected an crror in the transpose-symmetry properties Affected chapters: Chapter 3 2 April 2004. Added solutions to Exercises 5.4-6, 11.3-5, 12.4-1, 16.4-2 16.4-3,21.3-4,264-2,264-3,and26.4-6 and to problems12-3and17-4.Made minor changes in the solutions to Problems 11-2 and 17-2. Affected chapters Chapters 5, 11, 12, 16, 17, 21, and 26; index 7 January 2004. Corrected two minor typographical errors in the lecture notes for the expected height of a randomly built binary search tree. Affected chap ers: Chapter 12 23 July 2003. Updated the solution to Exercise 22.3-4(b)to adjust for a correc- tion in the text. Affected chapters: Chapter 22, index 23 June 2003. Added the link to the website for the clrscode package to the preface 2 June 2003. Added the solution to problem 24-6. Corrected solutions to ex- ercise 23 2-7 and Problem 26-4. Affected chapters: Chapters 23, 24, and 26 In 20 May 2003. Added solutions to Exercises 24.4-10 and 26. 1-7. Affected hapters: Chapters 24 and 26; index 2 May 2003. Added solutions to Exercises 21.4-4, 21. 4-5, 21.4-6, 22.1-6 and 22.3-4. Corrected a minor typographical error in the Chapter 22 notes on page 22-6. Affected chapters: Chapters 21 and 22; index 28 April 2003. Added the solution to Exercise 16.1-2, corrected an error in the first adjacency matrix example in the Chapter 22 notes, and made a minor change to the accounting method analysis for dynamic tables in the chapter 17 notes. Affected chapters: Chapters 16, 17, and 22; index 10 April 2003. Corrected an error in the solution to Exercise 1 1.3-3. Affected chapters: Chapter II 3 April 2003. Reversed the order of Exercises 14.2-3 and 14.3-3. Affected chapters: Chapter 13. index 2 April 2003. Corrected an error in the substitution method for recurrences on page 4-4. Affected chapters: Chapter 4 R-2 Revision History 31 March 2003. Corrected a minor typ ographical error in the Chapter 8 notes on page 8-3. Affected chapters: Chapter 8 14 January 2003. Changed the exposition of indicator random variables in the Chapter 5 notes to t for an err the text. Affected pages: 5-4 through 5-6.(The only content changes are on page 5-4; in pages 5-5 and 5-6 only pagination changes. Affected chapters: Chapter 5 14 January 2003. Corrected an error in the pseudocode for the solution to Ex- ercise 2.2-2 on page 2-16. Affected chapters: Chapter 2 7 October 2002. Corrected a typographical error in EUCLIDEAN-TSP on pag e 15-23. Affected chapters: Chapter 15 1 August 2002. Initial release Preface This document is an instructors manual to accompany Introduction to algorithms Second edition by Thomas h. Cormen Charles e. leiserson ronald L. rivest and Clifford Stein. It is intended for use in a course on algorithms. You might also find some of the material herein to be useful for a CS 2-style course in data structures Unlike the instructor's manual for the first edition of the text-which was organized around the undergraduate algorithms course taught by Charles Leiserson at MIt in Spring 1991-we have chosen to organize the manual for the second edition according to chapters of the text. That is, for most chapters we have provided a set of lecture notes and a set of exercise and problem solutions pertaining to the chapter. This organization allows you to decide how to best use the material in the manual in your own course We have not included lecture notes and solutions for every chapter, nor have we included solutions for every exercise and problem within the chapters that we have selected. We felt that Chapter 1 is too nontechnical to include here, and cha ter 10 consists of background material that often falls outside algorithms and data tructures courses. We have also omitted the chapters that are not covered in the courses that we teach: Chapters 18-20 and 28-35, as well as Appendices A-c, future editions of this manual may include some of these chapters There are two reasons that we have not included solutions to all exercises and problems in the selected chapters. First, writing up all these solutions would take a long time, and we felt it more important to release this manual in as timely a fashion as possible Second. if we were to include all solutions. this manual would be longer than the text itself We have numbered the pages in this manual using the format CC-PP, where Cc is a chapter number of the text and pp is the page number within that chapters lecture notes and solutions the pp numbers restart from 1 at the beginning of each chapter's lecture notes. We chose this form of page numbering so that if we add or change solutions to exercises and problems, the only pages whose numbering is affected are those for the solutions for that chapter. Moreover, if we add material for currently uncovered chapters, the numbers of the existing pages will remain unchanged The lecture note The lecture notes are based on three sources Preface Some are from the first-edition manual, and so they correspond to Charles leis ersons lectures in MIT's undergraduate algorithms course, 6.046 Some are from Tom Cormen's lectures in Dartmouth Colleges undergraduate algorithms course. CS 25 Some are written just for this manual You will find that the lecture notes are more informal than the text, as is appro- priate for a lecture situation. In some places, we have simplified the material for lecture presentation or cvcn omitted certain considerations. Some scctions of thc text-usually starred-are omitted from the lecture notes. (We have included lec- ture notes for one starred section: 12.4, on randomly built binary scarch trees which we cover in an optional Cs 25 lecture. In several places in the lecture notes, we have included"asides'' to the instruc tor. The asides are typeset in a slanted font and are enclosed in square brack- ets. [Here is an aside. Some of the asides suggest leaving certain material on the board, Since you will be coming back to it later. If you are projecting a presenta- tion rather than writing on a blackboard or whiteboard, you might want to mark slides containing this material so that you can easily come back to them later in the lecture We have chosen not to indicate how long it takes to cover material, as the time nec essary to cover a topic depends on the instructor, the students, the class schedule and other variables There are two differences in how we write pseudocode in the lecture notes and the Lines are not numbered in the lecture notes. we find them inconvenient to number when writing pseudocode on the board We avoid using the length attribute of an array. Instcad, we pass the array length as a parameter to the procedure. This change makes the pseudocode more concise, as well as matching better with the description of what it does We have also minimized the use of shading in figures within lecture notes, since drawing a figure with shading on a blackboard or whiteboard is difficult TThe solutions The solutions are based on the same sources as the lecture notes They are written a bit more formally than the lecture notes, though a bit less formally than the text We do not number lines of pseudocode, but we do use the length attribute (on the assumption that you will want your students to write pseudocode as it appears in the text) The index lists all the exercises and problems for which this manual provides solu tions, along with the number of the page on which cach solution starts Asides appear in a handful of places throughout the solutions. Also, we are less reluctant to use shading in figures within solutions, since these figures are more likely to be reproduced than to be drawn on a board Pr reface P-3 Source files For several reasons, we are unable to publish or transmit source files for this man- ual. We apologize for this inconvenience In June 2003, we made available a clrscode package for ETEX 28. It enables you to typeset pseudocode in the same way that we do. You can find this package athttp://www.cs.dartmouth.edu/thc/clrscode/.Thatsitealso includes documentation reporting errors and suggestions Undoubtedly, instructors will find errors in this manual. Please report errors by sendingemailtoclrs-manual-bugs@mhhe.com If you have a suggestion for an improvement to this manual, please feel free to submit it via email to clrs-manual-suggestionsamhhe com As usual, if you find an error in the text itself, please verify that it has not already been posted on the errata web page before you submit it. You can use the Mit Presswebsiteforthetexthttp://mitpress.mitedu/algorithms/,to locate the errata web page and to submit an error report We thank you in advance for your assistance in correcting errors in both this manual nd the text Acknowledgments This manual borrows heavily from the first-edition manual, which was written b Julie Sussman, PP A. Julie did such a superb job on the first-edition manual, find ing numerous errors in the first-edition text in the process, that we were thrilled to have her serve as technical copyeditor for the second-edition text. Charles Leiser son also put in large amounts of time working with Julie on the first-edition manual The other three Introduction to Algorithms authors-Charles Leiserson, Ron Rivest, and Cliff Stein-provided helpful comments and suggestions for solutions to exercises and problems. Some of the solutions are modifications of those written over the years by teaching assistants for algorithms courses at MIt and Dartmouth. At this point, we do not know which TAs wrote which solutions, and so we simply thank them collectively We also thank McGraw-Hill and our editors, Betsy Jones and Melinda dougharty for moral and financial support. Thanks also to our mit press editor, bob prior and to David Jones of The MIT Press for help with TEX macros. Wayne Cripps John Konkle, and Tim Tregubov provided computer support at Dartmouth, and the MIT sysadmins were Greg Shomo and Matt McKinnon. Phillip meek of McGraw Hill helped us hook this manual into their web site THOMAS H. CORMEN CLARA LEE ERICA LIN Hanover, New Hampshire y2002

...展开详情
试读 127P 算法导论及课后习题与思考题答案(完整英文版第2版)
立即下载 身份认证后 购VIP低至7折
一个资源只可评论一次,评论内容不能少于5个字
miracle3310 不完整,就是部分答案。到26章就结束了,而且26章之前的答案也不全。与这位好人:xinxin0998上传的内容是一模一样的,xinxin0998还不要积分!积分不多的人可以去搜索这个人,然后下载。
2013-12-07
回复
lc976803048 确实是完整版的算法导论课后习题解答。谢谢楼主的分享,万分感谢
2013-11-04
回复
ghostintheshell 感謝分享,東西很好很豐富。
2013-04-02
回复
您会向同学/朋友/同事推荐我们的CSDN下载吗?
谢谢参与!您的真实评价是我们改进的动力~
关注 私信
上传资源赚钱or赚积分
最新推荐
算法导论及课后习题与思考题答案(完整英文版第2版) 44积分/C币 立即下载
1/127
算法导论及课后习题与思考题答案(完整英文版第2版)第1页
算法导论及课后习题与思考题答案(完整英文版第2版)第2页
算法导论及课后习题与思考题答案(完整英文版第2版)第3页
算法导论及课后习题与思考题答案(完整英文版第2版)第4页
算法导论及课后习题与思考题答案(完整英文版第2版)第5页
算法导论及课后习题与思考题答案(完整英文版第2版)第6页
算法导论及课后习题与思考题答案(完整英文版第2版)第7页
算法导论及课后习题与思考题答案(完整英文版第2版)第8页
算法导论及课后习题与思考题答案(完整英文版第2版)第9页
算法导论及课后习题与思考题答案(完整英文版第2版)第10页
算法导论及课后习题与思考题答案(完整英文版第2版)第11页
算法导论及课后习题与思考题答案(完整英文版第2版)第12页
算法导论及课后习题与思考题答案(完整英文版第2版)第13页
算法导论及课后习题与思考题答案(完整英文版第2版)第14页
算法导论及课后习题与思考题答案(完整英文版第2版)第15页
算法导论及课后习题与思考题答案(完整英文版第2版)第16页
算法导论及课后习题与思考题答案(完整英文版第2版)第17页
算法导论及课后习题与思考题答案(完整英文版第2版)第18页
算法导论及课后习题与思考题答案(完整英文版第2版)第19页
算法导论及课后习题与思考题答案(完整英文版第2版)第20页

试读结束, 可继续阅读

44积分/C币 立即下载