| 1. AVL Tree Introduction.mp4 | 6.2 MB | ||
| 1. B(+) Tree Introduction.mp4 | 14.4 MB | ||
| 1. B-Tree Introduction.mp4 | 12.8 MB | ||
| 1. Binary Heaps.mp4 | 6.7 MB | ||
| 1. Binary Search Tree Introduction.mp4 | 8.8 MB | ||
| 1. Introduction to Search Algorithms.mp4 | 3.8 MB | ||
| 1. Introduction to Sort Algorithms.mp4 | 1.5 MB | ||
| 1. Introduction.mp4 | 6.3 MB | ||
| 1. Red Black Trees - Introduction.mp4 | 5.3 MB | ||
| 1.1 2-3 B(+) Tree Tests in C#.html | 204.8 B | ||
| 1.1 2-3 B-Tree Tests in C#.html | 204.8 B | ||
| 1.1 AVL Tree in C#.html | 204.8 B | ||
| 1.1 Binary Search Tree in C#.html | 204.8 B | ||
| 1.1 Red Black Tree in C#.html | 204.8 B | ||
| 1.1 Search-CompareTable.pdf | 140.4 KB | ||
| 1.2 AVL Tree Tests in C#.html | 204.8 B | ||
| 1.2 B(+) Tree Implementation in C#.html | 204.8 B | ||
| 1.2 B-Tree implementation in C#.html | 204.8 B | ||
| 1.2 Binary Search Tree Tests in C#.html | 204.8 B | ||
| 1.2 Red Black Tree Tests in C#.html | 204.8 B | ||
| 1.2 Source Code in C#.html | 102.4 B | ||
| 10. Min-Max Binary Heap Introduction.mp4 | 15.6 MB | ||
| 10.1 Min-Max Binary Heap in C#.html | 204.8 B | ||
| 10.2 Min-Max Binary Heap Test in C#.html | 204.8 B | ||
| 11. Min-Max Binary Heap - Insert Operation.mp4 | 31.2 MB | ||
| 12. Min-Max Binary Heap - Delete Root Operation.mp4 | 38.5 MB | ||
| 13. Min-Max Binary Heap - Build Operation.mp4 | 23.7 MB | ||
| 2. AVL Tree - Insert Operation.mp4 | 25.4 MB | ||
| 2. B(+) Tree Insert Operation.mp4 | 91.1 MB | ||
| 2. B-Tree Insert Operation.mp4 | 44.3 MB | ||
| 2. Binary Search Tree - Insert Operation.mp4 | 15.2 MB | ||
| 2. Bubble Sort.mp4 | 57.1 MB | ||
| 2. Linear Search.mp4 | 20.1 MB | ||
| 2. Min Binary Heap Introduction.mp4 | 9.1 MB | ||
| 2. Red Black Trees - Insert Operation.mp4 | 33 MB | ||
| 2.1 Bubble Sort in C#.html | 204.8 B | ||
| 2.1 Linear Search in C#.html | 204.8 B | ||
| 2.1 Min Binary Heap in C#.html | 204.8 B | ||
| 2.2 Bubble Sort Tests in C#.html | 204.8 B | ||
| 2.2 Linear Search Test in C#.html | 204.8 B | ||
| 2.2 Min Binary Heap Test in C#.html | 204.8 B | ||
| 3. AVL Tree- Delete Operation.mp4 | 16.2 MB | ||
| 3. B(+) Tree Delete Operation.mp4 | 105.2 MB | ||
| 3. B-Tree Delete Operation.mp4 | 70.4 MB | ||
| 3. Binary Search Tree - Delete Operation.mp4 | 16 MB | ||
| 3. Hash Table Search.mp4 | 19.7 MB | ||
| 3. Insertion Sort.mp4 | 103.6 MB | ||
| 3. Min Binary Heap - Insert Operation.mp4 | 17.2 MB | ||
| 3. Red Black Trees - Delete Operation.mp4 | 28.7 MB | ||
| 3.1 Hash Table Search in C#.html | 204.8 B | ||
| 3.1 Insertion Sort in C#.html | 204.8 B | ||
| 3.2 Hash Table Search Test in C#.html | 204.8 B | ||
| 3.2 Insertion Sort Tests in C#.html | 204.8 B | ||
| 4. Binary Search.mp4 | 27.3 MB | ||
| 4. Min Binary Heap - Build Operation.mp4 | 17.4 MB | ||
| 4. Selection Sort.mp4 | 28.8 MB | ||
| 4.1 Binary Search in C#.html | 204.8 B | ||
| 4.1 Selection Sort in C#.html | 204.8 B | ||
| 4.2 Binary Search Test in C#.html | 204.8 B | ||
| 4.2 Selection Sort Tests in C#.html | 204.8 B | ||
| 5. Min Binary Heap - Delete Root Operation.mp4 | 24.2 MB | ||
| 5. Quick Sort.mp4 | 90.4 MB | ||
| 5. Ternary Search.mp4 | 33.5 MB | ||
| 5.1 Quick Sort in C#.html | 204.8 B | ||
| 5.1 Ternary Search in C#.html | 204.8 B | ||
| 5.2 Quick Sort Tests in C#.html | 204.8 B | ||
| 5.2 Ternary Search Test in C#.html | 204.8 B | ||
| 6. Jump Search.mp4 | 28.3 MB | ||
| 6. Max Binary Heap Introduction.mp4 | 8.2 MB | ||
| 6. Merge Sort.mp4 | 158.9 MB | ||
| 6.1 Jump Search in C#.html | 204.8 B | ||
| 6.1 Max Binary Heap in C#.html | 204.8 B | ||
| 6.1 Merge Sort in C#.html | 204.8 B | ||
| 6.2 Jump Search Test in C#.html | 204.8 B | ||
| 6.2 Max Binary Heap Test in C#.html | 204.8 B | ||
| 6.2 Merge Sort Tests in C#.html | 204.8 B | ||
| 7. Exponential Search.mp4 | 6.9 MB | ||
| 7. Heap Sort.mp4 | 63.6 MB | ||
| 7. Max Binary Heap - Insert Operation.mp4 | 20.7 MB | ||
| 7.1 Exponential Search in C#.html | 204.8 B | ||
| 7.1 Heap Sort in C#.html | 204.8 B | ||
| 7.2 Exponential Search Test in C#.html | 204.8 B | ||
| 7.2 Heap Sort Tests in C#.html | 204.8 B | ||
| 8. Fibonacci Search.mp4 | 37.5 MB | ||
| 8. Max Binary Heap - Build Operation.mp4 | 18.8 MB | ||
| 8. Radix Sort.mp4 | 29.2 MB | ||
| 8.1 Fibonacci Search in C#.html | 204.8 B | ||
| 8.1 Radix Sort in C#.html | 204.8 B | ||
| 8.2 Fibonacci Search Test in C#.html | 204.8 B | ||
| 8.2 Radix Sort Tests in C#.html | 204.8 B | ||
| 9. Interpolation Search.mp4 | 38 MB | ||
| 9. Max Binary Heap - Delete Root Operation.mp4 | 26.6 MB | ||
| 9.1 Interpolation Search in C#.html | 204.8 B | ||
| 9.2 Interpolation Search Test in C#.html | 204.8 B | ||
| Bonus Resources.txt | 409.6 B | ||
| Get Bonus Downloads Here.url | 204.8 B | ||
| ▲ 96 total files | |||
Data Structures and Algorithms (C# code in GitHub)
https://DevCourseWeb.com
Duration: 6h 34m | Video: .MP4, 1280x720 30 fps | Audio: AAC, 48 kHz, 2ch | Size: 1.46 GB
Genre: eLearning | Language: English
Search, Sort, Binary Heaps, Binary Trees, Nary Trees (paired with C# implementations in an open source GitHub repo)
What you'll learn
Sort algorithms (bubble, insertion, selection, quick, merge, heap, radix), Search algorithms (linear, hash-table, binary, ternary, jump, exponential, fibonacci), Binary Search Trees, AVL trees, Red-Black trees, B-Trees, B+Trees, Min Binary Heap, Max Binary Heap, Min-Max Binary Heap
Requirements
Some familiarity with basics in computer science may be useful but is not a must
Description
This course teaches a comprehensive list of basic and advanced data structures and algorithms, an essential topic of
coding interviews at tech companies.
The course is paired with a C# GitHub open source project (username: PiJei, repository name: AlgorithmsAndDataStructures) where each algorithm is tagged with its space and time complexities (Big O), and tested for correctness with the exact same examples used in this course.
If you are a developer or a graduate student who is preparing for coding interviews at large tech firms as Google, Amazon, Facebook, Apple, Microsoft, or smaller high tech companies, you have landed in the right place. By attending this course you will learn the essential and complex data structures and algorithms, once and for all.
Some algorithms are taught over a medium size example such that the algorithm repeats itself several times until it is no longer complex and rather easily understood.
You are expected to maintain the knowledge gained via this course for a very long period of time. This is because this course makes heavy usage of animations , examples, and repetitions, which are the keys for deeply learning new topics.
The course has 45 lectures (~ 400 minutes) covering the following topics:
Search Algorithms:
Linear Search
Hash-Table Search
Jump Search
Exponential Search
Fibonacci Search
Binary Search
Ternary Search
Interpolation Search
Sort Algorithms
Bubble Sort
Insertion Sort
Selection Sort
Quick Sort
Merge Sort
Radix Sort
Heap Sort
Binary Heaps
Min Binary Heap
Max Binary Heap
Min-Max Binary Heap
With these operations:
Build
Insert
Delete
Binary Trees
Binary Search Tree
AVL Tree
RedBlack Tree
With these operations
Insert
Delete
Nary Trees
B Tree
B+ Tree
With these operations
a. Insert
b. Delete
Who this course is for
Anyone preparing for coding interviews at GAFAM, or high tech firms
Students of computer science/engineering
Homepage
| torrent name | size | uploader | age | seed | leech |
|---|---|---|---|---|---|
| 3 GB | freecoursewb | 15 hours | 0 | 25 | |
| 274.1 MB | freecoursewb | 2 weeks | 16 | 1 | |
| 1.1 GB | freecoursewb | 2 weeks | 20 | 4 | |
| 2.9 GB | freecoursewb | 2 weeks | 15 | 5 | |
|
Udemy - Revit Ideate - BIM Automation, Data Management and Documents Posted by
freecoursewb in Other
|
2.4 GB | freecoursewb | 2 weeks | 11 | 10 |
All Comments