COL106: Difference between revisions
| [checked revision] | [pending revision] |
Prashantt492 (talk | contribs) Creating course page via bot |
m Made COL100 a link (a simple edit to see how this wiki works) |
||
| Line 4: | Line 4: | ||
| credits = 5 | | credits = 5 | ||
| credit_structure = 3-0-4 | | credit_structure = 3-0-4 | ||
| pre_requisites = COL100 | | pre_requisites = [[COL100]] | ||
| overlaps = | | overlaps = | ||
}} | }} | ||
Latest revision as of 15:35, 14 April 2026
| COL106 | |
|---|---|
| Data Structures & Algorithms | |
| Credits | 5 |
| Structure | 3-0-4 |
| Pre-requisites | COL100 |
| Overlaps | |
COL106 : Data Structures & Algorithms
Introduction to object-oriented programming through stacks queues and linked lists. Dictionaries; skip-lists, hashing, analysis of collision resolution techniques. Trees, traversals, binary search trees, optimal and average BSTs. Balanced BST: AVL Trees, 2-4 trees, red-black trees, 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's algorithm, directed acyclic graphs and topological sort. Some geometric data-structures.