Introduction to The Design and Analysis of Algorithms

{"title":"Introduction to The Design and Analysis of Algorithms","price":"۷","ebook_price":"۷","rent_3_price":"۶","rent_6_price":"۲","rent_12_price":"-۱","print_price":"-۱","front_cover":{"thumbnail":"/storage/files/styles/thumbnail/books/4a8b03583f119702/front.jpg","medium":"/storage/files/styles/medium/books/4a8b03583f119702/front.jpg","medium_rounded":"/storage/files/styles/medium_rounded/books/4a8b03583f119702/front.png","large":"/storage/files/styles/large/books/4a8b03583f119702/front.jpg","medium_trans":"/storage/files/styles/medium_trans/books/4a8b03583f119702/front.png","medium_zoom_fit":"/storage/files/styles/medium_zoom_fit/books/4a8b03583f119702/front.png"},"back_cover":{"thumbnail":"/storage/files/styles/thumbnail/books/4a8b03583f119702/back.jpg","medium":"/storage/files/styles/medium/books/4a8b03583f119702/back.jpg","medium_rounded":"/storage/files/styles/medium_rounded/books/4a8b03583f119702/back.png","large":"/storage/files/styles/large/books/4a8b03583f119702/back.jpg","medium_trans":"/storage/files/styles/medium_trans/books/4a8b03583f119702/back.png","medium_zoom_fit":"/storage/files/styles/medium_zoom_fit/books/4a8b03583f119702/back.png"},"print_book":false,"isbn":"9780132316811","lang":"null","cover_type":"null","dimension":"null","year":"۲۰۱۱","nobat_chap":1,"description":["Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a truly innovative manner. Written in a reader-friendly style, the book encourages broad problem-solving skills while thoroughly covering the material required for introductory algorithms. The author emphasizes conceptual understanding before the introduction of the formal treatment of each technique. Popular puzzles are used to motivate readers' interest and strengthen their skills in algorithmic problem solving. Other enhancement features include chapter summaries, hints to the exercises, and a solution manual. For those interested in learning more about algorithms."],"pages_count":592,"token":"4a8b03583f119702","deleted_at":null,"published_at":"2017-12-12 14:32:47","available_for_web":true,"publisher_title":"Pearson","edition":null,"currency":"EUR","subtitle":"null","country":"null","rent_1_week_price":"-۱","meta_desc":null,"meta_title":null,"stock":0,"cache":1,"bookmark":"false","has_book":"false","has_file":"true","writer_authors":[{"id":1055,"title":"Anany Levitin","meta_title":"Anany Levitin","meta_description":"Anany Levitin - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"firstname":"Anany","lastname":"Levitin","token":"ac5211b9343c3ed5","national_code":null,"pivot":{"book_id":573,"author_id":1055,"created_at":"2017-12-09 19:25:09","updated_at":"2019-03-12 15:13:25","role":"writer"},"titleLink":"Anany-Levitin"}],"translator_authors":[],"available_e_book":true,"dir":true,"vitrines":[{"title":"کتاب‌های مشابه","url":"/api/bookstore/vitrines/similar-books/4a8b03583f119702","type":"books","books":[]},{"title":"کتاب‌های دیگر ناشر","url":"/api/bookstore/vitrines/publisher-books/4a8b03583f119702","type":"books","books":[]}],"authors":[{"id":1055,"title":"Anany Levitin","meta_title":"Anany Levitin","meta_description":"Anany Levitin - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"firstname":"Anany","lastname":"Levitin","token":"ac5211b9343c3ed5","national_code":null,"pivot":{"book_id":573,"author_id":1055,"created_at":"2017-12-09 19:25:09","updated_at":"2019-03-12 15:13:25","role":"writer"}}],"e_book":{"toc":[{"page":2,"title":"Copyright Page"},{"page":3,"title":"Title Page"},{"page":5,"title":"Brief Contents"},{"page":7,"title":"Contents"},{"page":17,"title":"New to the Third Edition"},{"page":19,"title":"Preface"},{"page":24,"title":"Acknowledgments"},{"page":27,"title":"1 Introduction","children":[{"page":29,"title":"1.1 What Is an Algorithm?","children":[{"page":33,"title":"Exercises 1.1"}]},{"page":35,"title":"1.2 Fundamentals of Algorithmic Problem Solving","children":[{"page":35,"title":"Understanding the Problem"},{"page":35,"title":"Ascertaining the Capabilities of the Computational Device"},{"page":37,"title":"Choosing between Exact and Approximate Problem Solving"},{"page":37,"title":"Algorithm Design Techniques"},{"page":38,"title":"Designing an Algorithm and Data Structures"},{"page":38,"title":"Methods of Specifying an Algorithm"},{"page":39,"title":"Proving an Algorithm’s Correctness"},{"page":40,"title":"Analyzing an Algorithm"},{"page":41,"title":"Coding an Algorithm"},{"page":43,"title":"Exercises 1.2"}]},{"page":44,"title":"1.3 Important Problem Types","children":[{"page":45,"title":"Sorting"},{"page":46,"title":"Searching"},{"page":46,"title":"String Processing"},{"page":47,"title":"Graph Problems"},{"page":47,"title":"Combinatorial Problems"},{"page":48,"title":"Geometric Problems"},{"page":48,"title":"Numerical Problems"},{"page":49,"title":"Exercises 1.3"}]},{"page":51,"title":"1.4 Fundamental Data Structures","children":[{"page":51,"title":"Linear Data Structures"},{"page":54,"title":"Graphs"},{"page":57,"title":"Trees"},{"page":61,"title":"Sets and Dictionaries"},{"page":63,"title":"Exercises 1.4"},{"page":64,"title":"Summary"}]}]},{"page":67,"title":"2 Fundamentals of the Analysis of Algorithm Efficiency","children":[{"page":68,"title":"2.1 The Analysis Framework","children":[{"page":69,"title":"Measuring an Input’s Size"},{"page":70,"title":"Units for Measuring Running Time"},{"page":71,"title":"Orders of Growth"},{"page":73,"title":"Worst-Case, Best-Case, and Average-Case Efficiencies"},{"page":76,"title":"Recapitulation of the Analysis Framework"},{"page":76,"title":"Exercises 2.1"}]},{"page":78,"title":"2.2 Asymptotic Notations and Basic Efficiency Classes","children":[{"page":78,"title":"Informal Introduction"},{"page":79,"title":"O-notation"},{"page":80,"title":"Ω-notation"},{"page":81,"title":"Θ-notation"},{"page":81,"title":"Useful Property Involving the Asymptotic Notations"},{"page":82,"title":"Using Limits for Comparing Orders of Growth"},{"page":84,"title":"Basic Efficiency Classes"},{"page":84,"title":"Exercises 2.2"}]},{"page":87,"title":"2.3 Mathematical Analysis of Nonrecursive Algorithms","children":[{"page":93,"title":"Exercises 2.3"}]},{"page":96,"title":"2.4 Mathematical Analysis of Recursive Algorithms","children":[{"page":102,"title":"Exercises 2.4"}]},{"page":106,"title":"2.5 Example: Computing the nth Fibonacci Number","children":[{"page":109,"title":"Exercises 2.5"}]},{"page":110,"title":"2.6 Empirical Analysis of Algorithms","children":[{"page":115,"title":"Exercises 2.6"}]},{"page":117,"title":"2.7 Algorithm Visualization","children":[{"page":120,"title":"Summary"}]}]},{"page":123,"title":"3 Brute Force and Exhaustive Search","children":[{"page":124,"title":"3.1 Selection Sort and Bubble Sort","children":[{"page":124,"title":"Selection Sort"},{"page":126,"title":"Bubble Sort"},{"page":128,"title":"Exercises 3.1"}]},{"page":130,"title":"3.2 Sequential Search and Brute-Force String Matching","children":[{"page":130,"title":"Sequential Search"},{"page":131,"title":"Brute-Force String Matching"},{"page":132,"title":"Exercises 3.2"}]},{"page":134,"title":"3.3 Closest-Pair and Convex-Hull Problems by Brute Force","children":[{"page":134,"title":"Closest-Pair Problem"},{"page":135,"title":"Convex-Hull Problem"},{"page":139,"title":"Exercises 3.3"}]},{"page":141,"title":"3.4 Exhaustive Search","children":[{"page":142,"title":"Traveling Salesman Problem"},{"page":142,"title":"Knapsack Problem"},{"page":145,"title":"Assignment Problem"},{"page":146,"title":"Exercises 3.4"}]},{"page":148,"title":"3.5 Depth-First Search and Breadth-First Search","children":[{"page":148,"title":"Depth-First Search"},{"page":151,"title":"Breadth-First Search"},{"page":154,"title":"Exercises 3.5"},{"page":156,"title":"Summary"}]}]},{"page":157,"title":"4 Decrease-and-Conquer","children":[{"page":160,"title":"4.1 Insertion Sort","children":[{"page":162,"title":"Exercises 4.1"}]},{"page":164,"title":"4.2 Topological Sorting","children":[{"page":168,"title":"Exercises 4.2"}]},{"page":170,"title":"4.3 Algorithms for Generating Combinatorial Objects","children":[{"page":170,"title":"Generating Permutations"},{"page":172,"title":"Generating Subsets"},{"page":174,"title":"Exercises 4.3"}]},{"page":176,"title":"4.4 Decrease-by-a-Constant-Factor Algorithms","children":[{"page":176,"title":"Binary Search"},{"page":178,"title":"Fake-Coin Problem"},{"page":179,"title":"Russian Peasant Multiplication"},{"page":180,"title":"Josephus Problem"},{"page":182,"title":"Exercises 4.4"}]},{"page":183,"title":"4.5 Variable-Size-Decrease Algorithms","children":[{"page":184,"title":"Computing a Median and the Selection Problem"},{"page":187,"title":"Interpolation Search"},{"page":189,"title":"Searching and Insertion in a Binary Search Tree"},{"page":190,"title":"The Game of Nim"},{"page":192,"title":"Exercises 4.5"},{"page":193,"title":"Summary"}]}]},{"page":195,"title":"5 Divide-and-Conquer","children":[{"page":198,"title":"5.1 Mergesort","children":[{"page":200,"title":"Exercises 5.1"}]},{"page":202,"title":"5.2 Quicksort","children":[{"page":207,"title":"Exercises 5.2"}]},{"page":208,"title":"5.3 Binary Tree Traversals and Related Properties","children":[{"page":211,"title":"Exercises 5.3"}]},{"page":212,"title":"5.4 Multiplication of Large Integers and Strassen’s Matrix Multiplication","children":[{"page":213,"title":"Multiplication of Large Integers"},{"page":215,"title":"Strassen’s Matrix Multiplication"},{"page":217,"title":"Exercises 5.4"}]},{"page":218,"title":"5.5 The Closest-Pair and Convex-Hull Problems by Divide-and-Conquer","children":[{"page":218,"title":"The Closest-Pair Problem"},{"page":221,"title":"Convex-Hull Problem"},{"page":223,"title":"Exercises 5.5"},{"page":224,"title":"Summary"}]}]},{"page":227,"title":"6 Transform-and-Conquer","children":[{"page":228,"title":"6.1 Presorting","children":[{"page":231,"title":"Exercises 6.1"}]},{"page":234,"title":"6.2 Gaussian Elimination","children":[{"page":238,"title":"LU Decomposition"},{"page":240,"title":"Computing a Matrix Inverse"},{"page":241,"title":"Computing a Determinant"},{"page":242,"title":"Exercises 6.2"}]},{"page":244,"title":"6.3 Balanced Search Trees","children":[{"page":244,"title":"AVL Trees"},{"page":249,"title":"2-3 Trees"},{"page":251,"title":"Exercises 6.3"}]},{"page":252,"title":"6.4 Heaps and Heapsort","children":[{"page":253,"title":"Notion of the Heap"},{"page":257,"title":"Heapsort"},{"page":259,"title":"Exercises 6.4"}]},{"page":260,"title":"6.5 Horner’s Rule and Binary Exponentiation","children":[{"page":260,"title":"Horner’s Rule"},{"page":262,"title":"Binary Exponentiation"},{"page":265,"title":"Exercises 6.5"}]},{"page":266,"title":"6.6 Problem Reduction","children":[{"page":267,"title":"Computing the Least Common Multiple"},{"page":268,"title":"Counting Paths in a Graph"},{"page":269,"title":"Reduction of Optimization Problems"},{"page":270,"title":"Linear Programming"},{"page":272,"title":"Reduction to Graph Problems"},{"page":274,"title":"Exercises 6.6"},{"page":276,"title":"Summary"}]}]},{"page":279,"title":"7 Space and Time Trade-Offs","children":[{"page":280,"title":"7.1 Sorting by Counting","children":[{"page":283,"title":"Exercises 7.1"}]},{"page":284,"title":"7.2 Input Enhancement in String Matching","children":[{"page":285,"title":"Horspool’s Algorithm"},{"page":289,"title":"Boyer-Moore Algorithm"},{"page":293,"title":"Exercises 7.2"}]},{"page":295,"title":"7.3 Hashing","children":[{"page":296,"title":"Open Hashing (Separate Chaining)"},{"page":298,"title":"Closed Hashing (Open Addressing)"},{"page":300,"title":"Exercises 7.3"}]},{"page":302,"title":"7.4 B-Trees","children":[{"page":305,"title":"Exercises 7.4"},{"page":306,"title":"Summary"}]}]},{"page":309,"title":"8 Dynamic Programming","children":[{"page":311,"title":"8.1 Three Basic Examples","children":[{"page":316,"title":"Exercises 8.1"}]},{"page":318,"title":"8.2 The Knapsack Problem and Memory Functions","children":[{"page":320,"title":"Memory Functions"},{"page":322,"title":"Exercises 8.2"}]},{"page":323,"title":"8.3 Optimal Binary Search Trees","children":[{"page":329,"title":"Exercises 8.3"}]},{"page":330,"title":"8.4 Warshall’s and Floyd’s Algorithms","children":[{"page":330,"title":"Warshall’s Algorithm"},{"page":334,"title":"Floyd’s Algorithm for the All-Pairs Shortest-Paths Problem"},{"page":337,"title":"Exercises 8.4"},{"page":338,"title":"Summary"}]}]},{"page":341,"title":"9 Greedy Technique","children":[{"page":344,"title":"9.1 Prim’s Algorithm","children":[{"page":348,"title":"Exercises 9.1"}]},{"page":351,"title":"9.2 Kruskal’s Algorithm","children":[{"page":353,"title":"Disjoint Subsets and Union-Find Algorithms"},{"page":357,"title":"Exercises 9.2"}]},{"page":359,"title":"9.3 Dijkstra’s Algorithm","children":[{"page":363,"title":"Exercises 9.3"}]},{"page":364,"title":"9.4 Huffman Trees and Codes","children":[{"page":368,"title":"Exercises 9.4"},{"page":370,"title":"Summary"}]}]},{"page":371,"title":"10 Iterative Improvement","children":[{"page":372,"title":"10.1 The Simplex Method","children":[{"page":373,"title":"Geometric Interpretation of Linear Programming"},{"page":377,"title":"An Outline of the Simplex Method"},{"page":383,"title":"Further Notes on the Simplex Method"},{"page":385,"title":"Exercises 10.1"}]},{"page":387,"title":"10.2 The Maximum-Flow Problem","children":[{"page":397,"title":"Exercises 10.2"}]},{"page":398,"title":"10.3 Maximum Matching in Bipartite Graphs","children":[{"page":404,"title":"Exercises 10.3"}]},{"page":406,"title":"10.4 The Stable Marriage Problem","children":[{"page":409,"title":"Exercises 10.4"},{"page":410,"title":"Summary"}]}]},{"page":413,"title":"11 Limitations of Algorithm Power","children":[{"page":414,"title":"11.1 Lower-Bound Arguments","children":[{"page":415,"title":"Trivial Lower Bounds"},{"page":416,"title":"Information-Theoretic Arguments"},{"page":416,"title":"Adversary Arguments"},{"page":417,"title":"Problem Reduction"},{"page":419,"title":"Exercises 11.1"}]},{"page":420,"title":"11.2 Decision Trees","children":[{"page":421,"title":"Decision Trees for Sorting"},{"page":423,"title":"Decision Trees for Searching a Sorted Array"},{"page":425,"title":"Exercises 11.2"}]},{"page":427,"title":"11.3 P, NP, and NP-Complete Problems","children":[{"page":428,"title":"P and NP Problems"},{"page":432,"title":"NP-Complete Problems"},{"page":435,"title":"Exercises 11.3"}]},{"page":438,"title":"11.4 Challenges of Numerical Algorithms","children":[{"page":445,"title":"Exercises 11.4"},{"page":446,"title":"Summary"}]}]},{"page":449,"title":"12 Coping with the Limitations of Algorithm Power","children":[{"page":450,"title":"12.1 Backtracking","children":[{"page":451,"title":"n-Queens Problem"},{"page":452,"title":"Hamiltonian Circuit Problem"},{"page":453,"title":"Subset-Sum Problem"},{"page":454,"title":"General Remarks"},{"page":456,"title":"Exercises 12.1"}]},{"page":458,"title":"12.2 Branch-and-Bound","children":[{"page":459,"title":"Assignment Problem"},{"page":462,"title":"Knapsack Problem"},{"page":464,"title":"Traveling Salesman Problem"},{"page":466,"title":"Exercises 12.2"}]},{"page":467,"title":"12.3 Approximation Algorithms for NP-Hard Problems","children":[{"page":469,"title":"Approximation Algorithms for the Traveling Salesman Problem"},{"page":479,"title":"Approximation Algorithms for the Knapsack Problem"},{"page":483,"title":"Exercises 12.3"}]},{"page":485,"title":"12.4 Algorithms for Solving Nonlinear Equations","children":[{"page":486,"title":"Bisection Method"},{"page":490,"title":"Method of False Position"},{"page":490,"title":"Newton’s Method"},{"page":493,"title":"Exercises 12.4"},{"page":494,"title":"Summary"}]}]},{"page":497,"title":"Epilogue"},{"page":501,"title":"APPENDIX A: Useful Formulas for the Analysis of Algorithms","children":[{"page":501,"title":"Properties of Logarithms"},{"page":501,"title":"Combinatorics"},{"page":502,"title":"Important Summation Formulas"},{"page":502,"title":"Sum Manipulation Rules"},{"page":503,"title":"Approximation of a Sum by a Definite Integral"},{"page":503,"title":"Floor and Ceiling Formulas"},{"page":503,"title":"Miscellaneous"}]},{"page":505,"title":"APPENDIX B: Short Tutorial on Recurrence Relations","children":[{"page":505,"title":"Sequences and Recurrence Relations"},{"page":506,"title":"Methods for Solving Recurrence Relations"},{"page":511,"title":"Common Recurrence Types in Algorithm Analysis"}]},{"page":519,"title":"References"},{"page":529,"title":"Hints to Exercises"},{"page":573,"title":"Index","children":[{"page":573,"title":"A"},{"page":574,"title":"B"},{"page":576,"title":"C"},{"page":577,"title":"D"},{"page":578,"title":"E"},{"page":579,"title":"F"},{"page":580,"title":"G"},{"page":581,"title":"H"},{"page":581,"title":"I"},{"page":582,"title":"J"},{"page":582,"title":"K"},{"page":582,"title":"L"},{"page":584,"title":"M"},{"page":585,"title":"N"},{"page":585,"title":"O"},{"page":585,"title":"P"},{"page":588,"title":"Q"},{"page":588,"title":"R"},{"page":588,"title":"S"},{"page":590,"title":"T"},{"page":590,"title":"U"},{"page":591,"title":"V"},{"page":591,"title":"W"}]}],"pages_count":592,"version":"6.15.2","dir":"ltr","state":"converting","token":"4a8b03583f119702","status":"SUCCEED","pages_count_fa":"۵۹۲"},"publisher":{"id":105,"title":"Pearson","description":null,"logo":null,"token":"4e9e4a99eea1a798","slug":"Pearson"},"tags":[{"title":"algorithms","token":"cd7cf7ad54e27c11","pivot":{"taggable_id":573,"tag_id":2731}},{"title":"طراحی الگوریتم","token":"2cce625e6845ad2d","pivot":{"taggable_id":573,"tag_id":2732}}],"study_subjects":[{"id":26035,"title":"طراحی الگوریتم ها","meta_title":"طراحی الگوریتم ها","meta_description":"طراحی الگوریتم ها - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"05ba630232278efd","type":"","books_count":5,"created_at":"2017-10-07 11:39:18","updated_at":"2022-11-27 13:23:09","study_fields":[{"id":898,"title":"مهندسی کامپیوتر","meta_title":"مهندسی کامپیوتر","meta_description":"مهندسی کامپیوتر - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"57bea94f4a51f6b8","books_count":33,"created_at":"2017-10-07 11:22:53","updated_at":"2024-11-22 18:27:59","study_groups":[{"id":10,"title":"فنی و مهندسی","meta_title":"فنی و مهندسی","meta_description":"فنی و مهندسی - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"cd075d6bdb3fbd29","style":{"first_color":"#F47820","second_color":"#F47820","icon":"images/categories/mohandesi.png"},"books_count":749,"created_at":"2017-10-07 11:22:44","updated_at":"2025-01-13 02:03:18","titleLink":"%D9%81%D9%86%DB%8C-%D9%88-%D9%85%D9%87%D9%86%D8%AF%D8%B3%DB%8C"}],"titleLink":"%D9%85%D9%87%D9%86%D8%AF%D8%B3%DB%8C-%DA%A9%D8%A7%D9%85%D9%BE%DB%8C%D9%88%D8%AA%D8%B1"}],"titleLink":"%D8%B7%D8%B1%D8%A7%D8%AD%DB%8C-%D8%A7%D9%84%DA%AF%D9%88%D8%B1%DB%8C%D8%AA%D9%85-%D9%87%D8%A7"}],"study_fields":[{"id":898,"title":"مهندسی کامپیوتر","meta_title":"مهندسی کامپیوتر","meta_description":"مهندسی کامپیوتر - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"57bea94f4a51f6b8","books_count":33,"created_at":"2017-10-07 11:22:53","updated_at":"2024-11-22 18:27:59","study_groups":[{"id":10,"title":"فنی و مهندسی","meta_title":"فنی و مهندسی","meta_description":"فنی و مهندسی - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"cd075d6bdb3fbd29","style":{"first_color":"#F47820","second_color":"#F47820","icon":"images/categories/mohandesi.png"},"books_count":749,"created_at":"2017-10-07 11:22:44","updated_at":"2025-01-13 02:03:18","titleLink":"%D9%81%D9%86%DB%8C-%D9%88-%D9%85%D9%87%D9%86%D8%AF%D8%B3%DB%8C"}],"titleLink":"%D9%85%D9%87%D9%86%D8%AF%D8%B3%DB%8C-%DA%A9%D8%A7%D9%85%D9%BE%DB%8C%D9%88%D8%AA%D8%B1"}],"study_groups":[{"id":10,"title":"فنی و مهندسی","meta_title":"فنی و مهندسی","meta_description":"فنی و مهندسی - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"cd075d6bdb3fbd29","style":{"first_color":"#F47820","second_color":"#F47820","icon":"images/categories/mohandesi.png"},"books_count":749,"created_at":"2017-10-07 11:22:44","updated_at":"2025-01-13 02:03:18","titleLink":"%D9%81%D9%86%DB%8C-%D9%88-%D9%85%D9%87%D9%86%D8%AF%D8%B3%DB%8C"}],"views":1,"similarBooks":[{"id":572,"token":"4f1eb51f4f5b6edb","front_cover":{"thumbnail":"/storage/files/styles/thumbnail/books/4f1eb51f4f5b6edb/front.jpg","medium":"/storage/files/styles/medium/books/4f1eb51f4f5b6edb/front.jpg","medium_rounded":"/storage/files/styles/medium_rounded/books/4f1eb51f4f5b6edb/front.png","large":"/storage/files/styles/large/books/4f1eb51f4f5b6edb/front.jpg","medium_trans":"/storage/files/styles/medium_trans/books/4f1eb51f4f5b6edb/front.png","medium_zoom_fit":"/storage/files/styles/medium_zoom_fit/books/4f1eb51f4f5b6edb/front.png"},"price":19,"ebook_price":19,"print_price":-1,"rent_3_price":15,"rent_6_price":6.65,"rent_12_price":-1,"rent_1_week_price":-1,"title":"Algorithms","description":"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. Emphasi...","publisher":null,"titleLink":"Algorithms","price_fa":"۱۹"},{"id":582,"token":"13b8a393f9f3fea3","front_cover":{"thumbnail":"/storage/files/styles/thumbnail/books/13b8a393f9f3fea3/front.jpg","medium":"/storage/files/styles/medium/books/13b8a393f9f3fea3/front.jpg","medium_rounded":"/storage/files/styles/medium_rounded/books/13b8a393f9f3fea3/front.png","large":"/storage/files/styles/large/books/13b8a393f9f3fea3/front.jpg","medium_trans":"/storage/files/styles/medium_trans/books/13b8a393f9f3fea3/front.png","medium_zoom_fit":"/storage/files/styles/medium_zoom_fit/books/13b8a393f9f3fea3/front.png"},"price":33,"ebook_price":33,"print_price":-1,"rent_3_price":26,"rent_6_price":11.55,"rent_12_price":-1,"rent_1_week_price":-1,"title":"Introduction to Algorithm","description":"Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad ...","publisher":null,"titleLink":"Introduction-to-Algorithm","price_fa":"۳۳"},{"id":3799268,"token":"419d651f23dd8b80","front_cover":{"thumbnail":"/storage/files/styles/thumbnail/books/419d651f23dd8b80/front.jpg","medium":"/storage/files/styles/medium/books/419d651f23dd8b80/front.jpg","medium_rounded":"/storage/files/styles/medium_rounded/books/419d651f23dd8b80/front.png","large":"/storage/files/styles/large/books/419d651f23dd8b80/front.jpg","medium_trans":"/storage/files/styles/medium_trans/books/419d651f23dd8b80/front.png","medium_zoom_fit":"/storage/files/styles/medium_zoom_fit/books/419d651f23dd8b80/front.png"},"price":60000,"ebook_price":30000,"print_price":-1,"rent_3_price":15000,"rent_6_price":18000,"rent_12_price":21000,"rent_1_week_price":-1,"title":"تحلیل الگوریتم ها و طراحی روش طراحی روش های فراابتکاری","description":"کتاب تحلیل الگوریتم‌ها و طراحی روش‌های فراابتکاری اثر کوروش عشقی و مهدی کریمی نسب، توسط انتشارات دانشگاه صنعتی شریف در سال 1395 منتشر شد. نویسندگان کتاب با توجه به تحولات و پیشرفت‌های س...","publisher":null,"titleLink":"%D8%AA%D8%AD%D9%84%DB%8C%D9%84-%D8%A7%D9%84%DA%AF%D9%88%D8%B1%DB%8C%D8%AA%D9%85-%D9%87%D8%A7-%D9%88-%D8%B7%D8%B1%D8%A7%D8%AD%DB%8C-%D8%B1%D9%88%D8%B4-%D8%B7%D8%B1%D8%A7%D8%AD%DB%8C-%D8%B1%D9%88%D8%B4-%D9%87%D8%A7%DB%8C-%D9%81%D8%B1%D8%A7%D8%A7%D8%A8%D8%AA%DA%A9%D8%A7%D8%B1%DB%8C","price_fa":"۶۰‌,‌۰۰۰"},{"id":3799362,"token":"4f6558f02c379b28","front_cover":{"thumbnail":"/storage/files/styles/thumbnail/books/4f6558f02c379b28/front.jpg","medium":"/storage/files/styles/medium/books/4f6558f02c379b28/front.jpg","medium_rounded":"/storage/files/styles/medium_rounded/books/4f6558f02c379b28/front.png","large":"/storage/files/styles/large/books/4f6558f02c379b28/front.jpg","medium_trans":"/storage/files/styles/medium_trans/books/4f6558f02c379b28/front.png","medium_zoom_fit":"/storage/files/styles/medium_zoom_fit/books/4f6558f02c379b28/front.png"},"price":120000,"ebook_price":60000,"print_price":-1,"rent_3_price":30000,"rent_6_price":36000,"rent_12_price":42000,"rent_1_week_price":-1,"title":"مبانی طراحی و تحلیل الگوریتم ها","description":"کتاب مبانی طراحی و تحلیل الگوریتم‌ها توسط دکتر محمد قدسی، استاد دانشکده مهندسی کامپیوتر دانشگاه صنعتی شریف نوشته شده است. استاد برای تایپ کتاب حاضر، وقت و دقت زیادی صرف کرده‌اند که کتابی کام...","publisher":null,"titleLink":"%D9%85%D8%A8%D8%A7%D9%86%DB%8C-%D8%B7%D8%B1%D8%A7%D8%AD%DB%8C-%D9%88-%D8%AA%D8%AD%D9%84%DB%8C%D9%84-%D8%A7%D9%84%DA%AF%D9%88%D8%B1%DB%8C%D8%AA%D9%85-%D9%87%D8%A7","price_fa":"۱۲۰‌,‌۰۰۰"}],"publisherBooks":[{"title":"Introduction to Optics Third Edition","price":36,"ebook_price":"۳۶","rent_3_price":"۲۹","rent_6_price":"۱۲","rent_12_price":"-۱","print_price":"-۱","front_cover":{"thumbnail":"/storage/files/styles/thumbnail/books/ba133fe21b66a449/front.jpg","medium":"/storage/files/styles/medium/books/ba133fe21b66a449/front.jpg","medium_rounded":"/storage/files/styles/medium_rounded/books/ba133fe21b66a449/front.png","large":"/storage/files/styles/large/books/ba133fe21b66a449/front.jpg","medium_trans":"/storage/files/styles/medium_trans/books/ba133fe21b66a449/front.png","medium_zoom_fit":"/storage/files/styles/medium_zoom_fit/books/ba133fe21b66a449/front.png"},"back_cover":{"thumbnail":"/storage/files/styles/thumbnail/books/ba133fe21b66a449/back.jpg","medium":"/storage/files/styles/medium/books/ba133fe21b66a449/back.jpg","medium_rounded":"/storage/files/styles/medium_rounded/books/ba133fe21b66a449/back.png","large":"/storage/files/styles/large/books/ba133fe21b66a449/back.jpg","medium_trans":"/storage/files/styles/medium_trans/books/ba133fe21b66a449/back.png","medium_zoom_fit":"/storage/files/styles/medium_zoom_fit/books/ba133fe21b66a449/back.png"},"print_book":false,"isbn":"9780131499331","lang":"null","cover_type":"null","dimension":"null","year":2006,"nobat_chap":1,"description":"This reader-friendly introduction to optics provides clear, concise derivations and explanations of optical phenomena, avoiding extraneous material. Updates material related to laser systems. Updated ...","pages_count":635,"token":"ba133fe21b66a449","deleted_at":null,"published_at":"2017-12-12 19:58:46","available_for_web":true,"publisher_title":"Pearson","edition":null,"currency":"IRR","subtitle":"null","country":"null","rent_1_week_price":"-۱","meta_desc":null,"meta_title":null,"stock":0,"cache":1,"bookmark":"false","has_book":"false","has_file":"true","writer_authors":[{"id":1147,"title":"Frank L. Pedrotti","meta_title":"Frank L. Pedrotti","meta_description":"Frank L. Pedrotti - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"firstname":"Frank","lastname":"L. Pedrotti","token":"5db1d7a95c53646c","national_code":null,"pivot":{"book_id":652,"author_id":1147,"created_at":"2017-12-11 13:17:07","updated_at":"2019-03-12 15:15:03","role":"writer"}},{"id":1149,"title":"Leno M. Pedrotti","meta_title":"Leno M. Pedrotti","meta_description":"Leno M. Pedrotti - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"firstname":"Leno","lastname":"M. Pedrotti","token":"0266b6e682c22cbe","national_code":null,"pivot":{"book_id":652,"author_id":1149,"created_at":"2017-12-11 13:17:07","updated_at":"2019-03-12 15:15:03","role":"writer"}},{"id":1150,"title":"Leno S. Pedrotti","meta_title":"Leno S. Pedrotti","meta_description":"Leno S. Pedrotti - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"firstname":"Leno","lastname":"S. Pedrotti","token":"1831d617677bd45e","national_code":null,"pivot":{"book_id":652,"author_id":1150,"created_at":"2017-12-11 13:17:07","updated_at":"2019-03-12 15:15:03","role":"writer"}}],"translator_authors":[],"available_e_book":true,"dir":true,"vitrines":[{"title":"کتاب‌های مشابه","url":"/api/bookstore/vitrines/similar-books/ba133fe21b66a449","type":"books","books":[]},{"title":"کتاب‌های دیگر ناشر","url":"/api/bookstore/vitrines/publisher-books/ba133fe21b66a449","type":"books","books":[]}],"authors":[{"id":1147,"title":"Frank L. Pedrotti","meta_title":"Frank L. Pedrotti","meta_description":"Frank L. Pedrotti - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"firstname":"Frank","lastname":"L. Pedrotti","token":"5db1d7a95c53646c","national_code":null,"pivot":{"book_id":652,"author_id":1147,"created_at":"2017-12-11 13:17:07","updated_at":"2019-03-12 15:15:03","role":"writer"}},{"id":1149,"title":"Leno M. Pedrotti","meta_title":"Leno M. Pedrotti","meta_description":"Leno M. Pedrotti - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"firstname":"Leno","lastname":"M. Pedrotti","token":"0266b6e682c22cbe","national_code":null,"pivot":{"book_id":652,"author_id":1149,"created_at":"2017-12-11 13:17:07","updated_at":"2019-03-12 15:15:03","role":"writer"}},{"id":1150,"title":"Leno S. Pedrotti","meta_title":"Leno S. Pedrotti","meta_description":"Leno S. Pedrotti - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"firstname":"Leno","lastname":"S. Pedrotti","token":"1831d617677bd45e","national_code":null,"pivot":{"book_id":652,"author_id":1150,"created_at":"2017-12-11 13:17:07","updated_at":"2019-03-12 15:15:03","role":"writer"}}],"e_book":{"toc":[{"page":0,"title":"Title Page"},{"page":2,"title":"Physical Constants"},{"page":4,"title":"List of Tables"},{"page":6,"title":"Contents"},{"page":18,"title":"1 Nature of Light","children":[{"page":18,"title":"Introduction"},{"page":19,"title":"1.1 A Brief History"},{"page":21,"title":"1.2 Particles and Photons"},{"page":23,"title":"1.3 The Electromagnetic Spectrum"},{"page":28,"title":"1.4 Radiometry"},{"page":32,"title":"Problems"}]},{"page":33,"title":"2 Geometrical Optics","children":[{"page":33,"title":"Introduction"},{"page":34,"title":"2.1 Huygens' Principle"},{"page":37,"title":"2.2 Fermat's Principle"},{"page":39,"title":"2.3 Principle of Reversibility"},{"page":39,"title":"2.4 Reflection in Plane Mirrors"},{"page":40,"title":"2.5 Refraction Through Plane Surfaces"},{"page":42,"title":"2.6 Imaging by an Optical System"},{"page":44,"title":"2.7 Reflection at a Spherical Surface"},{"page":49,"title":"2.8 Refraction at a Spherical Surface"},{"page":52,"title":"2.9 Thin Lenses"},{"page":56,"title":"2.10 Vergence and Refractive Power"},{"page":59,"title":"2.11 Newtonian Equation for the Thin Lens"},{"page":59,"title":"2.12 Cylindrical Lenses"},{"page":63,"title":"Problems"}]},{"page":67,"title":"3 Optical Instrumentation","children":[{"page":67,"title":"Introduction"},{"page":67,"title":"3.1 Stops, Pupils, and Windows"},{"page":75,"title":"3.2 A Brief Look at Aberrations"},{"page":77,"title":"3.3 Prisms"},{"page":86,"title":"3.4 The Camera"},{"page":92,"title":"3.5 Simple Magnifiers and Eyepieces"},{"page":96,"title":"3.6 Microscopes"},{"page":99,"title":"3.7 Telescopes"},{"page":106,"title":"Problems"}]},{"page":111,"title":"4 Wave Equations","children":[{"page":111,"title":"Introduction"},{"page":111,"title":"4.1 One-Dimensional Wave Equation"},{"page":113,"title":"4.2 Harmonic Waves"},{"page":116,"title":"4.3 Complex Numbers"},{"page":117,"title":"4.4 Harmonic Waves as Complex Functions"},{"page":117,"title":"4.5 Plane Waves"},{"page":119,"title":"4.6 Spherical Waves"},{"page":120,"title":"4.7 Other Harmonic Waves"},{"page":121,"title":"4.8 Electromagnetic Waves"},{"page":125,"title":"4.9 Light Polarization"},{"page":127,"title":"4.10 Doppler Effect"},{"page":128,"title":"Problems"}]},{"page":130,"title":"5 Superposition of Waves","children":[{"page":130,"title":"Introduction"},{"page":130,"title":"5.1 Superposition Principle"},{"page":131,"title":"5.2 Superposition of Waves of the Same Frequency"},{"page":136,"title":"5.3 Random and Coherent Sources"},{"page":137,"title":"5.4 Standing Waves"},{"page":140,"title":"5.5 The Beat Phenomenon"},{"page":142,"title":"5.6 Phase and Group Velocities"},{"page":146,"title":"Problems"}]},{"page":148,"title":"6 Properties of Lasers","children":[{"page":148,"title":"Introduction"},{"page":149,"title":"6.1 Energy Quantization in Light and Matter"},{"page":152,"title":"6.2 Thermal Equilibrium and Blackbody Radiation"},{"page":155,"title":"6.3 Nonlaser Sources of Electromagnetic Radiation"},{"page":160,"title":"6.4 Einstein's Theory of Light-Matter Interaction"},{"page":163,"title":"6.5 Essential Elements of a Laser"},{"page":166,"title":"6.6 Simplified Description of Laser Operation"},{"page":170,"title":"6.7 Characteristics of Laser Light"},{"page":175,"title":"6.8 Laser Types and Parameters"},{"page":178,"title":"Problems"}]},{"page":180,"title":"7 Interference of Light","children":[{"page":180,"title":"Introduction"},{"page":180,"title":"7.1 Two-Beam Interference"},{"page":186,"title":"7.2 Young's Double-Slit Experiment"},{"page":190,"title":"7.3 Double-Slit Interference with Virtual Sources"},{"page":192,"title":"7.4 Interference in Dielectric Films"},{"page":197,"title":"7.5 Fringes of Equal Thickness"},{"page":198,"title":"7.6 Newton's Rings"},{"page":199,"title":"7.7 Film-Thickness Measurement by Interference"},{"page":201,"title":"7.8 Stokes Relations"},{"page":202,"title":"7.9 Multiple-Beam Interference in a Parallel Plane"},{"page":206,"title":"Problems"}]},{"page":209,"title":"8 Optical Interferometry","children":[{"page":209,"title":"Introduction"},{"page":210,"title":"8.1 The Michelson Interferometer"},{"page":213,"title":"8.2 Applications of the Michelson Interferometer"},{"page":215,"title":"8.3 Variations of the Michelson Interferometer"},{"page":216,"title":"8.4 The Fabry-Perot Interferometer"},{"page":218,"title":"8.5 Fabry-Perot Transmission: The Airy Function"},{"page":223,"title":"8.6 Scanning Fabry-Perot Interferometer"},{"page":228,"title":"8.7 Variable-Input-Frequency Fabry-Perot Interferometers"},{"page":230,"title":"8.8 Lasers and the Fabry-Perot Cavity"},{"page":233,"title":"8.9 Fabry-Perot Figures of Merit"},{"page":234,"title":"8.10 Gravitational Wave Detectors"},{"page":237,"title":"Problems"}]},{"page":241,"title":"9 Coherence","children":[{"page":241,"title":"Introduction"},{"page":241,"title":"9.1 Fourier Analysis"},{"page":245,"title":"9.2 Fourier Analysis of a Finite Wave Train"},{"page":247,"title":"9.3 Temporal Coherence and Line Width"},{"page":248,"title":"9.4 Partial Coherence"},{"page":254,"title":"9.5 Spatial Coherence"},{"page":255,"title":"9.6 Spatial Coherence Width"},{"page":258,"title":"Problems"}]},{"page":260,"title":"10 Fiber Optics","children":[{"page":260,"title":"Introduction"},{"page":260,"title":"10.1 Applications"},{"page":261,"title":"10.2 Communications System Overview"},{"page":263,"title":"10.3 Bandwidth and Data Rate"},{"page":263,"title":"10.4 Optics of Propagation"},{"page":266,"title":"10.5 Allowed Modes"},{"page":268,"title":"10.6 Attenuation"},{"page":270,"title":"10.7 Distortion"},{"page":277,"title":"10.8 High-Bit-Rate Optical-Fiber Communications"},{"page":281,"title":"Problems"}]},{"page":284,"title":"11 Fraunhofer Diffraction","children":[{"page":284,"title":"Introduction"},{"page":285,"title":"11.1 Diffraction from a Single Slit"},{"page":290,"title":"11.2 Beam Spreading"},{"page":291,"title":"11.3 Rectangular and Circular Apertures"},{"page":296,"title":"11.4 Resolution"},{"page":298,"title":"11.5 Double-Slit Diffraction"},{"page":301,"title":"11.6 Diffraction from Many Slits"},{"page":306,"title":"Problems"}]},{"page":309,"title":"12 The Diffraction Grating","children":[{"page":309,"title":"Introduction"},{"page":309,"title":"12.1 The Grating Equation"},{"page":310,"title":"12.2 Free Spectral Range of a Grating"},{"page":312,"title":"12.3 Dispersion of a Grating"},{"page":313,"title":"12.4 Resolution of a Grating"},{"page":315,"title":"12.5 Types of Gratings"},{"page":316,"title":"12.6 Blazed Gratings"},{"page":318,"title":"12.7 Grating Replicas"},{"page":319,"title":"12.8 Interference Gratings"},{"page":320,"title":"12.9 Grating Instruments"},{"page":322,"title":"Problems"}]},{"page":325,"title":"13 Fresnel Diffraction","children":[{"page":325,"title":"Introduction"},{"page":325,"title":"13.1 Fresnel-Kirchhoff Diffraction Integral"},{"page":328,"title":"13.2 Criterion for Fresnel Diffraction"},{"page":329,"title":"13.3 The Obliquity Factor"},{"page":329,"title":"13.4 Fresnel Diffraction from Circular Apertures"},{"page":333,"title":"13.5 Phase Shift of the Diffracted Light"},{"page":333,"title":"13.6 The Fresnel Zone Plate"},{"page":335,"title":"13.7 Fresnel Diffraction from Apertures with Rectangular Symmetry"},{"page":337,"title":"13.8 The Cornu Spiral"},{"page":341,"title":"13.9 Applications of the Cornu Spiral"},{"page":347,"title":"13.10 Babinet's Principle"},{"page":348,"title":"Problems"}]},{"page":350,"title":"14 Matrix Treatment of Polarization","children":[{"page":350,"title":"Introduction"},{"page":351,"title":"14.1 Mathematical Representation of Polarized Light: Jones Vectors"},{"page":358,"title":"14.2 Mathematical Representation of Polarizers: Jones Matrices"},{"page":364,"title":"Problems"}]},{"page":367,"title":"15 Production of Polarized Light","children":[{"page":367,"title":"Introduction"},{"page":367,"title":"15.1 Dichroism: Polarization by Selective Absorption"},{"page":370,"title":"15.2 Polarization by Reflection from Dielectric Surfaces"},{"page":372,"title":"15.3 Polarization by Scattering"},{"page":374,"title":"15.4 Birefringence: Polarization with Two Refractive Indices"},{"page":378,"title":"15.5 Double Refraction"},{"page":380,"title":"15.6 Optical Activity"},{"page":384,"title":"15.7 Photoelasticity"},{"page":386,"title":"Problems"}]},{"page":389,"title":"16 Holography","children":[{"page":389,"title":"Introduction"},{"page":389,"title":"16.1 Conventional versus Holographic Photography"},{"page":390,"title":"16.2 Hologram of a Point Source"},{"page":392,"title":"16.3 Hologram of an Extended Object"},{"page":396,"title":"16.4 Hologram Properties"},{"page":396,"title":"16.5 White-Light (Rainbow) Properties"},{"page":398,"title":"16.6 Other Applications of Holography"},{"page":401,"title":"Problems"}]},{"page":403,"title":"17 Optical Detectors and Displays","children":[{"page":403,"title":"Introduction"},{"page":403,"title":"17.1 Thermal Detectors of Radiation"},{"page":404,"title":"17.2 Quantum Detectors of Radiation"},{"page":406,"title":"17.3 Image Detection"},{"page":407,"title":"17.4 Optical Detectors: Noise and Sensitivity"},{"page":408,"title":"17.5 Optical Displays"},{"page":411,"title":"Problems"}]},{"page":413,"title":"18 Matrix Methods in Paraxial Optics","children":[{"page":413,"title":"Introduction"},{"page":413,"title":"18.1 The Thick Lens"},{"page":416,"title":"18.2 The Matrix Method"},{"page":417,"title":"18.3 The Translation Matrix"},{"page":417,"title":"18.4 The Refraction Matrix"},{"page":418,"title":"18.5 The Reflection Matrix"},{"page":419,"title":"18.6 Thick-Lens and Thin Lens Matrices"},{"page":421,"title":"18.7 System-Ray Transfer Matrix"},{"page":423,"title":"18.8 Significance of System Matrix Elements"},{"page":425,"title":"18.9 Location of Cardinal Points for an Optical System"},{"page":427,"title":"18.10 Examples Using the System Matrix and Cardinal Points"},{"page":429,"title":"18.11 Ray Tracing"},{"page":433,"title":"Problems"}]},{"page":436,"title":"19 Optics of the Eye","children":[{"page":436,"title":"Introduction"},{"page":436,"title":"19.1 Biological Structure of the Eye"},{"page":438,"title":"19.2 Photometry"},{"page":441,"title":"19.3 Optical Representation of the Eye"},{"page":442,"title":"19.4 Functions of the Eye"},{"page":445,"title":"19.5 Vision Correction with External Lenses"},{"page":451,"title":"19.6 Surgical Vision Correction"},{"page":453,"title":"Problems"}]},{"page":455,"title":"20 Aberration Theory","children":[{"page":455,"title":"Introduction"},{"page":456,"title":"20.1 Ray and Wave Aberrations"},{"page":457,"title":"20.2 Third-Order Treatment of Refraction at a Spherical Interface"},{"page":461,"title":"20.3 Spherical Aberrations"},{"page":464,"title":"20.4 Coma"},{"page":466,"title":"20.5 Astigmatism and Curvature of Field"},{"page":468,"title":"20.6 Distortion"},{"page":468,"title":"20.7 Chromatic Aberration"},{"page":473,"title":"Problems"}]},{"page":475,"title":"21 Fourier Optics","children":[{"page":475,"title":"Introduction"},{"page":476,"title":"21.1 Optical Data Imaging and Processing"},{"page":488,"title":"21.2 Fourier-Transform Spectroscopy"},{"page":491,"title":"Problems"}]},{"page":493,"title":"22 Theory of Multilayer Films","children":[{"page":493,"title":"Introduction"},{"page":494,"title":"22.1 Transfer Matrix"},{"page":498,"title":"22.2 Reflectance at Normal Incidence"},{"page":500,"title":"22.3 Two-Layer Antireflecting Films"},{"page":503,"title":"22.4 Three-Layer Antireflecting Films"},{"page":503,"title":"22.5 High-Reflective Layers"},{"page":506,"title":"Problems"}]},{"page":508,"title":"23 Fresnel Equations","children":[{"page":508,"title":"Introduction"},{"page":508,"title":"23.1 The Fresnel Equations"},{"page":514,"title":"23.2 External and Internal Reflections"},{"page":516,"title":"23.3 Phase Changes on Reflection"},{"page":519,"title":"23.4 Conservation of Energy"},{"page":521,"title":"23.5 Evanescent Waves"},{"page":523,"title":"23.6 Complex Refractive Index"},{"page":524,"title":"23.7 Reflection from Metals"},{"page":525,"title":"Problems"}]},{"page":527,"title":"24 Nonlinear Optics and the Modulation of Light","children":[{"page":527,"title":"Introduction"},{"page":528,"title":"24.1 The Nonlinear Medium"},{"page":530,"title":"24.2 Second Harmonic Generation and Frequency Mixing"},{"page":534,"title":"24.3 Electro-Optic Effects"},{"page":541,"title":"24.4 The Faraday Effect"},{"page":543,"title":"24.5 The Acousto-Optic Effect"},{"page":546,"title":"24.6 Optical Phase Conjugation"},{"page":548,"title":"24.7 Optical Nonlinearities in Fibers"},{"page":550,"title":"Problems"}]},{"page":552,"title":"25 Optical Properties of Materials","children":[{"page":552,"title":"Introduction"},{"page":552,"title":"25.1 Polarization of a Dielectric Medium"},{"page":556,"title":"25.2 Propagation of Light Waves"},{"page":561,"title":"25.3 Conduction Current in a Metal"},{"page":561,"title":"25.4 Propagation of Light Waves in a Metal"},{"page":562,"title":"25.5 Skin Depth"},{"page":563,"title":"25.6 Plasma Frequency"},{"page":565,"title":"Problems"}]},{"page":566,"title":"26 Laser Operation","children":[{"page":566,"title":"Introduction"},{"page":566,"title":"26.1 Rate Equations"},{"page":570,"title":"26.2 Absorption"},{"page":574,"title":"26.3 Gain Media"},{"page":578,"title":"26.4 Steady-State Laser Output"},{"page":581,"title":"26.5 Homogeneous Broadening"},{"page":584,"title":"26.6 Inhomogeneous Broadening"},{"page":586,"title":"26.7 Time-Dependent Phenomena"},{"page":588,"title":"26.8 Pulsed Operation"},{"page":592,"title":"26.9 Some Important Laser Systems"},{"page":594,"title":"26.10 Diode Lasers"},{"page":596,"title":"Problems"}]},{"page":599,"title":"27 Characteristics of Laser Beams","children":[{"page":599,"title":"Introduction"},{"page":599,"title":"27.1 Three-Dimensional Wave Equation and Electromagnetic Waves"},{"page":600,"title":"27.2 Gaussian Beams"},{"page":603,"title":"27.3 Spot Size and Radius of Curvature of a Gaussian Beam"},{"page":604,"title":"27.4 Characteristics of Gaussian Beams"},{"page":608,"title":"27.5 Modes of Spherical Mirror Cavities"},{"page":610,"title":"27.6 Laser Propagation Through Arbitrary Optical Systems"},{"page":617,"title":"27.7 Higher-Order Gaussian Beams"},{"page":622,"title":"Problems"}]},{"page":624,"title":"References"},{"page":628,"title":"Answers to Selected Problems"}],"pages_count":635,"version":"5.15.2","dir":"ltr","state":"converting","token":"ba133fe21b66a449","status":"SUCCEED","pages_count_fa":"۶۳۵"},"publisher":{"id":105,"title":"Pearson","description":null,"logo":null,"token":"4e9e4a99eea1a798","slug":"Pearson"},"tags":[{"title":"اپتیک","token":"24c26cbcbf16812c","pivot":{"taggable_id":652,"tag_id":2800}}],"study_subjects":[{"id":802,"title":"اپتیک","meta_title":"اپتیک","meta_description":"اپتیک - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"4acb6ccfb46c2610","type":"","books_count":3,"created_at":"2017-10-07 11:24:03","updated_at":"2022-09-13 15:57:49","study_fields":[{"id":199,"title":"فیزیک","meta_title":"فیزیک","meta_description":"فیزیک - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"d4ce4bba4c78dc26","books_count":51,"created_at":"2017-10-07 11:22:49","updated_at":"2024-10-15 09:32:12","study_groups":[{"id":10,"title":"فنی و مهندسی","meta_title":"فنی و مهندسی","meta_description":"فنی و مهندسی - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"cd075d6bdb3fbd29","style":{"first_color":"#F47820","second_color":"#F47820","icon":"images/categories/mohandesi.png"},"books_count":749,"created_at":"2017-10-07 11:22:44","updated_at":"2025-01-13 02:03:18"}]}]}],"study_fields":[{"id":199,"title":"فیزیک","meta_title":"فیزیک","meta_description":"فیزیک - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"d4ce4bba4c78dc26","books_count":51,"created_at":"2017-10-07 11:22:49","updated_at":"2024-10-15 09:32:12","study_groups":[{"id":10,"title":"فنی و مهندسی","meta_title":"فنی و مهندسی","meta_description":"فنی و مهندسی - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"cd075d6bdb3fbd29","style":{"first_color":"#F47820","second_color":"#F47820","icon":"images/categories/mohandesi.png"},"books_count":749,"created_at":"2017-10-07 11:22:44","updated_at":"2025-01-13 02:03:18"}]}],"study_groups":[{"id":10,"title":"فنی و مهندسی","meta_title":"فنی و مهندسی","meta_description":"فنی و مهندسی - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"cd075d6bdb3fbd29","style":{"first_color":"#F47820","second_color":"#F47820","icon":"images/categories/mohandesi.png"},"books_count":749,"created_at":"2017-10-07 11:22:44","updated_at":"2025-01-13 02:03:18"}],"views":1,"price_fa":"۳۶","titleLink":"Introduction-to-Optics-Third-Edition","urlify":"Introduction-to-Optics-Third-Edition","pages_count_fa":"۶۳۵","previews":null,"score":0},{"title":"Introduction to The Design and Analysis of Algorithms","price":7,"ebook_price":"۷","rent_3_price":"۶","rent_6_price":"۲","rent_12_price":"-۱","print_price":"-۱","front_cover":{"thumbnail":"/storage/files/styles/thumbnail/books/4a8b03583f119702/front.jpg","medium":"/storage/files/styles/medium/books/4a8b03583f119702/front.jpg","medium_rounded":"/storage/files/styles/medium_rounded/books/4a8b03583f119702/front.png","large":"/storage/files/styles/large/books/4a8b03583f119702/front.jpg","medium_trans":"/storage/files/styles/medium_trans/books/4a8b03583f119702/front.png","medium_zoom_fit":"/storage/files/styles/medium_zoom_fit/books/4a8b03583f119702/front.png"},"back_cover":{"thumbnail":"/storage/files/styles/thumbnail/books/4a8b03583f119702/back.jpg","medium":"/storage/files/styles/medium/books/4a8b03583f119702/back.jpg","medium_rounded":"/storage/files/styles/medium_rounded/books/4a8b03583f119702/back.png","large":"/storage/files/styles/large/books/4a8b03583f119702/back.jpg","medium_trans":"/storage/files/styles/medium_trans/books/4a8b03583f119702/back.png","medium_zoom_fit":"/storage/files/styles/medium_zoom_fit/books/4a8b03583f119702/back.png"},"print_book":false,"isbn":"9780132316811","lang":"null","cover_type":"null","dimension":"null","year":2011,"nobat_chap":1,"description":"Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a truly innovati...","pages_count":592,"token":"4a8b03583f119702","deleted_at":null,"published_at":"2017-12-12 14:32:47","available_for_web":true,"publisher_title":"Pearson","edition":null,"currency":"EUR","subtitle":"null","country":"null","rent_1_week_price":"-۱","meta_desc":null,"meta_title":null,"stock":0,"cache":1,"bookmark":"false","has_book":"false","has_file":"true","writer_authors":[{"id":1055,"title":"Anany Levitin","meta_title":"Anany Levitin","meta_description":"Anany Levitin - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"firstname":"Anany","lastname":"Levitin","token":"ac5211b9343c3ed5","national_code":null,"pivot":{"book_id":573,"author_id":1055,"created_at":"2017-12-09 19:25:09","updated_at":"2019-03-12 15:13:25","role":"writer"}}],"translator_authors":[],"available_e_book":true,"dir":true,"vitrines":[{"title":"کتاب‌های مشابه","url":"/api/bookstore/vitrines/similar-books/4a8b03583f119702","type":"books","books":[]},{"title":"کتاب‌های دیگر ناشر","url":"/api/bookstore/vitrines/publisher-books/4a8b03583f119702","type":"books","books":[]}],"authors":[{"id":1055,"title":"Anany Levitin","meta_title":"Anany Levitin","meta_description":"Anany Levitin - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"firstname":"Anany","lastname":"Levitin","token":"ac5211b9343c3ed5","national_code":null,"pivot":{"book_id":573,"author_id":1055,"created_at":"2017-12-09 19:25:09","updated_at":"2019-03-12 15:13:25","role":"writer"}}],"e_book":{"toc":[{"page":2,"title":"Copyright Page"},{"page":3,"title":"Title Page"},{"page":5,"title":"Brief Contents"},{"page":7,"title":"Contents"},{"page":17,"title":"New to the Third Edition"},{"page":19,"title":"Preface"},{"page":24,"title":"Acknowledgments"},{"page":27,"title":"1 Introduction","children":[{"page":29,"title":"1.1 What Is an Algorithm?","children":[{"page":33,"title":"Exercises 1.1"}]},{"page":35,"title":"1.2 Fundamentals of Algorithmic Problem Solving","children":[{"page":35,"title":"Understanding the Problem"},{"page":35,"title":"Ascertaining the Capabilities of the Computational Device"},{"page":37,"title":"Choosing between Exact and Approximate Problem Solving"},{"page":37,"title":"Algorithm Design Techniques"},{"page":38,"title":"Designing an Algorithm and Data Structures"},{"page":38,"title":"Methods of Specifying an Algorithm"},{"page":39,"title":"Proving an Algorithm’s Correctness"},{"page":40,"title":"Analyzing an Algorithm"},{"page":41,"title":"Coding an Algorithm"},{"page":43,"title":"Exercises 1.2"}]},{"page":44,"title":"1.3 Important Problem Types","children":[{"page":45,"title":"Sorting"},{"page":46,"title":"Searching"},{"page":46,"title":"String Processing"},{"page":47,"title":"Graph Problems"},{"page":47,"title":"Combinatorial Problems"},{"page":48,"title":"Geometric Problems"},{"page":48,"title":"Numerical Problems"},{"page":49,"title":"Exercises 1.3"}]},{"page":51,"title":"1.4 Fundamental Data Structures","children":[{"page":51,"title":"Linear Data Structures"},{"page":54,"title":"Graphs"},{"page":57,"title":"Trees"},{"page":61,"title":"Sets and Dictionaries"},{"page":63,"title":"Exercises 1.4"},{"page":64,"title":"Summary"}]}]},{"page":67,"title":"2 Fundamentals of the Analysis of Algorithm Efficiency","children":[{"page":68,"title":"2.1 The Analysis Framework","children":[{"page":69,"title":"Measuring an Input’s Size"},{"page":70,"title":"Units for Measuring Running Time"},{"page":71,"title":"Orders of Growth"},{"page":73,"title":"Worst-Case, Best-Case, and Average-Case Efficiencies"},{"page":76,"title":"Recapitulation of the Analysis Framework"},{"page":76,"title":"Exercises 2.1"}]},{"page":78,"title":"2.2 Asymptotic Notations and Basic Efficiency Classes","children":[{"page":78,"title":"Informal Introduction"},{"page":79,"title":"O-notation"},{"page":80,"title":"Ω-notation"},{"page":81,"title":"Θ-notation"},{"page":81,"title":"Useful Property Involving the Asymptotic Notations"},{"page":82,"title":"Using Limits for Comparing Orders of Growth"},{"page":84,"title":"Basic Efficiency Classes"},{"page":84,"title":"Exercises 2.2"}]},{"page":87,"title":"2.3 Mathematical Analysis of Nonrecursive Algorithms","children":[{"page":93,"title":"Exercises 2.3"}]},{"page":96,"title":"2.4 Mathematical Analysis of Recursive Algorithms","children":[{"page":102,"title":"Exercises 2.4"}]},{"page":106,"title":"2.5 Example: Computing the nth Fibonacci Number","children":[{"page":109,"title":"Exercises 2.5"}]},{"page":110,"title":"2.6 Empirical Analysis of Algorithms","children":[{"page":115,"title":"Exercises 2.6"}]},{"page":117,"title":"2.7 Algorithm Visualization","children":[{"page":120,"title":"Summary"}]}]},{"page":123,"title":"3 Brute Force and Exhaustive Search","children":[{"page":124,"title":"3.1 Selection Sort and Bubble Sort","children":[{"page":124,"title":"Selection Sort"},{"page":126,"title":"Bubble Sort"},{"page":128,"title":"Exercises 3.1"}]},{"page":130,"title":"3.2 Sequential Search and Brute-Force String Matching","children":[{"page":130,"title":"Sequential Search"},{"page":131,"title":"Brute-Force String Matching"},{"page":132,"title":"Exercises 3.2"}]},{"page":134,"title":"3.3 Closest-Pair and Convex-Hull Problems by Brute Force","children":[{"page":134,"title":"Closest-Pair Problem"},{"page":135,"title":"Convex-Hull Problem"},{"page":139,"title":"Exercises 3.3"}]},{"page":141,"title":"3.4 Exhaustive Search","children":[{"page":142,"title":"Traveling Salesman Problem"},{"page":142,"title":"Knapsack Problem"},{"page":145,"title":"Assignment Problem"},{"page":146,"title":"Exercises 3.4"}]},{"page":148,"title":"3.5 Depth-First Search and Breadth-First Search","children":[{"page":148,"title":"Depth-First Search"},{"page":151,"title":"Breadth-First Search"},{"page":154,"title":"Exercises 3.5"},{"page":156,"title":"Summary"}]}]},{"page":157,"title":"4 Decrease-and-Conquer","children":[{"page":160,"title":"4.1 Insertion Sort","children":[{"page":162,"title":"Exercises 4.1"}]},{"page":164,"title":"4.2 Topological Sorting","children":[{"page":168,"title":"Exercises 4.2"}]},{"page":170,"title":"4.3 Algorithms for Generating Combinatorial Objects","children":[{"page":170,"title":"Generating Permutations"},{"page":172,"title":"Generating Subsets"},{"page":174,"title":"Exercises 4.3"}]},{"page":176,"title":"4.4 Decrease-by-a-Constant-Factor Algorithms","children":[{"page":176,"title":"Binary Search"},{"page":178,"title":"Fake-Coin Problem"},{"page":179,"title":"Russian Peasant Multiplication"},{"page":180,"title":"Josephus Problem"},{"page":182,"title":"Exercises 4.4"}]},{"page":183,"title":"4.5 Variable-Size-Decrease Algorithms","children":[{"page":184,"title":"Computing a Median and the Selection Problem"},{"page":187,"title":"Interpolation Search"},{"page":189,"title":"Searching and Insertion in a Binary Search Tree"},{"page":190,"title":"The Game of Nim"},{"page":192,"title":"Exercises 4.5"},{"page":193,"title":"Summary"}]}]},{"page":195,"title":"5 Divide-and-Conquer","children":[{"page":198,"title":"5.1 Mergesort","children":[{"page":200,"title":"Exercises 5.1"}]},{"page":202,"title":"5.2 Quicksort","children":[{"page":207,"title":"Exercises 5.2"}]},{"page":208,"title":"5.3 Binary Tree Traversals and Related Properties","children":[{"page":211,"title":"Exercises 5.3"}]},{"page":212,"title":"5.4 Multiplication of Large Integers and Strassen’s Matrix Multiplication","children":[{"page":213,"title":"Multiplication of Large Integers"},{"page":215,"title":"Strassen’s Matrix Multiplication"},{"page":217,"title":"Exercises 5.4"}]},{"page":218,"title":"5.5 The Closest-Pair and Convex-Hull Problems by Divide-and-Conquer","children":[{"page":218,"title":"The Closest-Pair Problem"},{"page":221,"title":"Convex-Hull Problem"},{"page":223,"title":"Exercises 5.5"},{"page":224,"title":"Summary"}]}]},{"page":227,"title":"6 Transform-and-Conquer","children":[{"page":228,"title":"6.1 Presorting","children":[{"page":231,"title":"Exercises 6.1"}]},{"page":234,"title":"6.2 Gaussian Elimination","children":[{"page":238,"title":"LU Decomposition"},{"page":240,"title":"Computing a Matrix Inverse"},{"page":241,"title":"Computing a Determinant"},{"page":242,"title":"Exercises 6.2"}]},{"page":244,"title":"6.3 Balanced Search Trees","children":[{"page":244,"title":"AVL Trees"},{"page":249,"title":"2-3 Trees"},{"page":251,"title":"Exercises 6.3"}]},{"page":252,"title":"6.4 Heaps and Heapsort","children":[{"page":253,"title":"Notion of the Heap"},{"page":257,"title":"Heapsort"},{"page":259,"title":"Exercises 6.4"}]},{"page":260,"title":"6.5 Horner’s Rule and Binary Exponentiation","children":[{"page":260,"title":"Horner’s Rule"},{"page":262,"title":"Binary Exponentiation"},{"page":265,"title":"Exercises 6.5"}]},{"page":266,"title":"6.6 Problem Reduction","children":[{"page":267,"title":"Computing the Least Common Multiple"},{"page":268,"title":"Counting Paths in a Graph"},{"page":269,"title":"Reduction of Optimization Problems"},{"page":270,"title":"Linear Programming"},{"page":272,"title":"Reduction to Graph Problems"},{"page":274,"title":"Exercises 6.6"},{"page":276,"title":"Summary"}]}]},{"page":279,"title":"7 Space and Time Trade-Offs","children":[{"page":280,"title":"7.1 Sorting by Counting","children":[{"page":283,"title":"Exercises 7.1"}]},{"page":284,"title":"7.2 Input Enhancement in String Matching","children":[{"page":285,"title":"Horspool’s Algorithm"},{"page":289,"title":"Boyer-Moore Algorithm"},{"page":293,"title":"Exercises 7.2"}]},{"page":295,"title":"7.3 Hashing","children":[{"page":296,"title":"Open Hashing (Separate Chaining)"},{"page":298,"title":"Closed Hashing (Open Addressing)"},{"page":300,"title":"Exercises 7.3"}]},{"page":302,"title":"7.4 B-Trees","children":[{"page":305,"title":"Exercises 7.4"},{"page":306,"title":"Summary"}]}]},{"page":309,"title":"8 Dynamic Programming","children":[{"page":311,"title":"8.1 Three Basic Examples","children":[{"page":316,"title":"Exercises 8.1"}]},{"page":318,"title":"8.2 The Knapsack Problem and Memory Functions","children":[{"page":320,"title":"Memory Functions"},{"page":322,"title":"Exercises 8.2"}]},{"page":323,"title":"8.3 Optimal Binary Search Trees","children":[{"page":329,"title":"Exercises 8.3"}]},{"page":330,"title":"8.4 Warshall’s and Floyd’s Algorithms","children":[{"page":330,"title":"Warshall’s Algorithm"},{"page":334,"title":"Floyd’s Algorithm for the All-Pairs Shortest-Paths Problem"},{"page":337,"title":"Exercises 8.4"},{"page":338,"title":"Summary"}]}]},{"page":341,"title":"9 Greedy Technique","children":[{"page":344,"title":"9.1 Prim’s Algorithm","children":[{"page":348,"title":"Exercises 9.1"}]},{"page":351,"title":"9.2 Kruskal’s Algorithm","children":[{"page":353,"title":"Disjoint Subsets and Union-Find Algorithms"},{"page":357,"title":"Exercises 9.2"}]},{"page":359,"title":"9.3 Dijkstra’s Algorithm","children":[{"page":363,"title":"Exercises 9.3"}]},{"page":364,"title":"9.4 Huffman Trees and Codes","children":[{"page":368,"title":"Exercises 9.4"},{"page":370,"title":"Summary"}]}]},{"page":371,"title":"10 Iterative Improvement","children":[{"page":372,"title":"10.1 The Simplex Method","children":[{"page":373,"title":"Geometric Interpretation of Linear Programming"},{"page":377,"title":"An Outline of the Simplex Method"},{"page":383,"title":"Further Notes on the Simplex Method"},{"page":385,"title":"Exercises 10.1"}]},{"page":387,"title":"10.2 The Maximum-Flow Problem","children":[{"page":397,"title":"Exercises 10.2"}]},{"page":398,"title":"10.3 Maximum Matching in Bipartite Graphs","children":[{"page":404,"title":"Exercises 10.3"}]},{"page":406,"title":"10.4 The Stable Marriage Problem","children":[{"page":409,"title":"Exercises 10.4"},{"page":410,"title":"Summary"}]}]},{"page":413,"title":"11 Limitations of Algorithm Power","children":[{"page":414,"title":"11.1 Lower-Bound Arguments","children":[{"page":415,"title":"Trivial Lower Bounds"},{"page":416,"title":"Information-Theoretic Arguments"},{"page":416,"title":"Adversary Arguments"},{"page":417,"title":"Problem Reduction"},{"page":419,"title":"Exercises 11.1"}]},{"page":420,"title":"11.2 Decision Trees","children":[{"page":421,"title":"Decision Trees for Sorting"},{"page":423,"title":"Decision Trees for Searching a Sorted Array"},{"page":425,"title":"Exercises 11.2"}]},{"page":427,"title":"11.3 P, NP, and NP-Complete Problems","children":[{"page":428,"title":"P and NP Problems"},{"page":432,"title":"NP-Complete Problems"},{"page":435,"title":"Exercises 11.3"}]},{"page":438,"title":"11.4 Challenges of Numerical Algorithms","children":[{"page":445,"title":"Exercises 11.4"},{"page":446,"title":"Summary"}]}]},{"page":449,"title":"12 Coping with the Limitations of Algorithm Power","children":[{"page":450,"title":"12.1 Backtracking","children":[{"page":451,"title":"n-Queens Problem"},{"page":452,"title":"Hamiltonian Circuit Problem"},{"page":453,"title":"Subset-Sum Problem"},{"page":454,"title":"General Remarks"},{"page":456,"title":"Exercises 12.1"}]},{"page":458,"title":"12.2 Branch-and-Bound","children":[{"page":459,"title":"Assignment Problem"},{"page":462,"title":"Knapsack Problem"},{"page":464,"title":"Traveling Salesman Problem"},{"page":466,"title":"Exercises 12.2"}]},{"page":467,"title":"12.3 Approximation Algorithms for NP-Hard Problems","children":[{"page":469,"title":"Approximation Algorithms for the Traveling Salesman Problem"},{"page":479,"title":"Approximation Algorithms for the Knapsack Problem"},{"page":483,"title":"Exercises 12.3"}]},{"page":485,"title":"12.4 Algorithms for Solving Nonlinear Equations","children":[{"page":486,"title":"Bisection Method"},{"page":490,"title":"Method of False Position"},{"page":490,"title":"Newton’s Method"},{"page":493,"title":"Exercises 12.4"},{"page":494,"title":"Summary"}]}]},{"page":497,"title":"Epilogue"},{"page":501,"title":"APPENDIX A: Useful Formulas for the Analysis of Algorithms","children":[{"page":501,"title":"Properties of Logarithms"},{"page":501,"title":"Combinatorics"},{"page":502,"title":"Important Summation Formulas"},{"page":502,"title":"Sum Manipulation Rules"},{"page":503,"title":"Approximation of a Sum by a Definite Integral"},{"page":503,"title":"Floor and Ceiling Formulas"},{"page":503,"title":"Miscellaneous"}]},{"page":505,"title":"APPENDIX B: Short Tutorial on Recurrence Relations","children":[{"page":505,"title":"Sequences and Recurrence Relations"},{"page":506,"title":"Methods for Solving Recurrence Relations"},{"page":511,"title":"Common Recurrence Types in Algorithm Analysis"}]},{"page":519,"title":"References"},{"page":529,"title":"Hints to Exercises"},{"page":573,"title":"Index","children":[{"page":573,"title":"A"},{"page":574,"title":"B"},{"page":576,"title":"C"},{"page":577,"title":"D"},{"page":578,"title":"E"},{"page":579,"title":"F"},{"page":580,"title":"G"},{"page":581,"title":"H"},{"page":581,"title":"I"},{"page":582,"title":"J"},{"page":582,"title":"K"},{"page":582,"title":"L"},{"page":584,"title":"M"},{"page":585,"title":"N"},{"page":585,"title":"O"},{"page":585,"title":"P"},{"page":588,"title":"Q"},{"page":588,"title":"R"},{"page":588,"title":"S"},{"page":590,"title":"T"},{"page":590,"title":"U"},{"page":591,"title":"V"},{"page":591,"title":"W"}]}],"pages_count":592,"version":"6.15.2","dir":"ltr","state":"converting","token":"4a8b03583f119702","status":"SUCCEED","pages_count_fa":"۵۹۲"},"publisher":{"id":105,"title":"Pearson","description":null,"logo":null,"token":"4e9e4a99eea1a798","slug":"Pearson"},"tags":[{"title":"algorithms","token":"cd7cf7ad54e27c11","pivot":{"taggable_id":573,"tag_id":2731}},{"title":"طراحی الگوریتم","token":"2cce625e6845ad2d","pivot":{"taggable_id":573,"tag_id":2732}}],"study_subjects":[{"id":26035,"title":"طراحی الگوریتم ها","meta_title":"طراحی الگوریتم ها","meta_description":"طراحی الگوریتم ها - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"05ba630232278efd","type":"","books_count":5,"created_at":"2017-10-07 11:39:18","updated_at":"2022-11-27 13:23:09","study_fields":[{"id":898,"title":"مهندسی کامپیوتر","meta_title":"مهندسی کامپیوتر","meta_description":"مهندسی کامپیوتر - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"57bea94f4a51f6b8","books_count":33,"created_at":"2017-10-07 11:22:53","updated_at":"2024-11-22 18:27:59","study_groups":[{"id":10,"title":"فنی و مهندسی","meta_title":"فنی و مهندسی","meta_description":"فنی و مهندسی - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"cd075d6bdb3fbd29","style":{"first_color":"#F47820","second_color":"#F47820","icon":"images/categories/mohandesi.png"},"books_count":749,"created_at":"2017-10-07 11:22:44","updated_at":"2025-01-13 02:03:18"}]}]}],"study_fields":[{"id":898,"title":"مهندسی کامپیوتر","meta_title":"مهندسی کامپیوتر","meta_description":"مهندسی کامپیوتر - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"57bea94f4a51f6b8","books_count":33,"created_at":"2017-10-07 11:22:53","updated_at":"2024-11-22 18:27:59","study_groups":[{"id":10,"title":"فنی و مهندسی","meta_title":"فنی و مهندسی","meta_description":"فنی و مهندسی - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"cd075d6bdb3fbd29","style":{"first_color":"#F47820","second_color":"#F47820","icon":"images/categories/mohandesi.png"},"books_count":749,"created_at":"2017-10-07 11:22:44","updated_at":"2025-01-13 02:03:18"}]}],"study_groups":[{"id":10,"title":"فنی و مهندسی","meta_title":"فنی و مهندسی","meta_description":"فنی و مهندسی - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"cd075d6bdb3fbd29","style":{"first_color":"#F47820","second_color":"#F47820","icon":"images/categories/mohandesi.png"},"books_count":749,"created_at":"2017-10-07 11:22:44","updated_at":"2025-01-13 02:03:18"}],"views":1,"price_fa":"۷","titleLink":"Introduction-to-The-Design-and-Analysis-of-Algorithms","urlify":"Introduction-to-The-Design-and-Analysis-of-Algorithms","pages_count_fa":"۵۹۲","previews":null,"score":0}],"titleLink":"Introduction-to-The-Design-and-Analysis-of-Algorithms","simpleDescription":"Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a truly innovative manner. Written in a reader-friendly style, the book encourages broad problem-solving skills while thoroughly covering the material required for introductory algorithms. The author emphasizes conceptual understanding before the introduction of the formal treatment of each technique. Popular puzzles are used to motivate readers' interest and strengthen their skills in algorithmic problem solving. Other enhancement features include chapter summaries, hints to the exercises, and a solution manual. For those interested in learning more about algorithms.","ebook_price_en":7,"print_price_en":-1,"urlify":"Introduction-to-The-Design-and-Analysis-of-Algorithms","pages_count_fa":"۵۹۲","authorTitle":"Anany Levitin","backLinks":[{"sefr":{"link":"/","title":"بوکت"},"yek":{"link":"/study-group/10/%D9%81%D9%86%DB%8C-%D9%88-%D9%85%D9%87%D9%86%D8%AF%D8%B3%DB%8C","title":"فنی و مهندسی"},"do":{"link":"/study-field/898/%D9%85%D9%87%D9%86%D8%AF%D8%B3%DB%8C-%DA%A9%D8%A7%D9%85%D9%BE%DB%8C%D9%88%D8%AA%D8%B1","title":"مهندسی کامپیوتر"},"se":{"link":"/study-subject/26035/%D8%B7%D8%B1%D8%A7%D8%AD%DB%8C-%D8%A7%D9%84%DA%AF%D9%88%D8%B1%DB%8C%D8%AA%D9%85-%D9%87%D8%A7","title":"طراحی الگوریتم ها"}}],"tocStr":"Copyright Page, Title Page, Brief Contents, Contents, New to the Third Edition, Preface, Acknowledgments, 1 Introduction, 2 Fundamentals of the Analysis of Algorithm Efficiency, 3 Brute Force and Exhaustive Search, 4 Decrease-and-Conquer, 5 Divide-and-Conquer, 6 Transform-and-Conquer, 7 Space and Time Trade-Offs, 8 Dynamic Programming, 9 Greedy Technique, 10 Iterative Improvement, 11 Limitations of Algorithm Power, 12 Coping with the Limitations of Algorithm Power, Epilogue, APPENDIX A: Useful Formulas for the Analysis of Algorithms, APPENDIX B: Short Tutorial on Recurrence Relations, References, Hints to Exercises, Index","url":"/books/4a8b03583f119702/Introduction-to-The-Design-and-Analysis-of-Algorithms","ScapedDescription":" Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a truly innovative manner. Written in a reader-friendly style, the book encourages broad problem-solving skills while thoroughly covering the material required for introductory algorithms. The author emphasizes conceptual understanding before the introduction of the formal treatment of each technique. Popular puzzles are used to motivate readers' interest and strengthen their skills in algorithmic problem solving. Other enhancement features include chapter summaries, hints to the exercises, and a solution manual. For those interested in learning more about algorithms.","faq":[{"question":" نسخه چاپی کتاب Introduction to The Design and Analysis of Algorithms چه قیمتی دارد ؟ ","answer":" نسخه چاپی موجود نمی باشد "},{"question":" نویسندگان کتاب Introduction to The Design and Analysis of Algorithms ؟ ","answer":" Anany Levitin "},{"question":" درباره کتاب Introduction to The Design and Analysis of Algorithms ؟ ","answer":" Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a truly innovative manner. Written in a reader-friendly style, the book encourages broad problem-solving skills while thoroughly covering the material required for introductory algorithms. The author emphasizes conceptual understanding before the introduction of the formal treatment of each technique. Popular puzzles are used to motivate readers' interest and strengthen their skills in algorithmic problem solving. Other enhancement features include chapter summaries, hints to the exercises, and a solution manual. For those interested in learning more about algorithms."},{"question":" کتاب Introduction to The Design and Analysis of Algorithms در چه سالی چاپ شده است ؟ ","answer":"۲۰۱۱"},{"question":" ناشر کتاب Introduction to The Design and Analysis of Algorithms چه کسی است ؟ ","answer":"Pearson"},{"question":" کتاب Introduction to The Design and Analysis of Algorithms در چه پلتفرم هایی قابل مطالعه است ؟ ","answer":"قابل مطالعه فقط در پلتفرم‌های بوکت"},{"question":" شابک کتاب Introduction to The Design and Analysis of Algorithms چیست ؟ ","answer":"9780132316811"}]}