O'Reilly - Learning Data Structures and Algorithms (unzipped flv format)

seeders: 1
leechers: 0
Added on August 2, 2015 by josbertoin Other > Tutorials
Torrent verified.



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

Description

Chapter 1 - Introduction

Introduction And Course Overview
time: 04min00s

About The Author
01min16s

How To Access Your Working Files
01min15s

Chapter 2 - Complexity Theory

Complexity Theory
03min56s

Big O Notation
07min02s

Typical Runtime Functions
04min37s

Comparing Runtime Functions
05min27s

P And NP
04min04s

Chapter 3 - Numerical Algorithms

Random Numbers
02min19s

Linear Congruential Generators
05min04s

Randomizing Arrays - Part 1
03min47s

Randomizing Arrays - Part 2
04min31s

GCD
04min09s

LCM
03min28s

Prime Factorization - Part 1
04min59s

Prime Factorization - Part 2
02min43s

Finding Primes
03min24s

Testing Primality
03min45s

Numerical Integration
05min11s

Chapter 4 - Linked Lists
Singly Linked Lists - Part 1
06min48s

Singly Linked Lists - Part 2
02min22s

Sorted Linked Lists
03min22s

Sorting With Linke Lists04m 07s
Doubly Linked Lists 03m 51s

Chapter 5 - Arrays
One-Dimensional Arrays 05m 10s
Triangular Arrays - Part 1 04m 13s
Triangular Arrays - Part 2 03m 17s
Sparse Arrays - Part 1 05m 27s
Sparse Arrays - Part 2 03m 19s

Chapter 6 - Stacks And Queues
Stacks 02m 32s
Stack Algorithms 03m 26s
Double Stacks 02m 08s
Queues 05m 49s

Chapter 7 - Sorting
Sorting Algorithms 03m 03s
Insertionsort 06m 27s
Selectionsort 04m 46s
Quicksort - Part 1 05m 40s
Quicksort - Part 2 07m 55s
Heapsort - Part 1 06m 17s
Heapsort - Part 2 05m 21s
Heapsort - Part 3 05m 39s
Mergesort - Part 1 03m 55s
Mergesort - Part 2 03m 41s
Bubblesort - Part 1 04m 51s
Bubblesort - Part 2 04m 18s
Countingsort - Part 1 04m 45s
Countingsort - Part 2 03m 35s
Sorting Summary 02m 51s

Chapter 8 - Searching
Linear Search 02m 11s
Binary Search 05m 15s
Interpolation Search 05m 27s

Chapter 9 - Hash Tables
Hash Tables 04m 32s
Chaining 05m 23s
Open Addressing - Basics 07m 25s
Open Addressing - Linear Probing 04m 48s
Open Addressing - Quadratic Probing 04m 22s
Open Addressing - Double Hashing 05m 55s

Chapter 10 - Recursion
Recursion Basics 05m 37s
Fibonacci Numbers 06m 08s
Tower Of Hanoi 06m 08s
Koch Curves 04m 32s
Hilbert Curves 04m 32s
Gaskets 04m 52s
Removing Tail Recursion 03m 58s
Removing Recursion With Stacks 03m 56s
Fixing Fibonacci 07m 25s
Selections 04m 15s
Permutations 04m 12s

Chapter 11 - Backtracking Algorithms
Backtracking 06m 03s
The Eight Queens Problem - Part 1 06m 00s
The Eight Queens Problem - Part 2 04m 03s
The Eight Queens Problem - Part 3 03m 48s
The Knights Tour 04m 20s

Chapter 12 - Trees
Tree Terms 05m 06s
Binary Tree Properties 06m 25s
Traversals - Preorder
03m 54s

Traversals - Postorder 02m 57s
Traversals - Inorder 02m 47s
Traversals - Breadth-First 02m 57s
Building Sorted Trees 03m 56s
Editing Sorted Trees 04m 36s

Chapter 13 - Balanced Trees
Why Do You Need Balanced Trees? 04m 04s
B-Trees - B-Tree Basics 07m 18s
B-Trees - Adding Items 05m 16s
B-Trees - Removing Items 04m 16s

Chapter 14 - Decision Trees
Definition 05m 36s
Exhaustive Search 06m 27s
Branch And Bound 08m 26s
Heuristics 07m 38s

Chapter 15 - Network Algorithms
Network Terminology 03m 31s
Network Classes 04m 52s
Depth-First Traversal 05m 21s
Breadth-First Traversal 02m 43s
Spanning Trees - Part 1 04m 12s
Spanning Trees - Part 2 03m 58s
Shortest Paths - Part 1 07m 27s
Shortest Paths - Part 2 08m 41s

Chapter 16 - Wrap-Up
Wrap-Up

Related Torrents

torrent name size seed leech

Sharing Widget


Download torrent
2.01 GB
seeders:1
leechers:0
O'Reilly - Learning Data Structures and Algorithms (unzipped flv format)