Other
The Complete Data Structures and Algorithms Course in Java
Torrent info
Torrent Files List
[TutsNode.net] - The Complete Data Structures and Algorithms Course in Java (Size: 4.98 GB) (Files: 552)
[TutsNode.net] - The Complete Data Structures and Algorithms Course in Java
17. Data Structure - Graph
30. Kruskal's Algorithm -- Minimum Spanning Tree (MST).mp4
10. BFS & DFS - Graph Traversal Techniques Explained.srt
28. Disjoint Set Data Structure.srt
30. Kruskal's Algorithm -- Minimum Spanning Tree (MST).srt
6. Graph Representation using Adjacency Matrix (Undirected Graph).srt
25. Floyd Warshall Algorithm Dynamic Programming .srt
25. Floyd Warshall Algorithm Dynamic Programming .mp4
27. Prim's Algorithm -- Minimum Spanning Tree (MST).srt
21. Bellman Ford's Algorithm & Nagative Cycle Detection for SSSP Problem.srt
17. Dijkstra Algorithm for SSSP Problem.srt
14. Topological Sort Algorithm.srt
7. Graph Representation using Adjacency Matrix (Directed Graph).srt
8. Graph Representation using Adjacency List (Unweighted Graph).srt
13. Toplogical Sort Explained.srt
9. Graph Representation using Adjacency List (Weighted Graph).srt
20. Dijsktra VS Bellman Ford's Algorithm for SSSP Problem.srt
2. Graph Terminologies.srt
4. Graph Representation Technique.srt
1. What is Graph Data Structure.srt
18. Why Dijstra Fail for Negative Cycle.srt
11. BFS Algorithm (Breadth First Search).srt
12. DFS Algorithm (Depth First Search).srt
19. What is Edge Relaxation.srt
15. What is SSSP Problem (Single Source Shortest Path).srt
5. When to use which representation.srt
24. Dijkstra & Bellman Ford's Algorithm for APSP Problem.srt
3. Types of Graph.srt
26. What is Minimum Spanning Tree.srt
16. Why BFS & DFS Doesn't Works for SSSP Problem.srt
22. What is All Pair Shortest Path Problem (APSP Problem).srt
29. What is Path Compression in Disjoint Set Data Structure.srt
21.1 BellmanFord'sAlgorithm.zip
6. Graph Representation using Adjacency Matrix (Undirected Graph).mp4
14.2 TopSortAlgorithm--Example-02.zip
14.1 TopSortAlgorithm--Example-01.zip
17.1 DijkstraAlgorithm.zip
11.1 BFS -- Algorithm.zip
12.1 DFS -- Algorithm.zip
6.2 WeightedUndirectedUsingAdjacencyMatrix.zip
9.2 WeightedUndirectedGraphUsingAdjacencyList.zip
9.1 WeightedDirectedGraphUsingAdjacencyList.zip
6.1 UnweightedUndirectedUsingAdjacencyMatrix.zip
8.2 UnweightedUndirectedGraphUsingAdjacencyList.zip
8.1 UnweightedDirectedGraphUsingAdjacencyList.zip
7.2 WeightedDirectedGraphAdjacencyMatrixRepresentation.zip
7.1 UnweightedDirectedGraphAdjacencyMatrixRepresentation.zip
23. Why BFS & DFS Doesn't Works For APSP Problem.html
28. Disjoint Set Data Structure.mp4
27. Prim's Algorithm -- Minimum Spanning Tree (MST).mp4
17. Dijkstra Algorithm for SSSP Problem.mp4
14. Topological Sort Algorithm.mp4
21. Bellman Ford's Algorithm & Nagative Cycle Detection for SSSP Problem.mp4
10. BFS & DFS - Graph Traversal Techniques Explained.mp4
7. Graph Representation using Adjacency Matrix (Directed Graph).mp4
8. Graph Representation using Adjacency List (Unweighted Graph).mp4
13. Toplogical Sort Explained.mp4
9. Graph Representation using Adjacency List (Weighted Graph).mp4
1. What is Graph Data Structure.mp4
2. Graph Terminologies.mp4
5. When to use which representation.mp4
20. Dijsktra VS Bellman Ford's Algorithm for SSSP Problem.mp4
11. BFS Algorithm (Breadth First Search).mp4
12. DFS Algorithm (Depth First Search).mp4
15. What is SSSP Problem (Single Source Shortest Path).mp4
29. What is Path Compression in Disjoint Set Data Structure.mp4
18. Why Dijstra Fail for Negative Cycle.mp4
19. What is Edge Relaxation.mp4
3. Types of Graph.mp4
26. What is Minimum Spanning Tree.mp4
24. Dijkstra & Bellman Ford's Algorithm for APSP Problem.mp4
16. Why BFS & DFS Doesn't Works for SSSP Problem.mp4
22. What is All Pair Shortest Path Problem (APSP Problem).mp4
4. Graph Representation Technique.mp4
7. Data Structure - Binary Tree
11. Tree Traversal Techniques Inorder, Preorder & Postorder Traversal .srt
11. Tree Traversal Techniques Inorder, Preorder & Postorder Traversal .mp4
12. Preorder Traversal Details Recursive + Iterative .srt
13. Inorder Traversal Details Recursive + Iterative .srt
14. Postorder Traversal Details Recursive + Iterative .srt
15. Level Order Traversal Details Recursive + Iterative .srt
9. Delete Value from Binary Tree.srt
7. Create Binary Tree & Insert Value Linked List Implementation .srt
14. Postorder Traversal Details Recursive + Iterative .mp4
25.1 BinaryTreeUsingArray.zip
17. Create Binary Tree & Insert Value Array Implementation .srt
2. Tree Terminologies Root, Leaf, Edge, Ancestor, ... Depth of Tree .srt
6. How is Tree Represented Linked List & Array Representation .srt
8. Search for a Value in Binary Tree.srt
5. Types of Binary Tree.srt
4. What is Binary Tree.srt
10. Delete Binary Tree.srt
19. Delete Node from Binary Tree.srt
23. Postorder Traversal.srt
16. Source Code Implementation of Binary Tree Using Linked List .html
16.1 BinaryTreeUsingLinkedList.zip
18. Search for a Value in Binary Tree.srt
22. Inorder Traversal.srt
20. Delete Binary Tree.srt
1. What is Tree & Why should we learn tree.srt
21. Preorder Traversal.srt
24. Level order Traversal.srt
25. Source Code Implementation of Binary Tree Using Array .html
3. Tree Terminologies Predecessor & Successor .srt
13. Inorder Traversal Details Recursive + Iterative .mp4
12. Preorder Traversal Details Recursive + Iterative .mp4
15. Level Order Traversal Details Recursive + Iterative .mp4
9. Delete Value from Binary Tree.mp4
7. Create Binary Tree & Insert Value Linked List Implementation .mp4
5. Types of Binary Tree.mp4
17. Create Binary Tree & Insert Value Array Implementation .mp4
2. Tree Terminologies Root, Leaf, Edge, Ancestor, ... Depth of Tree .mp4
6. How is Tree Represented Linked List & Array Representation .mp4
19. Delete Node from Binary Tree.mp4
3. Tree Terminologies Predecessor & Successor .mp4
23. Postorder Traversal.mp4
8. Search for a Value in Binary Tree.mp4
4. What is Binary Tree.mp4
21. Preorder Traversal.mp4
1. What is Tree & Why should we learn tree.mp4
22. Inorder Traversal.mp4
18. Search for a Value in Binary Tree.mp4
24. Level order Traversal.mp4
10. Delete Binary Tree.mp4
20. Delete Binary Tree.mp4
16. Algorithm - Dynamic Programming
8. 01 Knapsack Problem.srt
9. Regular Expression Matching.srt
4. Longest Increasing Subsequence.srt
5. House Robber.srt
7. Longest Common Subsequence.srt
6. Min Path Sum.srt
1. What is Dynamic Programming & Why.srt
2. Top-Down Approach.srt
3. Bottom Up Approach.srt
9. Regular Expression Matching.mp4
8. 01 Knapsack Problem.mp4
7. Longest Common Subsequence.mp4
2. Top-Down Approach.mp4
1. What is Dynamic Programming & Why.mp4
5. House Robber.mp4
4. Longest Increasing Subsequence.mp4
6. Min Path Sum.mp4
3. Bottom Up Approach.mp4
6. Data Structure - Queue
4. Source Code - Linear Queue Implementation using Array.html
5. Array - Circular Queue.srt
3. Array - Linear Queue.srt
7. Linked List - Linear Queue.srt
2. Queue Implementation Options.srt
4.1 LinearQueueUsingArray.zip
6. Source Code - Circular Queue.html
6.1 CircularQueueUsingArray.zip
8. Source Code - Linear Queue Implementation using LInked List.html
8.1 LinearQueueUsingLinkedList.zip
1. What is Queue.srt
5. Array - Circular Queue.mp4
7. Linked List - Linear Queue.mp4
3. Array - Linear Queue.mp4
1. What is Queue.mp4
2. Queue Implementation Options.mp4
15. Data Structure - Hashing
4. Collision and Collison Resolution Technique.srt
7. How HashMap Works Internally.srt
1. What & Why is Hashing.srt
3. Hash Function.srt
6. What if hashing is full.srt
2. Hashing Terminologies.srt
5. Pros & Cons of Collisions Resolution Technique.srt
4. Collision and Collison Resolution Technique.mp4
7. How HashMap Works Internally.mp4
3. Hash Function.mp4
1. What & Why is Hashing.mp4
2. Hashing Terminologies.mp4
6. What if hashing is full.mp4
5. Pros & Cons of Collisions Resolution Technique.mp4
5. Data Structure - Stack
10. Stack Problem Decode String.srt
3. Array - Create, Push & Pop.srt
1. What is Stack.srt
2. Stack Implementation Options.srt
5. Source Code -- Stack Using Array.html
5.1 StackUsingArray.zip
6. Linked List - Create, Push & Pop.srt
8. Source Code -- Stack Using Linked List.html
8.1 StackUsingLinkedList.zip
9. Stack Problem Valid Parentheses.srt
7. Linked List - Peek, isEmpty, & deleteStack.srt
4. Array - Peek, isEmpty, isFull & deleteStack.srt
10. Stack Problem Decode String.mp4
1. What is Stack.mp4
3. Array - Create, Push & Pop.mp4
9. Stack Problem Valid Parentheses.mp4
6. Linked List - Create, Push & Pop.mp4
4. Array - Peek, isEmpty, isFull & deleteStack.mp4
7. Linked List - Peek, isEmpty, & deleteStack.mp4
2. Stack Implementation Options.mp4
13. Algorithm - Sorting
6. Quick Sort.srt
5. Merge Sort.srt
3. Insertion Sort.srt
1. Bubble Sort.srt
7. Heap Sort.srt
2. Selection Sort.srt
4. Bucket Sort.srt
7.1 HeapSort.zip
4.1 BucketSort.zip
5.1 MergeSort.zip
1.1 BubbleSort.zip
2.1 SelectionSort.zip
3.1 InsertionSort.zip
6.1 QuickSort.zip
6. Quick Sort.mp4
5. Merge Sort.mp4
3. Insertion Sort.mp4
4. Bucket Sort.mp4
1. Bubble Sort.mp4
2. Selection Sort.mp4
7. Heap Sort.mp4
3. Data Structure - Array
6.1 OperationsIn1DArray.zip
7.1 BinarySearchAlgorithm.zip
7.2 LinearSearchAlgorithm.zip
14. 2D Array Problem Spiral Matrix.srt
9.1 OperationsIn2DArray.zip
12.1 RemoveDuplicates.zip
7. Searching Algorithms (Linear Search + Binary Search).srt
13.1 RotateImage.zip
13. 2D Array Problem Rotate Image.srt
14.1 SpiralMatrix.zip
10.1 Traverse2DArray.zip
12. 1D Array Problem Remove Duplicates from Sorted Array.srt
6. Get, Insert, Update & Delete Operations in 1D Array.srt
1. What is an array & why we need an array.srt
11. 1D Array Problem Move Zeroes.srt
10. Traverse 2D Array.srt
3. How is an array represented in RAM.srt
2. Types of array.srt
9. Get, Insert & Update Operations in 2D Array.srt
8. Create a 2D Array.srt
4. Create a 1D Array.srt
5. Traverse 1D Array.srt
14. 2D Array Problem Spiral Matrix.mp4
13. 2D Array Problem Rotate Image.mp4
7. Searching Algorithms (Linear Search + Binary Search).mp4
12. 1D Array Problem Remove Duplicates from Sorted Array.mp4
2. Types of array.mp4
1. What is an array & why we need an array.mp4
10. Traverse 2D Array.mp4
8. Create a 2D Array.mp4
6. Get, Insert, Update & Delete Operations in 1D Array.mp4
11. 1D Array Problem Move Zeroes.mp4
3. How is an array represented in RAM.mp4
9. Get, Insert & Update Operations in 2D Array.mp4
4. Create a 1D Array.mp4
5. Traverse 1D Array.mp4
10. Data Structure - AVL Tree
3. Left-Left Condition (Insertion).srt
8. Delete Node from AVL Tree (LL, LR, RL, RR Condition).srt
4. Details of Rotation & Condition.srt
5. Left-Right Condition (Insertion).srt
7. Right-Left Condition (Insertion).srt
1. What & Why is AVL Tree.srt
6. Right-Right Condition (Insertion).srt
2. CreateAVLTree & Search Operation.srt
9. Delete AVL Tree.srt
10.1 AVLTree.zip
10. Source Code AVL TREE .html
3. Left-Left Condition (Insertion).mp4
8. Delete Node from AVL Tree (LL, LR, RL, RR Condition).mp4
7. Right-Left Condition (Insertion).mp4
6. Right-Right Condition (Insertion).mp4
5. Left-Right Condition (Insertion).mp4
4. Details of Rotation & Condition.mp4
1. What & Why is AVL Tree.mp4
2. CreateAVLTree & Search Operation.mp4
9. Delete AVL Tree.mp4
11. Data Structure - Trie
6. Delete Word.srt
3. Create Trie & Insert Word.srt
5. Search Word.srt
4. Prefix Search.srt
2. Representation of Trie Data Structure.srt
1. What & Why is Trie.srt
7.1 Trie.zip
7. Trie -- Source Code.html
6. Delete Word.mp4
5. Search Word.mp4
3. Create Trie & Insert Word.mp4
4. Prefix Search.mp4
1. What & Why is Trie.mp4
2. Representation of Trie Data Structure.mp4
2. Algorithm Run Time Analysis (Big O Notation)
2. Why should we learn algorithm run time analysis.srt
1. What is Algorithm Runtime Analysis.srt
4. Time Complexity Analysis Example #2.srt
3. Time Complexity Analysis Example #1.srt
2. Why should we learn algorithm run time analysis.mp4
1. What is Algorithm Runtime Analysis.mp4
4. Time Complexity Analysis Example #2.mp4
3. Time Complexity Analysis Example #1.mp4
4. Data Structure - Linked List
3.1 MySinglyLinkedList(Creation&Insertion).zip
4. Insertion (At Index, At Begining & At End) Operations in SSL(Singly LInked List).srt
4.1 MySinglyLinkedList.zip
4.2 MySinglyLinkedList(Insertion).zip
5.1 MySinglyLinkedList(TraversingSearching).zip
6.1 MySinglyLinkedList(DeletingNode&EntireLinkedList).zip
7. Source Code for Singly Linked List (SLL).html
7.1 MySinglyLinkedList.zip
23. Linked List Problem Reverse a Singly Linked List -- Recursive Solution.srt
12. Source Code for Circular Singly Linked List (CSLL).html
12.1 MyCircularSinglyLinkedList.zip
17. Source Code for Doubly Linked List (DLL).html
17.1 MyDoublyLinkedList.zip
24. Linked List Problem Reverse a Singly Linked List -- Iterative Solution.srt
21. Deleting Node & Deleting Entire Linked List (Circular Doubly Linked List).srt
22. Source Code for Circular Doubly Linked List (CDLL).html
22.1 MyCircularDoublyLinkedList.zip
10. Insertion in CSLL (Circular Singly Linked List).srt
20. Insertion in CDLL (Circular Doubly Linked List).srt
6. Deleting Node & Deleting Entire Linked List (Singly Linked List).srt
8. Creation & Insertion Operations in CSLL (Circular Singly Linked List).srt
1. What is Linked List.srt
16. Deleting Node & Deleting Enire Linked List (Doubly Linked List).srt
3. Creation & Insertion Operations in SLL (Singly Linked List).srt
11. Deleting Node & Deleting Entire Linked List (Circular Singly Linked List).srt
14. Traversing & Searching in DLL (Doubly Linked List).srt
9. Traversing & Searching in CSLL (Circular Singly Linked List).srt
18. Creation & Insertion Operations in CDLL (Circular Doubly Linked LIst).srt
15. Insertion in DLL (Doubly LInked List).srt
5. Travering & Searching in SLL (Singly Linked List).srt
2. Different Types of Linked Lists.srt
19. Traversing & Searching in CDLL (Circular Doubly Linked List).srt
13. Creation & Insertion Operations in DLL (Doubly Linked List).srt
23. Linked List Problem Reverse a Singly Linked List -- Recursive Solution.mp4
4. Insertion (At Index, At Begining & At End) Operations in SSL(Singly LInked List).mp4
24. Linked List Problem Reverse a Singly Linked List -- Iterative Solution.mp4
21. Deleting Node & Deleting Entire Linked List (Circular Doubly Linked List).mp4
10. Insertion in CSLL (Circular Singly Linked List).mp4
6. Deleting Node & Deleting Entire Linked List (Singly Linked List).mp4
20. Insertion in CDLL (Circular Doubly Linked List).mp4
3. Creation & Insertion Operations in SLL (Singly Linked List).mp4
8. Creation & Insertion Operations in CSLL (Circular Singly Linked List).mp4
11. Deleting Node & Deleting Entire Linked List (Circular Singly Linked List).mp4
14. Traversing & Searching in DLL (Doubly Linked List).mp4
1. What is Linked List.mp4
16. Deleting Node & Deleting Enire Linked List (Doubly Linked List).mp4
2. Different Types of Linked Lists.mp4
9. Traversing & Searching in CSLL (Circular Singly Linked List).mp4
18. Creation & Insertion Operations in CDLL (Circular Doubly Linked LIst).mp4
15. Insertion in DLL (Doubly LInked List).mp4
5. Travering & Searching in SLL (Singly Linked List).mp4
13. Creation & Insertion Operations in DLL (Doubly Linked List).mp4
19. Traversing & Searching in CDLL (Circular Doubly Linked List).mp4
8. Data Structure - Binary Search Tree (BST)
5. Deletion Node in BST.srt
2. Creation & Insertion in BST.srt
1. What & Why is BST.srt
4. Searching in BST.srt
3. Traversing BST.srt
6. Deletion of BST.srt
7. Source Code BST .html
7.1 BST.zip
5. Deletion Node in BST.mp4
2. Creation & Insertion in BST.mp4
4. Searching in BST.mp4
1. What & Why is BST.mp4
3. Traversing BST.mp4
6. Deletion of BST.mp4
9. Data Structure - Binary Heap
5. Extract Operation.srt
3. Insert into Binary Heap.srt
1. What is Binary Heap & Why.srt
2. Heap Implementation Options.srt
4. Size, IsEmpty & Peek Operation.srt
6. Delete Heap.srt
7.1 HeapUsingArray.zip
7. Source Code Binary Heap.html
5. Extract Operation.mp4
3. Insert into Binary Heap.mp4
2. Heap Implementation Options.mp4
1. What is Binary Heap & Why.mp4
4. Size, IsEmpty & Peek Operation.mp4
6. Delete Heap.mp4
12. Algorithm - Searching
3. Binary Search Algorithm.srt
1. Linear Search Algorithm.srt
4. Code Binary Search Algorithm .html
4.1 BinarySearch.zip
2.1 LinearSearch.zip
2. Code Linear Search Algorithm .html
3. Binary Search Algorithm.mp4
1. Linear Search Algorithm.mp4
14. Algorithm - Recursion
4. Nth Fibonacci.srt
1. What is recursion & Why we should use recursion.srt
3. How recursion works internally.srt
5. Recursion vs Iteration.srt
2. Format of recursion.srt
3.1 Factorial.zip
4.1 Fib.zip
1. What is recursion & Why we should use recursion.mp4
4. Nth Fibonacci.mp4
3. How recursion works internally.mp4
5. Recursion vs Iteration.mp4
2. Format of recursion.mp4
1. Introduction
1. Introduction.srt
1. Introduction.mp4
TutsNode.net.txt
[TGx]Downloaded from torrentgalaxy.to .txt
.pad
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
Torrent description
Feel free to post any comments about this torrent, including links to Subtitle, samples, screenshots, or any other relevant information, Watch The Complete Data Structures and Algorithms Course in Java Online Free Full Movies Like 123Movies, Putlockers, Fmovies, Netflix or Download Direct via Magnet Link in Torrent Details.
