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":34,"created_at":"2017-10-07 11:22:53","updated_at":"2024-11-19 16:43:27","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":748,"created_at":"2017-10-07 11:22:44","updated_at":"2024-11-20 11:07:21","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":34,"created_at":"2017-10-07 11:22:53","updated_at":"2024-11-19 16:43:27","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":748,"created_at":"2017-10-07 11:22:44","updated_at":"2024-11-20 11:07:21","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":748,"created_at":"2017-10-07 11:22:44","updated_at":"2024-11-20 11:07:21","titleLink":"%D9%81%D9%86%DB%8C-%D9%88-%D9%85%D9%87%D9%86%D8%AF%D8%B3%DB%8C"}],"views":1,"similarBooks":[],"publisherBooks":[{"title":"Digital Design Morris Mano Fifth Edition","price":12,"ebook_price":"۱۲","rent_3_price":"۱۰","rent_6_price":"۴","rent_12_price":"-۱","print_price":"-۱","front_cover":{"thumbnail":"/storage/files/styles/thumbnail/books/68d3fec6728e6da4/front.jpg","medium":"/storage/files/styles/medium/books/68d3fec6728e6da4/front.jpg","medium_rounded":"/storage/files/styles/medium_rounded/books/68d3fec6728e6da4/front.png","large":"/storage/files/styles/large/books/68d3fec6728e6da4/front.jpg","medium_trans":"/storage/files/styles/medium_trans/books/68d3fec6728e6da4/front.png","medium_zoom_fit":"/storage/files/styles/medium_zoom_fit/books/68d3fec6728e6da4/front.png"},"back_cover":{"thumbnail":"/storage/files/styles/thumbnail/books/68d3fec6728e6da4/back.jpg","medium":"/storage/files/styles/medium/books/68d3fec6728e6da4/back.jpg","medium_rounded":"/storage/files/styles/medium_rounded/books/68d3fec6728e6da4/back.png","large":"/storage/files/styles/large/books/68d3fec6728e6da4/back.jpg","medium_trans":"/storage/files/styles/medium_trans/books/68d3fec6728e6da4/back.png","medium_zoom_fit":"/storage/files/styles/medium_zoom_fit/books/68d3fec6728e6da4/back.png"},"print_book":false,"isbn":"9780132774208","lang":"null","cover_type":"null","dimension":"null","year":2012,"nobat_chap":1,"description":"Digital Design, fifth edition is a modern update of the classic authoritative text on digital design. This book teaches the basic concepts of digital design in a clear, accessible manner. The book pr...","pages_count":563,"token":"68d3fec6728e6da4","deleted_at":null,"published_at":"2017-12-12 14:48:36","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":1068,"title":"Morris Mano","meta_title":"Morris Mano","meta_description":"Morris Mano - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"firstname":"Morris","lastname":"Mano","token":"70eae4f2ca251b31","national_code":null,"pivot":{"book_id":581,"author_id":1068,"created_at":"2017-12-09 19:55:24","updated_at":"2019-03-12 15:13:43","role":"writer"}},{"id":1070,"title":"Michael Ciletti","meta_title":"Michael Ciletti","meta_description":"Michael Ciletti - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"firstname":"Michael","lastname":"Ciletti","token":"aa3bcd5944ec153c","national_code":null,"pivot":{"book_id":581,"author_id":1070,"created_at":"2017-12-09 19:55:24","updated_at":"2019-03-12 15:13:43","role":"writer"}}],"translator_authors":[],"available_e_book":true,"dir":true,"vitrines":[{"title":"کتاب‌های مشابه","url":"/api/bookstore/vitrines/similar-books/68d3fec6728e6da4","type":"books","books":[]},{"title":"کتاب‌های دیگر ناشر","url":"/api/bookstore/vitrines/publisher-books/68d3fec6728e6da4","type":"books","books":[]}],"authors":[{"id":1068,"title":"Morris Mano","meta_title":"Morris Mano","meta_description":"Morris Mano - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"firstname":"Morris","lastname":"Mano","token":"70eae4f2ca251b31","national_code":null,"pivot":{"book_id":581,"author_id":1068,"created_at":"2017-12-09 19:55:24","updated_at":"2019-03-12 15:13:43","role":"writer"}},{"id":1070,"title":"Michael Ciletti","meta_title":"Michael Ciletti","meta_description":"Michael Ciletti - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"firstname":"Michael","lastname":"Ciletti","token":"aa3bcd5944ec153c","national_code":null,"pivot":{"book_id":581,"author_id":1070,"created_at":"2017-12-09 19:55:24","updated_at":"2019-03-12 15:13:43","role":"writer"}}],"e_book":{"toc":[{"page":2,"title":"Title Page"},{"page":3,"title":"Copyright Page"},{"page":4,"title":"Contents"},{"page":8,"title":"Preface"},{"page":16,"title":"1 Digital Systems and Binary Numbers","children":[{"page":16,"title":"1.1 Digital Systems"},{"page":18,"title":"1.2 Binary Numbers"},{"page":21,"title":"1.3 Number-Base Conversions"},{"page":23,"title":"1.4 Octal and Hexadecimal Numbers"},{"page":25,"title":"1.5 Complements of Numbers"},{"page":29,"title":"1.6 Signed Binary Numbers"},{"page":33,"title":"1.7 Binary Codes"},{"page":42,"title":"1.8 Binary Storage and Registers"},{"page":45,"title":"1.9 Binary Logic"}]},{"page":53,"title":"2 Boolean Algebra and Logic Gates","children":[{"page":53,"title":"2.1 Introduction"},{"page":53,"title":"2.2 Basic Definitions"},{"page":55,"title":"2.3 Axiomatic Definition of Boolean Algebra"},{"page":58,"title":"2.4 Basic Theorems and Properties of Boolean Algebra"},{"page":61,"title":"2.5 Boolean Functions"},{"page":66,"title":"2.6 Canonical and Standard Forms"},{"page":73,"title":"2.7 Other Logic Operations"},{"page":75,"title":"2.8 Digital Logic Gates"},{"page":81,"title":"2.9 Integrated Circuits"}]},{"page":88,"title":"3 Gate-Level Minimization","children":[{"page":88,"title":"3.1 Introduction"},{"page":88,"title":"3.2 The Map Method"},{"page":95,"title":"3.3 Four-Variable K-Map"},{"page":99,"title":"3.4 Product-of-Sums Simplification"},{"page":103,"title":"3.5 Don't-Care Conditions"},{"page":105,"title":"3.6 NAND and NOR Implementation"},{"page":112,"title":"3.7 Other Two-Level Implementations"},{"page":118,"title":"3.8 Exclusive-OR Function"},{"page":123,"title":"3.9 Hardware Description Language"}]},{"page":140,"title":"4 Combinational Logic","children":[{"page":140,"title":"4.1 Introduction"},{"page":140,"title":"4.2 Combinational Circuits"},{"page":141,"title":"4.3 Analysis Procedure"},{"page":144,"title":"4.4 Design Procedure"},{"page":148,"title":"4.5 Binary Adder–Subtractor"},{"page":159,"title":"4.6 Decimal Adder"},{"page":161,"title":"4.7 Binary Multiplier"},{"page":163,"title":"4.8 Magnitude Comparator"},{"page":165,"title":"4.9 Decoders"},{"page":170,"title":"4.10 Encoders"},{"page":173,"title":"4.11 Multiplexers"},{"page":179,"title":"4.12 HDL Models of Combinational Circuits"}]},{"page":205,"title":"5 Synchronous Sequential Logic","children":[{"page":205,"title":"5.1 Introduction"},{"page":205,"title":"5.2 Sequential Circuits"},{"page":208,"title":"5.3 Storage Elements: Latches"},{"page":211,"title":"5.4 Storage Elements: Flip-Flops"},{"page":219,"title":"5.5 Analysis of Clocked Sequential Circuits"},{"page":232,"title":"5.6 Synthesizable HDL Models of Sequential Circuits"},{"page":246,"title":"5.7 State Reduction and Assignment"},{"page":251,"title":"5.8 Design Procedure"}]},{"page":270,"title":"6 Registers and Counters","children":[{"page":270,"title":"6.1 Registers"},{"page":273,"title":"6.2 Shift Registers"},{"page":281,"title":"6.3 Ripple Counters"},{"page":286,"title":"6.4 Synchronous Counters"},{"page":293,"title":"6.5 Other Counters"},{"page":298,"title":"6.6 HDL for Registers and Counters"}]},{"page":314,"title":"7 Memory and Programmable Logic","children":[{"page":314,"title":"7.1 Introduction"},{"page":315,"title":"7.2 Random-Access Memory"},{"page":322,"title":"7.3 Memory Decoding"},{"page":327,"title":"7.4 Error Detection and Correction"},{"page":330,"title":"7.5 Read-Only Memory"},{"page":336,"title":"7.6 Programmable Logic Array"},{"page":340,"title":"7.7 Programmable Array Logic"},{"page":344,"title":"7.8 Sequential Programmable Devices"}]},{"page":366,"title":"8 Design at the Register Transfer Level","children":[{"page":366,"title":"8.1 Introduction"},{"page":366,"title":"8.2 Register Transfer Level Notation"},{"page":369,"title":"8.3 Register Transfer Level in HDL"},{"page":378,"title":"8.4 Algorithmic State Machines (ASMs)"},{"page":386,"title":"8.5 Design Example (ASMD Chart)"},{"page":396,"title":"8.6 HDL Description of Design Example"},{"page":406,"title":"8.7 Sequential Binary Multiplier"},{"page":411,"title":"8.8 Control Logic"},{"page":417,"title":"8.9 HDL Description of Binary Multiplier"},{"page":426,"title":"8.10 Design with Multiplexers"},{"page":437,"title":"8.11 Race-Free Design (Software Race Conditions)"},{"page":440,"title":"8.12 Latch-Free Design (Why Waste Silicon?)"},{"page":441,"title":"8.13 Other Language Features"}]},{"page":453,"title":"9 Laboratory Experiments with Standard ICs and FPGAs","children":[{"page":453,"title":"9.1 Introduction to Experiments"},{"page":458,"title":"9.2 Experiment 1: Binary and Decimal Numbers"},{"page":461,"title":"9.3 Experiment 2: Digital Logic Gates"},{"page":463,"title":"9.4 Experiment 3: Simplification of Boolean Functions"},{"page":465,"title":"9.5 Experiment 4: Combinational Circuits"},{"page":467,"title":"9.6 Experiment 5: Code Converters"},{"page":468,"title":"9.7 Experiment 6: Design with Multiplexers"},{"page":470,"title":"9.8 Experiment 7: Adders and Subtractors"},{"page":472,"title":"9.9 Experiment 8: Flip-Flops"},{"page":475,"title":"9.10 Experiment 9: Sequential Circuits"},{"page":476,"title":"9.11 Experiment 10: Counters"},{"page":478,"title":"9.12 Experiment 11: Shift Registers"},{"page":481,"title":"9.13 Experiment 12: Serial Addition"},{"page":482,"title":"9.14 Experiment 13: Memory Unit"},{"page":484,"title":"9.15 Experiment 14: Lamp Handball"},{"page":488,"title":"9.16 Experiment 15: Clock-Pulse Generator"},{"page":490,"title":"9.17 Experiment 16: Parallel Adder and Accumulator"},{"page":493,"title":"9.18 Experiment 17: Binary Multiplier"},{"page":495,"title":"9.19 Verilog HDL Simulation Experiments and Rapid Prototyping with FPGAs"}]},{"page":503,"title":"10 Standard Graphic Symbols","children":[{"page":503,"title":"10.1 Rectangular-Shape Symbols"},{"page":506,"title":"10.2 Qualifying Symbols"},{"page":508,"title":"10.3 Dependency Notation"},{"page":510,"title":"10.4 Symbols for Combinational Elements"},{"page":512,"title":"10.5 Symbols for Flip-Flops"},{"page":514,"title":"10.6 Symbols for Registers"},{"page":517,"title":"10.7 Symbols for Counters"},{"page":519,"title":"10.8 Symbol for RAM"}]},{"page":522,"title":"Appendix"},{"page":536,"title":"Answers to Selected Problems"},{"page":554,"title":"Index","children":[{"page":554,"title":"A"},{"page":554,"title":"B"},{"page":555,"title":"C"},{"page":556,"title":"D"},{"page":556,"title":"E"},{"page":557,"title":"F"},{"page":557,"title":"G"},{"page":557,"title":"H"},{"page":557,"title":"I"},{"page":558,"title":"J"},{"page":558,"title":"K"},{"page":558,"title":"L"},{"page":559,"title":"M"},{"page":559,"title":"N"},{"page":559,"title":"O"},{"page":559,"title":"P"},{"page":559,"title":"Q"},{"page":560,"title":"R"},{"page":560,"title":"S"},{"page":561,"title":"T"},{"page":561,"title":"U"},{"page":561,"title":"V"},{"page":562,"title":"W"},{"page":562,"title":"X"}]}],"pages_count":563,"version":"6.15.2","dir":"ltr","state":"converting","token":"68d3fec6728e6da4","status":"SUCCEED","pages_count_fa":"۵۶۳"},"publisher":{"id":105,"title":"Pearson","description":null,"logo":null,"token":"4e9e4a99eea1a798","slug":"Pearson"},"tags":[{"title":"اصول سیستم","token":"d3b7a9d21290459e","pivot":{"taggable_id":581,"tag_id":2745}}],"study_subjects":[{"id":2773,"title":"اصول سیستمهای عامل","meta_title":"اصول سیستمهای عامل","meta_description":"اصول سیستمهای عامل - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"1b37a6d5112ff4fc","type":"","books_count":1,"created_at":"2017-10-07 11:24:20","updated_at":"2017-12-12 14:48:36","study_fields":[{"id":1168,"title":"علوم کامپیوتر","meta_title":"علوم کامپیوتر","meta_description":"علوم کامپیوتر - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"4822f290d609f762","books_count":20,"created_at":"2017-10-07 11:22:55","updated_at":"2022-11-27 11:27:51","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":748,"created_at":"2017-10-07 11:22:44","updated_at":"2024-11-20 11:07:21"}]}]},{"id":2776,"title":"اصول سیستمهای کامپیوتری","meta_title":"اصول سیستمهای کامپیوتری","meta_description":"اصول سیستمهای کامپیوتری - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"417ebd094fad5426","type":"","books_count":11,"created_at":"2017-10-07 11:24:20","updated_at":"2022-11-27 11:27:51","study_fields":[{"id":1168,"title":"علوم کامپیوتر","meta_title":"علوم کامپیوتر","meta_description":"علوم کامپیوتر - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"4822f290d609f762","books_count":20,"created_at":"2017-10-07 11:22:55","updated_at":"2022-11-27 11:27:51","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":748,"created_at":"2017-10-07 11:22:44","updated_at":"2024-11-20 11:07:21"}]}]}],"study_fields":[{"id":1168,"title":"علوم کامپیوتر","meta_title":"علوم کامپیوتر","meta_description":"علوم کامپیوتر - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"4822f290d609f762","books_count":20,"created_at":"2017-10-07 11:22:55","updated_at":"2022-11-27 11:27:51","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":748,"created_at":"2017-10-07 11:22:44","updated_at":"2024-11-20 11:07:21"}]}],"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":748,"created_at":"2017-10-07 11:22:44","updated_at":"2024-11-20 11:07:21"}],"views":1,"price_fa":"۱۲","titleLink":"Digital-Design-Morris-Mano-Fifth-Edition","urlify":"Digital-Design-Morris-Mano-Fifth-Edition","pages_count_fa":"۵۶۳","previews":null,"score":0},{"title":"Fundamentals of Database Systems","price":21,"ebook_price":"۲۱","rent_3_price":"۱۷","rent_6_price":"۷","rent_12_price":"-۱","print_price":"-۱","front_cover":{"thumbnail":"/storage/files/styles/thumbnail/books/494399539ca2ade4/front.jpg","medium":"/storage/files/styles/medium/books/494399539ca2ade4/front.jpg","medium_rounded":"/storage/files/styles/medium_rounded/books/494399539ca2ade4/front.png","large":"/storage/files/styles/large/books/494399539ca2ade4/front.jpg","medium_trans":"/storage/files/styles/medium_trans/books/494399539ca2ade4/front.png","medium_zoom_fit":"/storage/files/styles/medium_zoom_fit/books/494399539ca2ade4/front.png"},"back_cover":{"thumbnail":"/storage/files/styles/thumbnail/books/494399539ca2ade4/back.jpg","medium":"/storage/files/styles/medium/books/494399539ca2ade4/back.jpg","medium_rounded":"/storage/files/styles/medium_rounded/books/494399539ca2ade4/back.png","large":"/storage/files/styles/large/books/494399539ca2ade4/back.jpg","medium_trans":"/storage/files/styles/medium_trans/books/494399539ca2ade4/back.png","medium_zoom_fit":"/storage/files/styles/medium_zoom_fit/books/494399539ca2ade4/back.png"},"print_book":false,"isbn":"9780136086208","lang":"null","cover_type":"null","dimension":"null","year":2010,"nobat_chap":1,"description":"Clear explanations of theory and design, broad coverage of models and real systems, and an up-to-date introduction to modern database technologies result in a leading introduction to database systems....","pages_count":1200,"token":"494399539ca2ade4","deleted_at":null,"published_at":"2017-12-12 14:49:26","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":1083,"title":"Ramez Elmasri","meta_title":"Ramez Elmasri","meta_description":"Ramez Elmasri - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"firstname":"Ramez","lastname":"Elmasri","token":"994e2d93a6bf81f8","national_code":null,"pivot":{"book_id":584,"author_id":1083,"created_at":"2017-12-09 20:08:27","updated_at":"2019-03-12 15:14:06","role":"writer"}},{"id":1085,"title":"Shamkant Navathe","meta_title":"Shamkant Navathe","meta_description":"Shamkant Navathe - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"firstname":"Shamkant","lastname":"Navathe","token":"47196294e465e032","national_code":null,"pivot":{"book_id":584,"author_id":1085,"created_at":"2017-12-09 20:08:27","updated_at":"2019-03-12 15:14:06","role":"writer"}}],"translator_authors":[],"available_e_book":true,"dir":true,"vitrines":[{"title":"کتاب‌های مشابه","url":"/api/bookstore/vitrines/similar-books/494399539ca2ade4","type":"books","books":[]},{"title":"کتاب‌های دیگر ناشر","url":"/api/bookstore/vitrines/publisher-books/494399539ca2ade4","type":"books","books":[]}],"authors":[{"id":1083,"title":"Ramez Elmasri","meta_title":"Ramez Elmasri","meta_description":"Ramez Elmasri - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"firstname":"Ramez","lastname":"Elmasri","token":"994e2d93a6bf81f8","national_code":null,"pivot":{"book_id":584,"author_id":1083,"created_at":"2017-12-09 20:08:27","updated_at":"2019-03-12 15:14:06","role":"writer"}},{"id":1085,"title":"Shamkant Navathe","meta_title":"Shamkant Navathe","meta_description":"Shamkant Navathe - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"firstname":"Shamkant","lastname":"Navathe","token":"47196294e465e032","national_code":null,"pivot":{"book_id":584,"author_id":1085,"created_at":"2017-12-09 20:08:27","updated_at":"2019-03-12 15:14:06","role":"writer"}}],"e_book":{"toc":[{"page":2,"title":"Title Page\u0000\u0000\u0000\u0000\u0000\u0000\u0000\u0000\u0000\u0000\u0000\u0000\u0000\u0000\u0000\u0000\u0000"},{"page":3,"title":"Copyright\u0000\u0000\u0000\u0000\u0000\u0000\u0000\u0000\u0000\u0000\u0000\u0000\u0000\u0000\u0000\u0000"},{"page":14,"title":"Contents"},{"page":28,"title":"Part 1 Introduction to Databases","children":[{"page":30,"title":"Chapter 1 Databases and Database Users","children":[{"page":31,"title":"1.1 Introduction"},{"page":33,"title":"1.2 An Example"},{"page":36,"title":"1.3 Characteristics of the Database Approach"},{"page":41,"title":"1.4 Actors on the Scene"},{"page":43,"title":"1.5 Workers behind the Scene"},{"page":44,"title":"1.6 Advantages of Using the DBMS Approach"},{"page":50,"title":"1.7 A Brief History of Database Applications"},{"page":53,"title":"1.8 When Not to Use a DBMS"},{"page":54,"title":"1.9 Summary"},{"page":54,"title":"Review Questions"},{"page":55,"title":"Exercises"},{"page":55,"title":"Selected Bibliography"}]},{"page":56,"title":"Chapter 2 Database System Concepts and Architecture","children":[{"page":57,"title":"2.1 Data Models, Schemas, and Instances"},{"page":60,"title":"2.2 Three-Schema Architecture and Data Independence"},{"page":63,"title":"2.3 Database Languages and Interfaces"},{"page":67,"title":"2.4 The Database System Environment"},{"page":71,"title":"2.5 Centralized and Client/Server Architectures for DBMSs"},{"page":76,"title":"2.6 Classification of Database Management Systems"},{"page":79,"title":"2.7 Summary"},{"page":80,"title":"Review Questions"},{"page":81,"title":"Exercises"},{"page":82,"title":"Selected Bibliography"}]}]},{"page":84,"title":"Part 2 The Relational Data Model and SQL","children":[{"page":86,"title":"Chapter 3 The Relational Data Model and Relational Database Constraints","children":[{"page":87,"title":"3.1 Relational Model Concepts"},{"page":94,"title":"3.2 Relational Model Constraints and Relational Database Schemas"},{"page":102,"title":"3.3 Update Operations, Transactions, and Dealing with Constraint Violations"},{"page":106,"title":"3.4 Summary"},{"page":107,"title":"Review Questions"},{"page":107,"title":"Exercises"},{"page":112,"title":"Selected Bibliography"}]},{"page":114,"title":"Chapter 4 Basic SQL","children":[{"page":116,"title":"4.1 SQL Data Definition and Data Types"},{"page":121,"title":"4.2 Specifying Constraints in SQL"},{"page":124,"title":"4.3 Basic Retrieval Queries in SQL"},{"page":134,"title":"4.4 INSERT, DELETE, and UPDATE Statements in SQL"},{"page":137,"title":"4.5 Additional Features of SQL"},{"page":138,"title":"4.6 Summary"},{"page":139,"title":"Review Questions"},{"page":139,"title":"Exercises"},{"page":141,"title":"Selected Bibliography"}]},{"page":142,"title":"Chapter 5 More SQL: Complex Queries, Triggers, Views, and Schema Modification","children":[{"page":142,"title":"5.1 More Complex SQL Retrieval Queries"},{"page":158,"title":"5.2 Specifying Constraints as Assertions and Actions as Triggers"},{"page":160,"title":"5.3 Views (Virtual Tables) in SQL"},{"page":164,"title":"5.4 Schema Change Statements in SQL"},{"page":166,"title":"5.5 Summary"},{"page":168,"title":"Review Questions"},{"page":168,"title":"Exercises"},{"page":170,"title":"Selected Bibliography"}]},{"page":172,"title":"Chapter 6 The Relational Algebra and Relational Calculus","children":[{"page":174,"title":"6.1 Unary Relational Operations: SELECT and PROJECT"},{"page":179,"title":"6.2 Relational Algebra Operations from Set Theory"},{"page":184,"title":"6.3 Binary Relational Operations: JOIN and DIVISION"},{"page":192,"title":"6.4 Additional Relational Operations"},{"page":198,"title":"6.5 Examples of Queries in Relational Algebra"},{"page":201,"title":"6.6 The Tuple Relational Calculus"},{"page":210,"title":"6.7 The Domain Relational Calculus"},{"page":212,"title":"6.8 Summary"},{"page":213,"title":"Review Questions"},{"page":214,"title":"Exercises"},{"page":219,"title":"Laboratory Exercises"},{"page":221,"title":"Selected Bibliography"}]}]},{"page":224,"title":"Part 3 Conceptual Modeling and Database Design","children":[{"page":226,"title":"Chapter 7 Data Modeling Using the Entity-Relationship (ER) Model","children":[{"page":227,"title":"7.1 Using High-Level Conceptual Data Models for Database Design"},{"page":229,"title":"7.2 A Sample Database Application"},{"page":230,"title":"7.3 Entity Types, Entity Sets, Attributes, and Keys"},{"page":239,"title":"7.4 Relationship Types, Relationship Sets, Roles, and Structural Constraints"},{"page":246,"title":"7.5 Weak Entity Types"},{"page":247,"title":"7.6 Refining the ER Design for the COMPANY Database"},{"page":248,"title":"7.7 ER Diagrams, Naming Conventions, and Design Issues"},{"page":253,"title":"7.8 Example of Other Notation: UML Class Diagrams"},{"page":255,"title":"7.9 Relationship Types of Degree Higher than Two"},{"page":259,"title":"7.10 Summary"},{"page":261,"title":"Review Questions"},{"page":261,"title":"Exercises"},{"page":268,"title":"Laboratory Exercises"},{"page":270,"title":"Selected Bibliography"}]},{"page":272,"title":"Chapter 8 The Enhanced Entity-Relationship (EER) Model","children":[{"page":273,"title":"8.1 Subclasses, Superclasses, and Inheritance"},{"page":275,"title":"8.2 Specialization and Generalization"},{"page":278,"title":"8.3 Constraints and Characteristics of Specialization and Generalization Hierarchies"},{"page":285,"title":"8.4 Modeling of UNION Types Using Categories"},{"page":287,"title":"8.5 A Sample UNIVERSITY EER Schema, Design Choices, and Formal Definitions"},{"page":292,"title":"8.6 Example of Other Notation: Representing Specialization and Generalization in UML Class Diagrams"},{"page":294,"title":"8.7 Data Abstraction, Knowledge Representation, and Ontology Concepts"},{"page":300,"title":"8.8 Summary"},{"page":300,"title":"Review Questions"},{"page":301,"title":"Exercises"},{"page":308,"title":"Laboratory Exercises"},{"page":311,"title":"Selected Bibliography"}]},{"page":312,"title":"Chapter 9 Relational Database Design by ER- and EER-to-Relational Mapping","children":[{"page":313,"title":"9.1 Relational Database Design Using ER-to-Relational Mapping"},{"page":321,"title":"9.2 Mapping EER Model Constructs to Relations"},{"page":326,"title":"9.3 Summary"},{"page":326,"title":"Review Questions"},{"page":326,"title":"Exercises"},{"page":328,"title":"Laboratory Exercises"},{"page":329,"title":"Selected Bibliography"}]},{"page":330,"title":"Chapter 10 Practical Database Design Methodology and Use of UML Diagrams","children":[{"page":331,"title":"10.1 The Role of Information Systems in Organizations"},{"page":336,"title":"10.2 The Database Design and Implementation Process"},{"page":355,"title":"10.3 Use of UML Diagrams as an Aid to Database Design Specification"},{"page":364,"title":"10.4 Rational Rose: A UML-Based Design Tool"},{"page":369,"title":"10.5 Automated Database Design Tools"},{"page":372,"title":"10.6 Summary"},{"page":374,"title":"Review Questions"},{"page":375,"title":"Selected Bibliography"}]}]},{"page":378,"title":"Part 4 Object, Object-Relational, and XML: Concepts, Models, Languages, and Standards","children":[{"page":380,"title":"Chapter 11 Object and Object-Relational Databases","children":[{"page":382,"title":"11.1 Overview of Object Database Concepts"},{"page":396,"title":"11.2 Object-Relational Features: Object Database Extensions to SQL"},{"page":403,"title":"11.3 The ODMG Object Model and the Object Definition Language ODL"},{"page":422,"title":"11.4 Object Database Conceptual Design"},{"page":425,"title":"11.5 The Object Query Language OQL"},{"page":434,"title":"11.6 Overview of the C++ Language Binding in the ODMG Standard"},{"page":435,"title":"11.7 Summary"},{"page":436,"title":"Review Questions"},{"page":438,"title":"Exercises"},{"page":439,"title":"Selected Bibliography"}]},{"page":442,"title":"Chapter 12 XML: Extensible Markup Language","children":[{"page":443,"title":"12.1 Structured, Semistructured, and Unstructured Data"},{"page":447,"title":"12.2 XML Hierarchical (Tree) Data Model"},{"page":450,"title":"12.3 XML Documents, DTD, and XML Schema"},{"page":458,"title":"12.4 Storing and Extracting XML Documents from Databases"},{"page":459,"title":"12.5 XML Languages"},{"page":463,"title":"12.6 Extracting XML Documents from Relational Databases"},{"page":469,"title":"12.7 Summary"},{"page":469,"title":"Review Questions"},{"page":470,"title":"Exercises"},{"page":470,"title":"Selected Bibliography"}]}]},{"page":472,"title":"Part 5 Database Programming Techniques","children":[{"page":474,"title":"Chapter 13 Introduction to SQL Programming Techniques","children":[{"page":475,"title":"13.1 Database Programming: Techniques and Issues"},{"page":478,"title":"13.2 Embedded SQL, Dynamic SQL, and SQLJ"},{"page":491,"title":"13.3 Database Programming with Function Calls: SQL/CLI and JDBC"},{"page":500,"title":"13.4 Database Stored Procedures and SQL/PSM"},{"page":503,"title":"13.5 Comparing the Three Approaches"},{"page":504,"title":"13.6 Summary"},{"page":505,"title":"Review Questions"},{"page":505,"title":"Exercises"},{"page":506,"title":"Selected Bibliography"}]},{"page":508,"title":"Chapter 14 Web Database Programming Using PHP","children":[{"page":509,"title":"14.1 A Simple PHP Example"},{"page":511,"title":"14.2 Overview of Basic Features of PHP"},{"page":518,"title":"14.3 Overview of PHP Database Programming"},{"page":523,"title":"14.4 Summary"},{"page":523,"title":"Review Questions"},{"page":524,"title":"Exercises"},{"page":524,"title":"Selected Bibliography"}]}]},{"page":526,"title":"Part 6 Database Design Theory and Normalization","children":[{"page":528,"title":"Chapter 15 Basics of Functional Dependencies and Normalization for Relational Databases","children":[{"page":530,"title":"15.1 Informal Design Guidelines for Relation Schemas"},{"page":540,"title":"15.2 Functional Dependencies"},{"page":543,"title":"15.3 Normal Forms Based on Primary Keys"},{"page":552,"title":"15.4 General Definitions of Second and Third Normal Forms"},{"page":556,"title":"15.5 Boyce-Codd Normal Form"},{"page":558,"title":"15.6 Multivalued Dependency and Fourth Normal Form"},{"page":561,"title":"15.7 Join Dependencies and Fifth Normal Form"},{"page":562,"title":"15.8 Summary"},{"page":563,"title":"Review Questions"},{"page":564,"title":"Exercises"},{"page":569,"title":"Laboratory Exercises"},{"page":569,"title":"Selected Bibliography"}]},{"page":570,"title":"Chapter 16 Relational Database Design Algorithms and Further Dependencies","children":[{"page":572,"title":"16.1 Further Topics in Functional Dependencies: Inference Rules, Equivalence, and Minimal Cover"},{"page":578,"title":"16.2 Properties of Relational Decompositions"},{"page":584,"title":"16.3 Algorithms for Relational Database Schema Design"},{"page":590,"title":"16.4 About Nulls, Dangling Tuples, and Alternative Relational Designs"},{"page":594,"title":"16.5 Further Discussion of Multivalued Dependencies and 4NF"},{"page":598,"title":"16.6 Other Dependencies and Normal Forms"},{"page":602,"title":"16.7 Summary"},{"page":603,"title":"Review Questions"},{"page":604,"title":"Exercises"},{"page":605,"title":"Laboratory Exercises"},{"page":606,"title":"Selected Bibliography"}]}]},{"page":608,"title":"Part 7 File Structures, Indexing, and Hashing","children":[{"page":610,"title":"Chapter 17 Disk Storage, Basic File Structures, and Hashing","children":[{"page":611,"title":"17.1 Introduction"},{"page":614,"title":"17.2 Secondary Storage Devices"},{"page":620,"title":"17.3 Buffering of Blocks"},{"page":621,"title":"17.4 Placing File Records on Disk"},{"page":626,"title":"17.5 Operations on Files"},{"page":628,"title":"17.6 Files of Unordered Records (Heap Files)"},{"page":630,"title":"17.7 Files of Ordered Records (Sorted Files)"},{"page":633,"title":"17.8 Hashing Techniques"},{"page":643,"title":"17.9 Other Primary File Organizations"},{"page":644,"title":"17.10 Parallelizing Disk Access Using RAID Technology"},{"page":648,"title":"17.11 New Storage Systems"},{"page":651,"title":"17.12 Summary"},{"page":652,"title":"Review Questions"},{"page":653,"title":"Exercises"},{"page":657,"title":"Selected Bibliography"}]},{"page":658,"title":"Chapter 18 Indexing Structures for Files","children":[{"page":659,"title":"18.1 Types of Single-Level Ordered Indexes"},{"page":670,"title":"18.2 Multilevel Indexes"},{"page":673,"title":"18.3 Dynamic Multilevel Indexes Using B-Trees and B+-Trees"},{"page":687,"title":"18.4 Indexes on Multiple Keys"},{"page":690,"title":"18.5 Other Types of Indexes"},{"page":695,"title":"18.6 Some General Issues Concerning Indexing"},{"page":697,"title":"18.7 Summary"},{"page":698,"title":"Review Questions"},{"page":699,"title":"Exercises"},{"page":701,"title":"Selected Bibliography"}]}]},{"page":704,"title":"Part 8 Query Processing and Optimization, and Database Tuning","children":[{"page":706,"title":"Chapter 19 Algorithms for Query Processing and Optimization","children":[{"page":708,"title":"19.1 Translating SQL Queries into Relational Algebra"},{"page":709,"title":"19.2 Algorithms for External Sorting"},{"page":712,"title":"19.3 Algorithms for SELECT and JOIN Operations"},{"page":723,"title":"19.4 Algorithms for PROJECT and Set Operations"},{"page":725,"title":"19.5 Implementing Aggregate Operations and OUTER JOINs"},{"page":727,"title":"19.6 Combining Operations Using Pipelining"},{"page":727,"title":"19.7 Using Heuristics in Query Optimization"},{"page":737,"title":"19.8 Using Selectivity and Cost Estimates in Query Optimization"},{"page":748,"title":"19.9 Overview of Query Optimization in Oracle"},{"page":749,"title":"19.10 Semantic Query Optimization"},{"page":750,"title":"19.11 Summary"},{"page":750,"title":"Review Questions"},{"page":751,"title":"Exercises"},{"page":752,"title":"Selected Bibliography"}]},{"page":754,"title":"Chapter 20 Physical Database Design and Tuning","children":[{"page":754,"title":"20.1 Physical Database Design in Relational Databases"},{"page":760,"title":"20.2 An Overview of Database Tuning in Relational Systems"},{"page":766,"title":"20.3 Summary"},{"page":766,"title":"Review Questions"},{"page":767,"title":"Selected Bibliography"}]}]},{"page":768,"title":"Part 9 Transaction Processing, Concurrency Control, and Recovery","children":[{"page":770,"title":"Chapter 21 Introduction to Transaction Processing Concepts and Theory","children":[{"page":771,"title":"21.1 Introduction to Transaction Processing"},{"page":778,"title":"21.2 Transaction and System Concepts"},{"page":781,"title":"21.3 Desirable Properties of Transactions"},{"page":782,"title":"21.4 Characterizing Schedules Based on Recoverability"},{"page":786,"title":"21.5 Characterizing Schedules Based on Serializability"},{"page":797,"title":"21.6 Transaction Support in SQL"},{"page":799,"title":"21.7 Summary"},{"page":799,"title":"Review Questions"},{"page":800,"title":"Exercises"},{"page":802,"title":"Selected Bibliography"}]},{"page":804,"title":"Chapter 22 Concurrency Control Techniques","children":[{"page":805,"title":"22.1 Two-Phase Locking Techniques for Concurrency Control"},{"page":815,"title":"22.2 Concurrency Control Based on Timestamp Ordering"},{"page":818,"title":"22.3 Multiversion Concurrency Control Techniques"},{"page":821,"title":"22.4 Validation (Optimistic) Concurrency Control Techniques"},{"page":822,"title":"22.5 Granularity of Data Items and Multiple Granularity Locking"},{"page":825,"title":"22.6 Using Locks for Concurrency Control in Indexes"},{"page":827,"title":"22.7 Other Concurrency Control Issues"},{"page":829,"title":"22.8 Summary"},{"page":830,"title":"Review Questions"},{"page":831,"title":"Exercises"},{"page":831,"title":"Selected Bibliography"}]},{"page":834,"title":"Chapter 23 Database Recovery Techniques","children":[{"page":835,"title":"23.1 Recovery Concepts"},{"page":842,"title":"23.2 NO-UNDO/REDO Recovery Based on Deferred Update"},{"page":844,"title":"23.3 Recovery Techniques Based on Immediate Update"},{"page":847,"title":"23.4 Shadow Paging"},{"page":848,"title":"23.5 The ARIES Recovery Algorithm"},{"page":852,"title":"23.6 Recovery in Multidatabase Systems"},{"page":853,"title":"23.7 Database Backup and Recovery from Catastrophic Failures"},{"page":854,"title":"23.8 Summary"},{"page":855,"title":"Review Questions"},{"page":856,"title":"Exercises"},{"page":859,"title":"Selected Bibliography"}]}]},{"page":860,"title":"Part 10 Additional Database Topics: Security and Distribution","children":[{"page":862,"title":"Chapter 24 Database Security","children":[{"page":863,"title":"24.1 Introduction to Database Security Issues"},{"page":869,"title":"24.2 Discretionary Access Control Based on Granting and Revoking Privileges"},{"page":874,"title":"24.3 Mandatory Access Control and Role-Based Access Control for Multilevel Security"},{"page":882,"title":"24.4 SQL Injection"},{"page":886,"title":"24.5 Introduction to Statistical Database Security"},{"page":887,"title":"24.6 Introduction to Flow Control"},{"page":889,"title":"24.7 Encryption and Public Key Infrastructures"},{"page":893,"title":"24.8 Privacy Issues and Preservation"},{"page":894,"title":"24.9 Challenges of Database Security"},{"page":895,"title":"24.10 Oracle Label-Based Security"},{"page":897,"title":"24.11 Summary"},{"page":899,"title":"Review Questions"},{"page":900,"title":"Exercises"},{"page":901,"title":"Selected Bibliography"}]},{"page":904,"title":"Chapter 25 Distributed Databases","children":[{"page":905,"title":"25.1 Distributed Database Concepts"},{"page":910,"title":"25.2 Types of Distributed Database Systems"},{"page":914,"title":"25.3 Distributed Database Architectures"},{"page":921,"title":"25.4 Data Fragmentation, Replication, and Allocation Techniques for Distributed Database Design"},{"page":928,"title":"25.5 Query Processing and Optimization in Distributed Databases"},{"page":934,"title":"25.6 Overview of Transaction Management in Distributed Databases"},{"page":936,"title":"25.7 Overview of Concurrency Control and Recovery in Distributed Databases"},{"page":940,"title":"25.8 Distributed Catalog Management"},{"page":941,"title":"25.9 Current Trends in Distributed Databases"},{"page":942,"title":"25.10 Distributed Databases in Oracle"},{"page":946,"title":"25.11 Summary"},{"page":948,"title":"Review Questions"},{"page":949,"title":"Exercises"},{"page":951,"title":"Selected Bibliography"}]}]},{"page":956,"title":"Part 11 Advanced Database Models, Systems, and Applications","children":[{"page":958,"title":"Chapter 26 Enhanced Data Models for Advanced Applications","children":[{"page":960,"title":"26.1 Active Database Concepts and Triggers"},{"page":970,"title":"26.2 Temporal Database Concepts"},{"page":984,"title":"26.3 Spatial Database Concepts"},{"page":992,"title":"26.4 Multimedia Database Concepts"},{"page":997,"title":"26.5 Introduction to Deductive Databases"},{"page":1010,"title":"26.6 Summary"},{"page":1012,"title":"Review Questions"},{"page":1013,"title":"Exercises"},{"page":1016,"title":"Selected Bibliography"}]},{"page":1020,"title":"Chapter 27 Introduction to Information Retrieval and Web Search","children":[{"page":1021,"title":"27.1 Information Retrieval (IR) Concepts"},{"page":1028,"title":"27.2 Retrieval Models"},{"page":1034,"title":"27.3 Types of Queries in IR Systems"},{"page":1036,"title":"27.4 Text Preprocessing"},{"page":1039,"title":"27.5 Inverted Indexing"},{"page":1041,"title":"27.6 Evaluation Measures of Search Relevance"},{"page":1045,"title":"27.7 Web Search and Analysis"},{"page":1055,"title":"27.8 Trends in Information Retrieval"},{"page":1057,"title":"27.9 Summary"},{"page":1058,"title":"Review Questions"},{"page":1060,"title":"Selected Bibliography"}]},{"page":1062,"title":"Chapter 28 Data Mining Concepts","children":[{"page":1063,"title":"28.1 Overview of Data Mining Technology"},{"page":1066,"title":"28.2 Association Rules"},{"page":1078,"title":"28.3 Classification"},{"page":1081,"title":"28.4 Clustering"},{"page":1084,"title":"28.5 Approaches to Other Data Mining Problems"},{"page":1087,"title":"28.6 Applications of Data Mining"},{"page":1087,"title":"28.7 Commercial Data Mining Tools"},{"page":1090,"title":"28.8 Summary"},{"page":1090,"title":"Review Questions"},{"page":1091,"title":"Exercises"},{"page":1092,"title":"Selected Bibliography"}]},{"page":1094,"title":"Chapter 29 Overview of Data Warehousing and OLAP","children":[{"page":1094,"title":"29.1 Introduction, Definitions, and Terminology"},{"page":1096,"title":"29.2 Characteristics of Data Warehouses"},{"page":1097,"title":"29.3 Data Modeling for Data Warehouses"},{"page":1102,"title":"29.4 Building a Data Warehouse"},{"page":1105,"title":"29.5 Typical Functionality of a Data Warehouse"},{"page":1106,"title":"29.6 Data Warehouse versus Views"},{"page":1107,"title":"29.7 Difficulties of Implementing Data Warehouses"},{"page":1108,"title":"29.8 Summary"},{"page":1108,"title":"Review Questions"},{"page":1109,"title":"Selected Bibliography"}]}]},{"page":1110,"title":"Appendix A: Alternative Diagrammatic Notations for ER Models"},{"page":1114,"title":"Appendix B: Parameters of Disks"},{"page":1118,"title":"Appendix C: Overview of the QBE Language","children":[{"page":1118,"title":"C.1 Basic Retrievals in QBE"},{"page":1122,"title":"C.2 Grouping, Aggregation, and Database Modification in QBE"}]},{"page":1126,"title":"Selected Bibliography"},{"page":1160,"title":"Index","children":[{"page":1160,"title":"A"},{"page":1162,"title":"B"},{"page":1163,"title":"C"},{"page":1167,"title":"D"},{"page":1172,"title":"E"},{"page":1174,"title":"F"},{"page":1175,"title":"G"},{"page":1176,"title":"H"},{"page":1176,"title":"I"},{"page":1178,"title":"J"},{"page":1179,"title":"K"},{"page":1179,"title":"L"},{"page":1180,"title":"M"},{"page":1181,"title":"N"},{"page":1182,"title":"O"},{"page":1184,"title":"P"},{"page":1186,"title":"Q"},{"page":1187,"title":"R"},{"page":1190,"title":"S"},{"page":1194,"title":"T"},{"page":1197,"title":"U"},{"page":1198,"title":"V"},{"page":1198,"title":"W"},{"page":1199,"title":"X"}]}],"pages_count":1200,"version":"6.15.2","dir":"ltr","state":"converting","token":"494399539ca2ade4","status":"SUCCEED","pages_count_fa":"۱۲۰۰"},"publisher":{"id":105,"title":"Pearson","description":null,"logo":null,"token":"4e9e4a99eea1a798","slug":"Pearson"},"tags":[{"title":"db","token":"473c02ff15661036","pivot":{"taggable_id":584,"tag_id":2748}}],"study_subjects":[{"id":6811,"title":"آشنایی با طراحی پایگاه داده‌ها","meta_title":"آشنایی با طراحی پایگاه داده‌ها","meta_description":"آشنایی با طراحی پایگاه داده‌ها - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"12e4f071993b75b1","type":"","books_count":2,"created_at":"2017-10-07 11:25:18","updated_at":"2017-12-12 14:49:26","study_fields":[{"id":550,"title":"علم اطلاعات و دانش شناسی","meta_title":"علم اطلاعات و دانش شناسی","meta_description":"علم اطلاعات و دانش شناسی - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"9ba9e573861e4eee","books_count":16,"created_at":"2017-10-07 11:22:51","updated_at":"2024-11-19 16:45:49","study_groups":[{"id":13,"title":"علوم انسانی","meta_title":"علوم انسانی","meta_description":"علوم انسانی - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"6d33eefc2ca30b1f","style":{"first_color":"#FB5F62","second_color":"#FB5F62","icon":"images/categories/ensani.png"},"books_count":1350,"created_at":"2017-10-07 11:22:44","updated_at":"2024-11-20 11:07:21"}]}]},{"id":10465,"title":"پایگاه داده پیشرفته","meta_title":"پایگاه داده پیشرفته","meta_description":"پایگاه داده پیشرفته - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"f5836f808fd0c434","type":"","books_count":3,"created_at":"2017-10-07 11:26:50","updated_at":"2017-12-12 14:49:26","study_fields":[{"id":106,"title":"علوم کامپیوتر گرایش سیستمهای کامپیوتری","meta_title":"علوم کامپیوتر گرایش سیستمهای کامپیوتری","meta_description":"علوم کامپیوتر گرایش سیستمهای کامپیوتری - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"68ce3e28fea4dc4c","books_count":9,"created_at":"2017-10-07 11:22:48","updated_at":"2023-04-11 12:42:56","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":748,"created_at":"2017-10-07 11:22:44","updated_at":"2024-11-20 11:07:21"}]}]},{"id":10471,"title":"پایگاه داده‌ها و سیستم‌های اطلاعاتی","meta_title":"پایگاه داده‌ها و سیستم‌های اطلاعاتی","meta_description":"پایگاه داده‌ها و سیستم‌های اطلاعاتی - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"f14f289c0127ab8e","type":"","books_count":4,"created_at":"2017-10-07 11:26:50","updated_at":"2020-08-13 13:38:33","study_fields":[{"id":367,"title":"فناوری اطلاعات و ارتباطات","meta_title":"فناوری اطلاعات و ارتباطات","meta_description":"فناوری اطلاعات و ارتباطات - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"247b88a256d9dee5","books_count":21,"created_at":"2017-10-07 11:22:50","updated_at":"2023-05-14 11:34:45","study_groups":[{"id":13,"title":"علوم انسانی","meta_title":"علوم انسانی","meta_description":"علوم انسانی - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"6d33eefc2ca30b1f","style":{"first_color":"#FB5F62","second_color":"#FB5F62","icon":"images/categories/ensani.png"},"books_count":1350,"created_at":"2017-10-07 11:22:44","updated_at":"2024-11-20 11:07:21"}]}]}],"study_fields":[{"id":550,"title":"علم اطلاعات و دانش شناسی","meta_title":"علم اطلاعات و دانش شناسی","meta_description":"علم اطلاعات و دانش شناسی - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"9ba9e573861e4eee","books_count":16,"created_at":"2017-10-07 11:22:51","updated_at":"2024-11-19 16:45:49","study_groups":[{"id":13,"title":"علوم انسانی","meta_title":"علوم انسانی","meta_description":"علوم انسانی - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"6d33eefc2ca30b1f","style":{"first_color":"#FB5F62","second_color":"#FB5F62","icon":"images/categories/ensani.png"},"books_count":1350,"created_at":"2017-10-07 11:22:44","updated_at":"2024-11-20 11:07:21"}]},{"id":106,"title":"علوم کامپیوتر گرایش سیستمهای کامپیوتری","meta_title":"علوم کامپیوتر گرایش سیستمهای کامپیوتری","meta_description":"علوم کامپیوتر گرایش سیستمهای کامپیوتری - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"68ce3e28fea4dc4c","books_count":9,"created_at":"2017-10-07 11:22:48","updated_at":"2023-04-11 12:42:56","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":748,"created_at":"2017-10-07 11:22:44","updated_at":"2024-11-20 11:07:21"}]},{"id":367,"title":"فناوری اطلاعات و ارتباطات","meta_title":"فناوری اطلاعات و ارتباطات","meta_description":"فناوری اطلاعات و ارتباطات - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"247b88a256d9dee5","books_count":21,"created_at":"2017-10-07 11:22:50","updated_at":"2023-05-14 11:34:45","study_groups":[{"id":13,"title":"علوم انسانی","meta_title":"علوم انسانی","meta_description":"علوم انسانی - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"6d33eefc2ca30b1f","style":{"first_color":"#FB5F62","second_color":"#FB5F62","icon":"images/categories/ensani.png"},"books_count":1350,"created_at":"2017-10-07 11:22:44","updated_at":"2024-11-20 11:07:21"}]}],"study_groups":[{"id":13,"title":"علوم انسانی","meta_title":"علوم انسانی","meta_description":"علوم انسانی - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"6d33eefc2ca30b1f","style":{"first_color":"#FB5F62","second_color":"#FB5F62","icon":"images/categories/ensani.png"},"books_count":1350,"created_at":"2017-10-07 11:22:44","updated_at":"2024-11-20 11:07:21"},{"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":748,"created_at":"2017-10-07 11:22:44","updated_at":"2024-11-20 11:07:21"}],"views":1,"price_fa":"۲۱","titleLink":"Fundamentals-of-Database-Systems","urlify":"Fundamentals-of-Database-Systems","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":34,"created_at":"2017-10-07 11:22:53","updated_at":"2024-11-19 16:43:27","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":748,"created_at":"2017-10-07 11:22:44","updated_at":"2024-11-20 11:07:21"}]}]}],"study_fields":[{"id":898,"title":"مهندسی کامپیوتر","meta_title":"مهندسی کامپیوتر","meta_description":"مهندسی کامپیوتر - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null,"token":"57bea94f4a51f6b8","books_count":34,"created_at":"2017-10-07 11:22:53","updated_at":"2024-11-19 16:43:27","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":748,"created_at":"2017-10-07 11:22:44","updated_at":"2024-11-20 11:07:21"}]}],"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":748,"created_at":"2017-10-07 11:22:44","updated_at":"2024-11-20 11:07:21"}],"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"}]}