[O'Reilly] Learning Data Structures and Algorithms

seeders: 1
leechers: 0
Added on May 3, 2015 by mozganin Other > Tutorials
Torrent verified.



[O'Reilly] Learning Data Structures and Algorithms (Size: 2.01 GB)
 TOC.txt3.24 KB
 01.Introduction And Course Overview.flv20.43 MB
 02.About The Author.flv7.92 MB
 03.How To Access Your Working Files.flv2.84 MB
 02.Big O Notation.flv46.46 MB
 04.Comparing Runtime Functions.flv39.72 MB
 03.Typical Runtime Functions.flv23.66 MB
 05.P And NP.flv19.17 MB
 01.Complexity Theory.flv17.62 MB
 11.Numerical Integration.flv35.22 MB
 02.Linear Congruential Generators.flv33.36 MB
 09.Finding Primes.flv28.43 MB
 04.Randomizing Arrays - Part 2.flv24.32 MB
 10.Testing Primality.flv23.86 MB
 07.Prime Factorization - Part 1.flv23.18 MB
 05.GCD.flv19.65 MB
 01.Random Numbers.flv18.91 MB
 03.Randomizing Arrays - Part 1.flv17.12 MB
 06.LCM.flv14.71 MB
 08.Prime Factorization - Part 2.flv11.62 MB
 01.Singly Linked Lists - Part 1.flv28.59 MB
 04.Sorting With Linked Lists.flv24.29 MB
 03.Sorted Linked Lists.flv20.3 MB
 05.Doubly Linked Lists.flv18.08 MB
 02.Singly Linked Lists - Part 2.flv9.33 MB
 04.Sparse Arrays - Part 1.flv35.74 MB
 01.One-Dimensional Arrays.flv29.64 MB
 02.Triangular Arrays - Part 1.flv28.46 MB
 05.Sparse Arrays - Part 2.flv20.56 MB
 03.Triangular Arrays - Part 2.flv18.7 MB
 04.Queues.flv31.72 MB
 02.Stack Algorithms.flv18.32 MB
 01.Stacks.flv8.84 MB
 03.Double Stacks.flv7.81 MB
 05.Quicksort - Part 2.flv40.41 MB
 02.Insertionsort.flv27.24 MB
 08.Heapsort - Part 3.flv25.87 MB
 13.Countingsort - Part 1.flv25.28 MB
 04.Quicksort - Part 1.flv23.82 MB
 06.Heapsort - Part 1.flv23.15 MB
 07.Heapsort - Part 2.flv23.12 MB
 11.Bubblesort - Part 1.flv21.36 MB
 15.Sorting Summary.flv21.09 MB
 10.Mergesort - Part 2.flv20.81 MB
 03.Interpolation Search.flv34.47 MB
 02.Binary Search.flv30.15 MB
 01.Linear Search.flv12.1 MB
 03.Open Addressing - Basics.flv38.14 MB
 02.Chaining.flv29.49 MB
 01.Hash Tables.flv26.22 MB
 06.Open Addressing - Double Hashing.flv19.81 MB
 04.Open Addressing - Linear Probing.flv17.11 MB
 05.Open Addressing - Quadratic Probing.flv10.95 MB
 09.Fixing Fibonacci.flv45.44 MB
 06.Gaskets.flv35.44 MB
 05.Hilbert Curves.flv31.12 MB
 02.Fibonacci Numbers.flv30.23 MB
 08.Removing Recursion With Stacks.flv27.36 MB
 03.Tower Of Hanoi.flv25 MB
 11.Permutations.flv23.67 MB
 04.Koch Curves.flv22.51 MB
 01.Recursion Basics.flv22.37 MB
 10.Selections.flv22.31 MB
 07.Removing Tail Recursion.flv18.75 MB
 02.The Eight Queens Problem - Part 1.flv33.33 MB
 01.Backtracking.flv33 MB
 03.The Eight Queens Problem - Part 2.flv27.85 MB
 05.The Knights Tour.flv22.86 MB
 04.The Eight Queens Problem - Part 3.flv16.78 MB
 02.Binary Tree Properties.flv16.02 MB
 01.Tree Terms.flv13.39 MB
 08.Editing Sorted Trees.flv11.26 MB
 07.Building Sorted Trees.flv9.48 MB
 03.Traversals - Preorder.flv8.59 MB
 04.Traversals - Postorder.flv6.83 MB
 06.Traversals - Breadth-First.flv6.5 MB
 05.Traversals - Inorder.flv6.23 MB
 02.B-Trees - B-Tree Basics.flv15.56 MB
 03.B-Trees - Adding Items.flv14 MB
 04.B-Trees - Removing Items.flv11.86 MB
 01.Why Do You Need Balanced Trees?.flv8.7 MB
 03.Branch And Bound.flv23.91 MB
 01.Definition.flv22.82 MB
 04.Heuristics.flv17.5 MB
 02.Exhaustive Search.flv14.37 MB
 08.Shortest Paths - Part 2.flv29.97 MB
 07.Shortest Paths - Part 1.flv24.83 MB
 03.Depth-First Traversal.flv12.47 MB
 02.Network Classes.flv10.37 MB
 01.Network Terminology.flv10.31 MB
 05.Spanning Trees - Part 1.flv10.27 MB
 06.Spanning Trees - Part 2.flv9.4 MB
 04.Breadth-First Traversal.flv8.43 MB
 01.Wrap-Up.flv5.33 MB


Description

Learning Data Structures and Algorithms
Implementation and Analysis for Increased Software Performance
By Rod Stephens
Final Release Date: February 2015
Run time: 7 hours 32 minutes

In this Learning Data Structures and Algorithms video training course, Rod Stephens will teach you how to analyze and implement common algorithms used in data processing. This course is designed for the absolute beginner, meaning no previous programming experience is required.

You will start by learning about the complexity theory, then jump into learning about numerical algorithms, including randomizing arrays, prime factorization, and numerical integration. From there, Rod will teach you about linked lists, such as singly linked lists, sorted, and doubly linked lists. This video tutorial also covers arrays, stacks and queues, and sorting. You will also learn about searching, hash tables, recursion, and backtracking algorithms. Finally, you will cover trees, balanced trees, decision trees, and network algorithms.

Once you have completed this video training course, you will be fully capable of analyzing and implementing algorithms, as well as be able to select the best algorithm for various situations. Working files are included, allowing you to follow along with the author throughout the lessons.

Link: http://shop.oreilly.com/product/0636920039884.do

Sharing Widget


Download torrent
2.01 GB
seeders:1
leechers:0
[O'Reilly] Learning Data Structures and Algorithms