#1
July 27th, 2016, 01:18 PM
| |||
| |||
IIT Bombay Data Structures
Which are the topics included in Data structure subject of Indian Institute of Technology Bombay (IIT Bombay) ?
|
#2
July 27th, 2016, 02:39 PM
| |||
| |||
Re: IIT Bombay Data Structures
As per your request I am here giving you topics included in Data structure subject of Indian Institute of Technology Bombay (IIT Bombay). Data Structure Subject Topics: Motivation: Data Structures in Real Life, How to implement a search engine Union-Find Algorithms Complexity Analysis and Recurrence Relations Motivating Link Lists: implementing Dynamic Sets using arrays, problems: a) deletion, b) maintaining it in sorted fashion. Insertion Sort, Selction Sort. Applying Link Lists: Bucket Sort Assignment 2 solution Link List Implementation Abstract Data Types Link List Continued Swine Flu Break Quiz, Prog. Assignment 4 Discussion Writing Bug Free code, using a debugger Stack, Solving Algebraic Expressions Implementation choices for Stack, Removing Recursion using Stack Repeat Lecture on Removing Recursion using Stack ADT Queue and its applications Queue Implementation Issues, circular array based implementation Hashing: ADT, Applications, Implementation - Chaining Hash function for various data types: float, string. Linear Probing: Motivation, Implementation, Properties Clustering. Double Hashing. Analysis. Random Probing. Real Life Issues. A simple sorting algorithm from basic specification and its analysis QuickSort, Partition method from basic specification QuickSort Analysis Trees, Basic Recursive Definition, Properties Tree Traversal, Complete Binary Tree, Priority Queue ADT and Implementation, Heap and Array Based Implementation Optimizing N consecutive insertions in Heap Pointer Based Heap - various methods, removing complete binary tree condition Binary Search Tree: Definition, Insert, Search Binary Search Tree: Analysis of Avergae Search Cost, Deletion, Merge Rotation and Height Balanced Binary Search Trees: Randomized BSTs and Treap 2-3-4 Tree Red-Black Tree: Basic properties, insertion. Allows red link in 3-node to be either left or right child. Search Structures for Strings: Tries, Ternary Search Trees KD-Tree: Search Structure for multi-dimensional data Left Leaning Red-Black Tree: Red link in 3-node can be only left child. Split all 4 nodes. Left Leaning Red-Black Tree: Do not split 4 nodes Graphs: Basic Definitions and Properties Unweighted Graphs: Finding a path between given set of points/DFS Unweighted Graphs: Finding the shortest path between given set of points/BFS; properties of BFS/DFS tree Weighted Graphs: Shortest path - Dijkstra's Algorithm Generic Graph Traversal using various data-structures Discussion session on Minimal Spanning Tree, Topological Sorting, Bi-partite Graphs Address: Indian Institute of Technology Bombay Powai Mumbai, Maharashtra 400076 |
|