| File | Size |
|---|
| !! IMPORTANT Note !!.txt | 287.00 B |
| !!! Please Support !!! [CoursesGhar.Com].txt | 197.00 B |
| 1.Linked List/1.Introduction to Single linked list.m4v | 88.51 MB |
| 1.Linked List/10.Insertion into doubly linked list.mp4 | 70.48 MB |
| 1.Linked List/2.Traversing a single linked list.m4v | 46.72 MB |
| 1.Linked List/3.Inserting an element in SLL.mp4 | 119.20 MB |
| 1.Linked List/4.Deleting a node from SLL.mp4 | 110.13 MB |
| 1.Linked List/6.Printing the elements of SLL using recursion.mp4 | 82.26 MB |
| 1.Linked List/7.Reversing an SLL using iterative program.mp4 | 98.28 MB |
| 1.Linked List/8.Recursive program for reversing an SLL.mp4 | 100.07 MB |
| 1.Linked List/9.Circular linked list.mp4 | 25.44 MB |
| 2.Stacks and Queues/1.Introduction to stacks.m4v | 42.15 MB |
| 2.Stacks and Queues/2.Implementation of stack using arrays.m4v | 102.56 MB |
| 2.Stacks and Queues/3.Linked list implementation of stack.mp4 | 81.85 MB |
| 2.Stacks and Queues/4.Implementation of a Queue using circular array.mp4 | 141.65 MB |
| 2.Stacks and Queues/5.Implementing a queue using two stacks.mp4 | 180.67 MB |
| 2.Stacks and Queues/6.Implementing queue using one stack.mp4 | 39.84 MB |
| 2.Stacks and Queues/7.Infix to postfix conversion algorithm.mp4 | 159.93 MB |
| 2.Stacks and Queues/8.Postfix evaluation algorithm.mp4 | 66.86 MB |
| 3.Trees/1.Introduction to tree traversals.m4v | 92.92 MB |
| 3.Trees/10.Recursive program to count the number of leaves and non leaves.mp4 | 103.54 MB |
| 3.Trees/11.Recursive program to find the full nodes.mp4 | 120.34 MB |
| 3.Trees/12.Recursive program to find the height of a tree.mp4 | 74.14 MB |
| 3.Trees/13.Introduction to BST.mp4 | 61.21 MB |
| 3.Trees/14.Deleting a node from BST.mp4 | 80.24 MB |
| 3.Trees/15.Finding minimum and maximum in a BST.mp4 | 62.38 MB |
| 3.Trees/16.Leaves in complete n-ary tree GATE 98 question.mp4 | 72.60 MB |
| 3.Trees/17.Leaves in complete n-ary tree 2002 question.mp4 | 32.50 MB |
| 3.Trees/18.Recursive program on testing whether a tree is complete binary tree.mp4 | 68.75 MB |
| 3.Trees/19.Expression trees.mp4 | 51.74 MB |
| 3.Trees/2.Implementation of traversals and time and space analysis.m4v | 155.68 MB |
| 3.Trees/20.Various tree representations.mp4 | 87.80 MB |
| 3.Trees/3.Double order traversal.m4v | 90.67 MB |
| 3.Trees/4.Triple order traversal.mp4 | 30.57 MB |
| 3.Trees/5.Indirect recursion on trees.mp4 | 85.55 MB |
| 3.Trees/6.Number of binary trees possible.mp4 | 35.31 MB |
| 3.Trees/7.Number of binary trees possible labelled and unlabelled.mp4 | 136.24 MB |
| 3.Trees/8.construction of unique binary tree using In order and preorder.mp4 | 94.31 MB |
| 3.Trees/9.Recursive program to count the number of nodes.mp4 | 95.84 MB |
| 4.Graphs/1.Introduction to Graphs.m4v | 55.73 MB |
| 4.Graphs/10.Introduction to Topological Sort.mp4 | 19.53 MB |
| 4.Graphs/11.Algorithm for topological sort (Approach-1).mp4 | 26.61 MB |
| 4.Graphs/12.Algorithm for topological sort (Approach 2).mp4 | 34.66 MB |
| 4.Graphs/2.Representation of Graphs.m4v | 67.86 MB |
| 4.Graphs/3.Introduction of BFS and DFS.m4v | 65.54 MB |
| 4.Graphs/4.BFS algorithm.mp4 | 116.06 MB |
| 4.Graphs/5.BFS analysis in case of linked list implementation of Graph.mp4 | 50.33 MB |
| 4.Graphs/6.BFS analysis on adjacency matrix implementation.mp4 | 29.27 MB |
| 4.Graphs/7.Breadth First Traversal using BFS.mp4 | 56.31 MB |
| 4.Graphs/8.DFS algorithm.mp4 | 104.31 MB |
| 4.Graphs/9.Analysis of DFS and DFT.mp4 | 50.02 MB |
| 5.Hashing/1.Direct Address Table.m4v | 63.94 MB |
| 5.Hashing/2.Introduction to Hashing.m4v | 122.79 MB |
| 5.Hashing/3.Chaining.mp4 | 56.47 MB |
| 5.Hashing/4.Open addressing.mp4 | 167.63 MB |
| 5.Hashing/5.Linear probing.mp4 | 103.37 MB |
| 5.Hashing/6.Quadratic probing.mp4 | 128.44 MB |
| 5.Hashing/7.Double hashing.mp4 | 81.01 MB |
| 6.Disjoint Sets/1.Data Structure for Disjoint Sets.m4v | 19.96 MB |
| 6.Disjoint Sets/10.Time complexity using the Heuristics.mp4 | 26.67 MB |
| 6.Disjoint Sets/11.Kruskals algorithm using Disjoint sets.mp4 | 31.76 MB |
| 6.Disjoint Sets/12.Example on kruskals using Disjoint sets.mp4 | 37.51 MB |
| 6.Disjoint Sets/13.Connected components using Disjoints.mp4 | 20.91 MB |
| 6.Disjoint Sets/14.Example on connected components using Disjoint sets.mp4 | 20.95 MB |
| 6.Disjoint Sets/2.Operations on Disjoint Sets.m4v | 24.37 MB |
| 6.Disjoint Sets/3.Linked list representation of disjoint sets.m4v | 27.38 MB |
| 6.Disjoint Sets/4.Time complexity for linked list representation of Disjoint Sets.mp4 | 27.68 MB |
| 6.Disjoint Sets/5.Amortized analysis of disjoint sets using linked list representation.mp4 | 35.94 MB |
| 6.Disjoint Sets/6.Disjoint set forest.mp4 | 21.87 MB |
| 6.Disjoint Sets/7.Union by rank.mp4 | 11.68 MB |
| 6.Disjoint Sets/8.Analysis union by rank.mp4 | 59.13 MB |
| 6.Disjoint Sets/9.Path compression.mp4 | 32.08 MB |
| telegram @coursesghargate.url | 128.00 B |
| Uploaded by [Coursesghar.com].txt | 1.10 kB |
| Visit coursesghar.com for more awesome tutorials.url | 114.00 B |
| [TGx]Downloaded from torrentgalaxy.to .txt | 564.00 B |
English
