https://wiki.devclub.in/index.php?action=history&feed=atom&title=COL702 2026-04-09T06:03:27Z Revision history for this page on the wiki MediaWiki 1.45.1 https://wiki.devclub.in/index.php?title=COL702&diff=569&oldid=prev 2026-03-04T09:59:54Z

<p>Creating course page via bot</p> <p><b>New page</b></p><div>{{Infobox Course<br /> | code = COL702<br /> | name = Advanced Data Structures and Algorithms<br /> | credits = 4<br /> | credit_structure = 3-0-2<br /> | pre_requisites = COL106 OR Equivalent<br /> | overlaps = COL351<br /> }}<br /> <br /> == COL702 : Advanced Data Structures and Algorithms ==<br /> Review of basic data structures and their realization in object oriented Environments. Dynamic Data structures: 2-3 trees, Redblack trees, binary heaps, binomial and Fibonacci heaps, Skip lists, Universal Hashing. Data structures for maintaining ranges, intervals and disjoint sets with applications. B-trees. Tries and suffix trees. Priority queues and binary heaps. Sorting: merge, quick, radix, selection and heap sort, Graphs: Breadth first search and connected components. Depth first search in directed and undirected graphs. Disjkra&#039;s algorithm, Directed acyclic graphs and topological sort. Some geometric data- structures. Basic algorithmic techniques like dynamic programming and divide-and-conquer. Sorting algorithms with analysis, integer sorting. Graph algorithms like DFS with applications, MSTs and shortest paths.</div>

Prashantt492