Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Advanced Data Structures (210252)
Unit I Trees
Session 1 : Tree- basic terminology
Session 2 : General tree and its representation
Session 3 : representation using sequential and linked organization
Session 4 : Binary tree- properties
Session 5 : converting tree to binary tree
Session 6 : binary tree traversals- inorder
Session 7 : preorder
Session 8 : post order
Session 9 : level wise -depth first and breadth first
Session 10 : Operations on binary tree
Session 11 : Binary Search Tree (BST)
Session 12 : BST operations
Session 13 : Threaded binary tree- concepts
Session 14 : threading
Session 15 : insertion and deletion of nodes in in-order threaded binary tree
Session 16 : in order traversal of in-order threaded binary tree
Session 17 : Case Study- Use of binary tree in expression tree-evaluation and Huffman's coding
Unit II Graphs
Session 18 : Basic Concepts
Session 19 : Storage representation
Session 20 : Adjacency matrix
Session 21 : adjacency list
Session 22 : adjacency multi list
Session 23 : inverse adjacency list.
Session 24 : Traversals-depth first and breadth first
Session 25 : Introduction to Greedy Strategy
Session 26 : Minimum spanning Tree
Session 27 : Greedy algorithms for computing minimum spanning tree- Prims and Kruskal Algorithms
Session 28 : Dikjtra's Single source shortest path
Session 29 : Topological ordering
Session 30 : Case study- Data structure used in Webgraph and Google map.
Unit III Hashing
Session 31 : Hash Table- Concepts-hash table
Session 32 : hash function
Session 33 : bucket
Session 34 : collision
Session 35 : probe
Session 36 : synonym
Session 37 : overflow
Session 38 : open hashing
Session 39 : closed hashing
Session 40 : perfect hash function
Session 41 : load density
Session 42 : full table
Session 43 : load factor
Session 44 : rehashing
Session 45 : issues in hashing
Session 46 : hash functions- properties of good hash function
Session 47 : division
Session 48 : multiplication
Session 49 : extraction
Session 50 : mid-square
Session 51 : folding and universal
Session 52 : Collision resolution strategies- open addressing and chaining
Session 53 : Hash table overflow- open addressing and chaining
Session 54 : extendible hashing
Session 55 : Dictionary- Dictionary as ADT
Session 56 : ordered dictionaries
Session 57 : Skip List- representation
Session 58 : searching and operations- insertion
Session 59 : removal
Unit IV Search Trees
Session 60 : Symbol Table-Representation of Symbol Tables- Static tree table and Dynamic tree table
Session 61 : Introduction to Dynamic Programming
Session 62 : Weight balanced tree
Session 63 : Optimal Binary Search Tree (OBST)
Session 64 : OBST as an example of Dynamic Programming
Session 65 : Height Balanced Tree- AVL tree
Unit V Indexing and Multiway Trees
Session 66 : Indexing and Multiway Trees- Indexing
Session 67 : indexing techniques
Session 68 : Types of search tree- Multiway search tree
Session 69 : B-Tree
Session 70 : B+Tree
Session 71 : Trie Tree
Session 72 : Splay Tree
Session 73 : Red-Black Tree
Session 74 : K-dimensional tree
Session 75 : AA tree
Session 76 : Set- Set ADT
Session 77 : realization of Set and operations
Session 78 : Heap-Basic concepts
Session 79 : realization of heap and operations
Session 80 : Heap as a priority queue
Session 81 : heap sort
Unit VI File Organization
Session 82 : Sequential file organization- concept and primitive operations
Session 83 : Direct Access File- Concepts and Primitive operations
Session 84 : Indexed sequential file organization-concept
Session 85 : types of indices
Session 86 : structure of index sequential file
Session 87 : Linked Organization- multi list files
Session 88 : coral rings
Session 89 : inverted files and cellular partitions
Session 90 : External Sort- Consequential processing and merging two lists
Session 91 : multiday merging- a k way merge algorithm
Session 88 : coral rings
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock