دانلود کتاب های Anany Levitin

{"query":"BSS::A::*::I::1055::*","current_page":1,"items":1,"data":[{"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}],"from":1,"path":"/author/1055/Anany-Levitin","per_page":15,"to":1,"last_page":1,"total_authors_books":0,"total_books":1,"total_publisher_books":0,"total_isbn_books":0,"total":1,"title":"Anany-Levitin","errors":[],"timingAnalysis":{"timeToFetch":"21ms","total":"NaNms"},"extra":{"id":1055,"title":" ","token":"ac5211b9343c3ed5","meta_title":" ","meta_description":" - بوکت، نخستین و بزرگ‌ترین سامانه‌ی یادگیری و آموزش با قابلیت کرایه و خرید نسخه‌ی الکترونیکی کتاب‌های دانشگاهی است ","faq":null,"keywords":"بوکت,کرایه کتاب,کتاب الکترونیک/ نسخه الکترونیک,ئی بوک/ایبوک,مطالعه آنلاین,کتاب تخصصی,کتاب دانشگاهی,دانلود کتاب,خرید کتاب,جستجوی کتاب,خرید کتاب الکترونیک,ناشرشو,چاپ کتاب,چاپ رایگان کتاب,کتاب مهندسی,کتاب پزشکی,کتاب مدیریت,جیتجو در متن کتاب,دانلود اپلیکیشن کتابخوان","description":null}}