{"id":8340,"date":"2026-08-10T09:54:50","date_gmt":"2026-08-10T09:54:50","guid":{"rendered":"https:\/\/nokobox.com\/index.php\/item\/oreilly-advanced-algorithms-and-data-structures-video-edition-2021-11\/"},"modified":"2026-08-10T09:54:50","modified_gmt":"2026-08-10T09:54:50","slug":"oreilly-advanced-algorithms-and-data-structures-video-edition-2021-11","status":"publish","type":"digital_item","link":"https:\/\/nokobox.com\/index.php\/item\/oreilly-advanced-algorithms-and-data-structures-video-edition-2021-11\/","title":{"rendered":"Oreilly \u2013 Advanced Algorithms and Data Structures, video edition 2021-11"},"content":{"rendered":"<div class=\"w-post-elm post_content\">\n<h2 style=\"text-align: left\"><span style=\"vertical-align: inherit\">Description<\/span><\/h2>\n<div class=\"presented-response-container ng-tns-c357060534-66\" style=\"text-align: left\">\n<div class=\"response-container-content ng-tns-c357060534-66\">\n<div class=\"response-content ng-tns-c357060534-66\">\n<div class=\"markdown markdown-main-panel\">\n<p data-sourcepos=\"7:1-7:464\"><span style=\"vertical-align: inherit\">Advanced Algorithms and Data Structures, video edition. This course teaches you powerful approaches to solving a wide range of coding challenges that you can implement in your own programs. With a balanced mix of classic, advanced, and new algorithms, this practical guide will enhance your programming toolbox with new insights and practical techniques. This course will help you become a more efficient programmer by using advanced algorithms and data structures. You will learn how to solve complex programming challenges with innovative approaches and improve the performance of your programs.<\/span><\/p>\n<h3 data-sourcepos=\"9:1-9:25\"><span style=\"vertical-align: inherit\">What you will learn:<\/span><\/h3>\n<ul data-sourcepos=\"11:1-16:0\">\n<li data-sourcepos=\"11:1-11:96\"><span style=\"vertical-align: inherit\">Strengthen basic data structures: Focus more on the data structures you already know.<\/span><\/li>\n<li data-sourcepos=\"12:1-12:94\"><span style=\"vertical-align: inherit\">Algorithm Optimization: Speed \u200b\u200bup your applications by profiling algorithms.<\/span><\/li>\n<li data-sourcepos=\"13:1-13:105\"><span style=\"vertical-align: inherit\">Storing and Querying Strings: Learn efficient ways to store and search text data.<\/span><\/li>\n<li data-sourcepos=\"14:1-14:91\"><span style=\"vertical-align: inherit\">Distributed clustering algorithms: Distribute clustering algorithms with MapReduce.<\/span><\/li>\n<li data-sourcepos=\"15:1-16:0\"><span style=\"vertical-align: inherit\">Solving Logistic Problems: Solve logistical problems using graphs and optimization algorithms.<\/span><\/li>\n<\/ul>\n<h3 data-sourcepos=\"17:1-17:32\"><span style=\"vertical-align: inherit\">Who is this course suitable for?<\/span><\/h3>\n<ul>\n<li data-sourcepos=\"19:1-19:51\"><span style=\"vertical-align: inherit\">This course is suitable for intermediate-level programmers.<\/span><\/li>\n<\/ul>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<h3 style=\"text-align: left\"><span style=\"vertical-align: inherit\">Course details<\/span><\/h3>\n<ul style=\"text-align: left\">\n<li><span style=\"vertical-align: inherit\">Publisher: <\/span><a href=\"https:\/\/href.li\/?https:\/\/www.oreilly.com\/library\/view\/advanced-algorithms-and\/9781617295485VE\/?_gl=1*ymmji0*_ga*MTU4NjE0OTc3OC4xNzEyMjIyNDU3*_ga_092EL089CH*MTczODEyODY3NC4zNC4xLjE3MzgxMzI3NTUuNTguMC4w\" target=\"_blank\" rel=\"noopener\"><span style=\"vertical-align: inherit\">Oreilly<\/span><\/a><\/li>\n<li><span style=\"vertical-align: inherit\">Instructor: <\/span><a class=\"author-name\" href=\"https:\/\/downloadlynet.ir\/tag\/marcello-la-rocca\/\"><span style=\"vertical-align: inherit\">Marcello La Rocca<\/span><\/a><\/li>\n<li><span style=\"vertical-align: inherit\">Training level: Beginner to advanced<\/span><\/li>\n<li><span style=\"vertical-align: inherit\">Training duration: 23 hours and 38 minutes<\/span><\/li>\n<\/ul>\n<h3 style=\"text-align: left\"><span style=\"vertical-align: inherit\">Course topics<\/span><\/h3>\n<div class=\"ud-block-list-item ud-block-list-item-small ud-block-list-item-tight ud-block-list-item-neutral ud-text-sm\">\n<ul style=\"text-align: left\">\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 1 Introducing data structures<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Part 1. Improving over basic data structures<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 1 Describing a data structure<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 1 Packing your knapsack: Data structures meet the real world<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 1 Algorithms to the rescue<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 2 Improving priority queues: d-way heaps<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 2 Solutions at hand: Keeping a sorted list<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 2 Concrete data structures<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 2 Priority, min-heap, and max-heap<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 2 How to implement a heap<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 2 PushDown<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 2 Top<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 2 Heapify<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 2 Use case: Find the k largest elements<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 2 More use cases<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 2 Analysis of branching factor<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 2 Performance analysis: Finding the best branching factor<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 2 Interpreting results<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 2 The mystery with heapify<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 3 Treaps: Using randomization to balance binary search trees<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 3 Treap<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 3 A few design questions<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 3 Delete<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 3 Applications: Randomized traps<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 3 Performance analysis and profiling<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 3 Height profiling<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 3 Profiling memory usage<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 4 Bloom filters: Reducing the memory for tracking content<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 4 Alternatives to implementing a dictionary<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 4 Concrete data structures<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 4 Binary search tree: Every operation is logarithmic<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 4 Implementation<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 4 Constructor<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 4 Applications<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 4 Why Bloom filters work<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 4 Performance analysis<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 4 Explanation of the false-positive ratio formula<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 4 Improved variants<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 5 Disjoint sets: Sub-linear time processing<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 5 Reasoning on solutions<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 5 Naive solution<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 5 Using a tree-like structure<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 5 Heuristics to improve the running time<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 5 Applications<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 6 Trie, radix trie: Efficient string search<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 6 Trie<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 6 Search<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 6 Insert<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 6 Keys matching a prefix<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 6 Radix tries<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 6 Search<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 6 Applications<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 6 String sorting<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 7 Use case: LRU cache<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 7 First attempt: Remembering values<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 7 Handling asynchronous calls<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 7 Memory is not enough (literally)<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 7 Getting rid of stale data: LRU cache<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 7 Temporal ordering<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 7 When fresher data is more valuable: LFU<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 7 How to use cache is just as important<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 7 Solving concurrency (in Java)<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 7 Read locks<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Part 2. Multidimensional queries<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 8 Nearest neighbors search<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 8 Simplifying things to get a hint<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 8 Moving to k-dimensional spaces<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 9 Kd trees: Multidimensional data indexing<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 9 Constructing the BST<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 9 Methods<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 9 Balanced tree<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 9 Remove<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 9 Nearest neighbor<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 9 Region search<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 10 Similarity Search Trees: Approximate nearest neighbors search for image retrieval<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 10 R-tree<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 10 Inserting points in an R-tree<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 10 Similarity search tree<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 10 SS-tree search<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 10 Insert<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 10 Insertion: Split nodes<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 10 Delete<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 10 Similarity Search<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 10 Approximate similarity search<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 10 SS+-tree<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 10 Reducing overlap<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 11 Applications of nearest neighbor search<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 11. Centralized application<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 11 Moving to a distributed application<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 11 Other applications<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 11 Multidimensional DB queries optimization<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 12 Clustering<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 12 Types of learning<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 12 K-means<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 12 The curse of dimensionality strikes again<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 12 Boosting k-means with kd trees<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 12 DBSCAN222<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 12 From definitions to an algorithm<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 12 And finally, an implementation<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 12 OPTICS<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 12 From reachability distance to clustering<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 12 Hierarchical clustering<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 12. Evaluating clustering results: Evaluation metrics<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 13 Parallel clustering: MapReduce and canopy clustering<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 13 Canopy clustering<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 13 MapReduce<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 13 First map, then reduce<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 13 MapReduce k-means<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 13 Parallelizing canopy clustering<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 13 MapReduce canopy clustering<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 13 MapReduce DBSCAN \u2013 Part 1<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 13 MapReduce DBSCAN \u2013 Part 2<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Part 3. Planar graphs and minimum crossing number<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 14 An introduction to graphs: Finding paths of minimum distance<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 14 Implementing graphs<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 14 Graph properties<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 14 Graph traversal: BFS and DFS<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 14 Reconstructing the path to target<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 14 Shortest path in weighted graphs: Dijkstra<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 14 Beyond Dijkstra\u2019s algorithm: A*<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 14 How good is A* search?<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 14 Heuristics as a way to balance real-time data<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 15 Graph embeddings and planarity: Drawing graphs with minimal edge intersections<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 15 Some basic definitions<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 15 Planar graphs<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 15 Planarity testing<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 15 Improving performance<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 15 Non-planar graphs<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 15 Rectilinear crossing number<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 15 Edge intersections<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 15 Polylines<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 15 Intersections between quadratic B\u00e9zier curves<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 16 Gradient descent: Optimization problems (not just) on graphs<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 16 Did you just say heuristics?<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 16 How optimization works<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 16 Gradient descent<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 16 When is gradient descent applicable?<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 16 Applications of gradient descent<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 16 Gradient descent for graph embedding<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 17 Simulated annealing: Optimization beyond local minima<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 17 Sometimes you need to climb up to get to the bottom<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 17 Why simulated annealing works<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 17 Short-range vs long-range transitions<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 17 Simulated annealing + traveling salesman<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 17 Exact vs approximate solutions<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 17 State transitions<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 17 Simulated annealing and graph embedding<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 17 Force-directed drawing<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 18 Genetic algorithms: Biologically inspired, fast-converging optimization<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 18 Inspired by nature<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 18 Chromosomes<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 18 Natural selection<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 18 Selecting individuals for mating<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 18 Crossover<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 18 The genetic algorithm template<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 18 TSP<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 18 Results and tuning parameters<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 18 Minimum vertex cover<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 18 Other applications of the genetic algorithm<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Chapter 18 Beyond genetic algorithms<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Appendix A. A quick guide to pseudo-code<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Appendix A Conditional instructions<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Appendix A Blocks and indents<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Appendix B. Big-O notation<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Appendix B Notation<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Appendix C. Core data structures<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Appendix C Tree<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Appendix C Hash table<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Appendix D. Containers as priority queues<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Appendix E. Recursion<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Appendix E Tail recursion<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Appendix F. Classification problems and randomized algorithm metrics<\/span><\/li>\n<li style=\"text-align: left\"><span style=\"vertical-align: inherit\">Appendix F Classification metrics<\/span><\/li>\n<\/ul>\n<h3 style=\"text-align: left\"><span style=\"vertical-align: inherit\">Course images<\/span><\/h3>\n<p style=\"text-align: left\"><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter wp-image-960025 size-full\" src=\"https:\/\/downloadly.ir\/wp-content\/uploads\/2025\/01\/Advanced-Algorithms-and-Data-Structures-video-edition.png\" alt=\"Advanced Algorithms and Data Structures, video edition\" width=\"1393\" height=\"498\"><\/p>\n<h3 style=\"text-align: left\"><span style=\"vertical-align: inherit\">Sample course video<\/span><\/h3>\n<div style=\"width: 640px;\" class=\"wp-video\"><span class=\"mejs-offscreen\">Video Player<\/span><\/p>\n<div id=\"mep_0\" class=\"mejs-container mejs-container-keyboard-inactive wp-video-shortcode mejs-video\" tabindex=\"0\" role=\"application\" aria-label=\"Video Player\" style=\"width: 640px; height: 360px; min-width: 217px;\">\n<div class=\"mejs-inner\">\n<div class=\"mejs-mediaelement\"><mediaelementwrapper id=\"video-153023-1\"><video class=\"wp-video-shortcode\" id=\"video-153023-1_html5\" width=\"640\" height=\"360\" preload=\"metadata\" src=\"https:\/\/dl.downloadly.ir\/Files\/Elearning\/Sample\/Advanced_Algorithms_and_Data_Structures_video_edition_Downloadly.ir.mp4?_=1\" style=\"width: 640px; height: 360px;\"><source type=\"video\/mp4\" src=\"https:\/\/dl.downloadly.ir\/Files\/Elearning\/Sample\/Advanced_Algorithms_and_Data_Structures_video_edition_Downloadly.ir.mp4?_=1\"><a href=\"https:\/\/dl.downloadly.ir\/Files\/Elearning\/Sample\/Advanced_Algorithms_and_Data_Structures_video_edition_Downloadly.ir.mp4?nocache=1786112049357\">https:\/\/dl.downloadly.ir\/Files\/Elearning\/Sample\/Advanced_Algorithms_and_Data_Structures_video_edition_Downloadly.ir.mp4<\/a><\/video><\/mediaelementwrapper><\/div>\n<div class=\"mejs-layers\">\n<div class=\"mejs-poster mejs-layer\" style=\"display: none; width: 100%; height: 100%;\"><\/div>\n<div class=\"mejs-overlay mejs-layer\" style=\"display: none; width: 100%; height: 100%;\">\n<div class=\"mejs-overlay-loading\"><span class=\"mejs-overlay-loading-bg-img\"><\/span><\/div>\n<\/div>\n<div class=\"mejs-overlay mejs-layer\" style=\"display: none; width: 100%; height: 100%;\">\n<div class=\"mejs-overlay-error\"><\/div>\n<\/div>\n<div class=\"mejs-overlay mejs-layer mejs-overlay-play\" style=\"width: 100%; height: 100%;\">\n<div class=\"mejs-overlay-button\" role=\"button\" tabindex=\"0\" aria-label=\"Play\" aria-pressed=\"false\"><\/div>\n<\/div>\n<\/div>\n<div class=\"mejs-controls\">\n<div class=\"mejs-button mejs-playpause-button mejs-play\"><button type=\"button\" aria-controls=\"mep_0\" title=\"Play\" aria-label=\"Play\" tabindex=\"0\"><\/button><\/div>\n<div class=\"mejs-time mejs-currenttime-container\" role=\"timer\" aria-live=\"off\"><span class=\"mejs-currenttime\">00:00<\/span><\/div>\n<div class=\"mejs-time-rail\"><span class=\"mejs-time-total mejs-time-slider\" role=\"slider\" tabindex=\"0\" aria-label=\"Time Slider\" aria-valuemin=\"0\" aria-valuemax=\"0\" aria-valuenow=\"0\" aria-valuetext=\"00:00\"><span class=\"mejs-time-buffering\" style=\"display: none;\"><\/span><span class=\"mejs-time-loaded\"><\/span><span class=\"mejs-time-current\"><\/span><span class=\"mejs-time-hovered no-hover\"><\/span><span class=\"mejs-time-handle\"><span class=\"mejs-time-handle-content\"><\/span><\/span><span class=\"mejs-time-float\"><span class=\"mejs-time-float-current\">00:00<\/span><span class=\"mejs-time-float-corner\"><\/span><\/span><\/span><\/div>\n<div class=\"mejs-time mejs-duration-container\"><span class=\"mejs-duration\">00:00<\/span><\/div>\n<div class=\"mejs-button mejs-volume-button mejs-mute\"><button type=\"button\" aria-controls=\"mep_0\" title=\"Mute\" aria-label=\"Mute\" tabindex=\"0\"><\/button><a href=\"javascript:void(0);\" class=\"mejs-volume-slider\" aria-label=\"Volume Slider\" aria-valuemin=\"0\" aria-valuemax=\"100\" role=\"slider\" aria-orientation=\"vertical\"><span class=\"mejs-offscreen\">Use Up\/Down Arrow keys to increase or decrease volume.<\/span><\/p>\n<div class=\"mejs-volume-total\">\n<div class=\"mejs-volume-current\" style=\"bottom: 0px; height: 100%;\"><\/div>\n<div class=\"mejs-volume-handle\" style=\"bottom: 100%; margin-bottom: -3px;\"><\/div>\n<\/div>\n<p><\/a><\/div>\n<div class=\"mejs-button mejs-fullscreen-button\"><button type=\"button\" aria-controls=\"mep_0\" title=\"Fullscreen\" aria-label=\"Fullscreen\" tabindex=\"0\"><\/button><\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<div style=\"text-align: left\">\n<h3><span style=\"vertical-align: inherit\">Installation Guide<\/span><\/h3>\n<p><span style=\"vertical-align: inherit\">After Extract, view with your favorite player.<\/span><\/p>\n<p><span style=\"vertical-align: inherit\">Subtitles: None<\/span><\/p>\n<p><span style=\"vertical-align: inherit\">Quality: 720p<\/span><\/p>\n<\/div>\n<h3 style=\"text-align: left\"><span style=\"vertical-align: inherit\">Download link<\/span><\/h3>\n<p style=\"text-align: left\"><a href=\"https:\/\/dl1.downloadly.ir\/Files\/Elearning\/Oreilly_Advanced_Algorithms_and_Data_Structures_video_edition_2021-11.part1_Downloadly.ir.rar?nocache=1786112048\"><span style=\"vertical-align: inherit\">Download Part 1 \u2013 2 GB<\/span><\/a><\/p>\n<p style=\"text-align: left\"><a href=\"https:\/\/dl1.downloadly.ir\/Files\/Elearning\/Oreilly_Advanced_Algorithms_and_Data_Structures_video_edition_2021-11.part2_Downloadly.ir.rar?nocache=1786112048\"><span style=\"vertical-align: inherit\">Download Part 2 \u2013 947 MB<\/span><\/a><\/p>\n<p style=\"text-align: left\"><span style=\"vertical-align: inherit\">File(s) password: www.downloadly.ir<\/span><\/p>\n<h3 style=\"text-align: left\"><span style=\"vertical-align: inherit\">File size<\/span><\/h3>\n<p style=\"text-align: left\"><span style=\"vertical-align: inherit\">2.9 GB<\/span><\/p>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Description Advanced Algorithms and Data Structures, video edition. This course teaches you powerful approaches to solving a wide range of coding challenges tha<\/p>\n","protected":false},"author":1,"template":"","dgi_category":[10458],"dgi_tag":[74000,74001,74002,74003,74004,54022],"class_list":["post-8340","digital_item","type-digital_item","status-publish","has-post-thumbnail","hentry","dgi_category-video-tutorials","dgi_tag-course-advanced-algorithms-and-data-structures-video-edition","dgi_tag-download-advanced-algorithms-and-data-structures-video-edition","dgi_tag-download-course-advanced-algorithms-and-data-structures-video-edition","dgi_tag-free-advanced-algorithms-and-data-structures-video-edition","dgi_tag-free-download-advanced-algorithms-and-data-structures-video-edition","dgi_tag-marcello-la-rocca"],"_links":{"self":[{"href":"https:\/\/nokobox.com\/index.php\/wp-json\/wp\/v2\/digital_item\/8340","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/nokobox.com\/index.php\/wp-json\/wp\/v2\/digital_item"}],"about":[{"href":"https:\/\/nokobox.com\/index.php\/wp-json\/wp\/v2\/types\/digital_item"}],"author":[{"embeddable":true,"href":"https:\/\/nokobox.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"version-history":[{"count":0,"href":"https:\/\/nokobox.com\/index.php\/wp-json\/wp\/v2\/digital_item\/8340\/revisions"}],"wp:attachment":[{"href":"https:\/\/nokobox.com\/index.php\/wp-json\/wp\/v2\/media?parent=8340"}],"wp:term":[{"taxonomy":"dgi_category","embeddable":true,"href":"https:\/\/nokobox.com\/index.php\/wp-json\/wp\/v2\/dgi_category?post=8340"},{"taxonomy":"dgi_tag","embeddable":true,"href":"https:\/\/nokobox.com\/index.php\/wp-json\/wp\/v2\/dgi_tag?post=8340"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}