Category: Tutorial   
Download Now

ADDISON WESLEY ALGORITHMS 4TH EDITION TUTORiAL-PROPAGANDA(1)

ADDISON WESLEY ALGORITHMS 4TH EDITION TUTORiAL-PROPAGANDA(1)
English | Size: 6.17 GB
Category: Tutorial
| || PGA would like to say this is one of the best comp-sci math : |
| || tutorials we have seen out. It is a requisite for anyone who : |
| || wishes to be a proper programmer / engineer Too many : |
| || 'programmers' know syntax these days but do not know the : |
| || fundamental math behind why things work as they do. This is : |
| || essential groundwork for the future programmer or person who : |
| || codes but, does not have a deeper understanding of why things : |
| || are developed under certain pretexts.


| || Introduction : |
| || - Algorithms: Introduction 00:09:23 : |
| || Section 1.3: Bags, Queues, and Stacks : |
| || - Stacks 00:16:24 : |
| || - Resizing Arrays 00:09:57 : |
| || - Queues 00:04:34 : |
| || - Generics 00:09:27 : |
| || - Iterators 00:07:17 : |
| || - Stack and Queue Applications 00:13:25 : |
| || Section 1.4: Analysis of Algorithms : |
| || - Introduction to Analysis of Algorithms 00:08:15 : |
| || - Observations 00:10:06 : |
| || - Mathematical Models 00:12:49 : |
| || - Order-of-Growth Classifications 00:14:40 : |
| || - Theory of Algorithms 00:11:36 : |
| || - Memory 00:08:12 : |
| || Section 1.5: Case Study: Union-Find : |
| || - Dynamic Connectivity 00:10:23 : |
| || - Quick Find 00:10:19 : |
| || - Quick Union 00:07:51 : |
| || - Quick-Union Improvements 00:13:03 : |
| || - Union-Find Applications 00:09:22 : |
| || Section 2.1: Elementary Sorts : |
| || - Introduction to Sorting 00:14:43 : |
| || - Selection Sort 00:06:59 : |
| || - Insertion Sort 00:09:29 : |
| || - Shellsort 00:10:49 : |
| || - Shuffling 00:07:40 : |
| || - Convex Hull 00:13:51 : |
| || Section 2.2: Mergesort : |
| || - Mergesort 00:23:55 : |
| || - Bottom-up Mergesort 00:03:21 : |
| || - Sorting Complexity 00:09:06 : |
| || - Comparators 00:06:44 : |
| || - Stability 00:05:40 : |
| || Section 2.3: Quicksort : |
| || - Quicksort 00:19:34 : |
| || - Selection 00:07:09 : |
| || - Duplicate Keys 00:11:26 : |
| || - System Sorts 00:11:50 : |
| || Section 2.4: Priority Queues : |
| || - APIs and Elementary Implementations 00:12:53 : |
| || - Binary Heaps 00:23:37 : |
| || - Heapsort 00:14:30 : |
| || Section 3.1: Symbol Tables : |
| || - Symbol Table APIs 00:21:30 : |
| || - Elementary Implementations 00:09:04 : |
| || - Ordered Operations 00:06:26 : |
| || Section 3.2: Binary Search Trees : |
| || - Binary Search Trees 00:19:57 : |
| || - Ordered Operations in BSTs 00:10:32 : |
| || - Deletion in BSTs 00:09:53 : |
| || Section 3.3: Balanced Search Trees : |
| || - 2-3 Search Trees 00:16:56 : |
| || - Red-Black BSTs 00:35:30 : |
| || Section 3.4: Hash Tables : |
| || - Hash Functions 00:18:14 : |
| || - Separate Chaining 00:07:28 : |
| || - Linear Probing 00:14:38 : |
| || - Context 00:10:10 : |
| || Section 3.5: Applications : |
| || - Sets 00:05:05 : |
| || - Dictionary 00:05:39 : |
| || - Indexing Clients 00:07:53 : |
| || - Sparse Vectors 00:07:42 : |
| || Section 4.1: Undirected Graphs : |
| || - Introduction to Graphs 00:09:33 : |
| || - Graph API 00:14:47 : |
| || - Depth-First Search 00:26:23 : |
| || - Breadth-First Search 00:13:34 : |
| || - Connected Components 00:18:56 : |
| || - Graph Challenges 00:14:29 : |
| || Section 4.2: Directed Graphs : |
| || - Introduction to Digraphs 00:08:31 : |
| || - Digraph API 00:04:56 : |
| || - Digraph Search 00:20:57 : |
| || - Topological Sort 00:12:54 : |
| || - Strong Components 00:20:22 : |
| || Section 4.3: Minimum Spanning Trees : |
| || - Introduction to MSTs 00:04:04 : |
| || - Greedy Algorithm 00:12:57 : |
| || - Edge-Weighted Graph API 00:11:16 : |
| || - Kruskal's Algorithm 00:12:29 : |
| || - Prim's Algorithm 00:33:16 : |
| || - MST Context 00:10:35 : |
| || Section 4.4: Shortest Paths : |
| || - Shortest Paths APIs 00:10:51 : |
| || - Shortest Path Properties 00:14:46 : |
| || - Dijkstra's Algorithm 00:18:58 : |
| || - Edge-Weighted DAGs 00:19:24 : |
| || - Negative Weights 00:21:02 : |
| || Section 5.1: String Sorts : |
| || - Strings in Java 00:17:43 : |
| || - Key-Indexed Counting 00:12:06 : |
| || - LSD Radix Sort 00:15:01 : |
| || - MSD Radix Sort 00:13:42 : |
| || - 3-way Radix Quicksort 00:07:23 : |
| || - Suffix Arrays 00:19:25 : |
| || Section 5.2: Tries : |
| || - R-way Tries 00:32:19 : |
| || - Knuth-Morris-Pratt 00:33:15 : |
| || - Boyer-Moore 00:08:37 : |
| || - Rabin-Karp 00:16:14 : |
| || Section 5.4: Regular Expressions : |
| || - Regular Expressions 00:20:03 : |
| || - REs and NFAs 00:13:14 : |
| || - NFA Simulation 00:18:24 : |
| || - NFA Construction 00:11:43 : |
| || - Regular Expression Applications 00:20:06 : |
| || Section 5.5: Data Compression : |
| || - Introduction to Data Compression 00:22:27 : |
| || - Run-Length Coding 00:05:59 : |
| || - Huffman Compression 00:24:14 : |
| || - LZW Compression 00:27:33 : |
| || Bonus Lectures : |
| || - Event-Driven Simulation 00:22:39 : |
| || - B-Trees 00:10:37 : |
| || - Introduction to Reductions 00:09:32 : |
| || - Designing Algorithms 00:08:13 : |
| || - Establishing Lower Bounds 00:09:23 : |
| || - Classifying Problems 00:12:45 : |
| || - Brewer's Problem 00:21:16 : |
| || - Simplex Algorithm 00:11:49 : |
| || - Simplex Implementations 00:16:22 : |
| || - Linear Programming Reductions 00:11:46 : |
| || - Introduction to Intractability 00:17:01 : |
| || - Search Problems 00:10:57 : |
| || - P vs. NP 00:16:29 : |
| || - Classifying Problems 00:13:43 : |
| || - NP-Completeness 00:12:38 : |
| || - Coping with Intractability 00:14:02 : |
| || - Introduction to Maxflow 00:10:34 : |
| || - Ford-Fulkerson Algorithm 00:06:33 : |
| || - Maxflow-Mincut Theorem 00:09:39 : |
| || - Running Time Analysis 00:08:50 : |
| || - Java Implementation 00:14:29 : |
| || - Maxflow Applications 00:22:20 : |
| || - 1d Range Search 00:08:52 : |
| || - Line Segment Intersection 00:05:47 : |
| || - Kd-Trees 00:29:08 : |
| || - Interval Search Trees 00:13:47 : |
| || - Rectangle Intersection 00:08:11 : |
| || : |
| ||: |
| |
| .[SiZE.NUMBER.OF.DiSCS]. |
| || 88 Files @ 250,000,000 Bytes = 21,000 MB : |
| ||: |
| |
| .[GREETINGS/Hi-5's].. |
| || kEiSO - QUASAR - PRODEV - ELOHIM - JGTiSO - OXBRiDGE : |
| ||: |
| |
| .[FUCK-YOU's/NEWS] |
| || PROPAGANDA would like to see the quality and documentation of : |
| || the bookware scene to increase. Quality not Quanity. Original : |
| || untouched, content! We also would like to see the following to: |
| || allow automation of cataloging of bookware releases. : |
| || : |
| || It looks like a few people listened (Thank you kE) and rules : |
| || are in progress for bookware! We look forward to being part of: |
| || a more consistent, higher quality bookware section : |
| || : |
| || Here is our naughty list : |
| || : |
| || TUTOR: Anyone wonder why they always pre out dated wintellect : |
| || releases ? Yes we pre outdated releases but we also do new : |
| || stuff, we aim to complete specific publishers to prevent ppl : |
| || from using p2p or web sources : |
| || : |
| || We smell. PUSSY or hmm cat shit.. wait! thats OXBRIDGE! : |
| || talk about weekend warriors! : |
| || : |
| || : |
| || Lastly - PROPAGANDA, would like to thank the people in the : |
| || bookware industry for doing what they do. We believe that : |
| || the real money to support the industry should come from the : |
| || corporate licensing contracts - that people who want to learn : |
| || should be able to do so. We encourage bookware / video / : |
| || e-learning and major Software and Hardware vendors to allow : |
| || access to these materials to whomever may want to learn these : |
| || technologies, so that we can bridge the educational gaps in : |
| || our communities world-wide. Companies like Cisco / Oracle / : |
| || IBM & Micro$oft already make billions off of their support : |
| || contracts and hw/sfw sales - Do they seriously benefit from : |
| || preventing people from learning these technologies? : |
| || : |
| || Regardless of the above, there are people who are instructors : |
| || and such who spend time writing and developing these courses, : |
| || we salute these ladies and lads, and hope they will encourage : |
| || a different way of funding these projects. They *DO* deserve : |
| || our support! If you have the means or you work in IT and you : |
| || use one of these courses to better yourself and get a raise, : |
| || then *BUY* one of these courses and show support to the hard : |
| || working instructors, editors, film crews and so-on that made : |
| || this course possible. IF YOU LIKE IT, *BUY* IT OR GET YOUR : |
| || WORKPLACE TO BUY A CORPORATE SUPPORT CONTRACT!! WE DID! : |
| || : |
| || /dev/random: : |
| || - : |
| || They paint the world full of shadows, and then tell their : |
| || children to stay close to the light, their light, their : |
| || reasons, *their* judgements. Because in the darkness there be : |
| || dragons, but it is not true. We can prove that it is not true.: |
| || In the dark there is discovery, there is possibility, there is: |
| || freedom in the dark when someone has illuminated it. And who : |
| || who has been so close as we are right now? : |
| || : |
| || PGA is dedicated to the purity of real piracy, not for making : |
| || money off of it, or exploiting the scene in *ANY* way. We are : |
| || the true pirates, illuminating the darkness, giving birth to : |
| || possibilities in a time where so little seems achievable. Join: |
| || us and usher in this new age. : |
| || : |
| || PGA IS LOOKING FOR: : |
| || : |
| || Absolutely nothing We have our methods and do not want acc : |
| || to your accounts, we do not want to affil your site, we do not: |
| || give files out and we are grown, have ladies / boyfriends / : |
| || lovers. If you are clever enough to find us and have a keen : |
| || point of view, who knows! : |
| ||: |
|..|
- LAYOUT & DESiGN BY #MONk!# oF DiViNE STYLERS! -
DOWNLOAD
(Buy premium account for maximum speed and resuming ability)







Direct Download

Tags: addison, wesley, algorithms, tutorial

ADDISON WESLEY ALGORITHMS 4TH EDITION TUTORiAL-PROPAGANDA(1) Fast Download via Rapidshare Hotfile Fileserve Filesonic Megaupload, ADDISON WESLEY ALGORITHMS 4TH EDITION TUTORiAL-PROPAGANDA(1) Torrents and Emule Download or anything related.
Author: tnt1411  |  Comments: 0  |  Views: 202  
Dear visitor, welcome here, but you are visiting our website as an unregistered user.
We recommend you Register or login with your own username.
Information
Members of Guest cannot leave comments.