Repository files navigation

E0 251 Data Structures and Algorithms course is offered by Department of Computer Science and automation, Indian Institute of Science, Bangalore.

Kindly, Do not use the code.

E0 251 Data Structures and Algorithms, CSA, IISc Bangalore

• Solved Assignments for Aug 2019 Course

• Sparse Data Structures(Matrices), COO, CSR, CSC Format

• a)  Large unsigned integer arithmeticb)  Polynomial division

• Computing Betweenness Centrality in an Undirected Graph using Floyd Warshall and BFS algo

• a)  Persistent Data Structuresb)  Solving a maze using persistent stack

• User defined malloc and free

Syllabus :

• Abstract data types and data structures, Classes and objects
• Complexity of algorithms: worst case, average case, and amoritized complexity.
• Algorithm analysis. Algorithm Design Paradigms.
• Lists: stacks, queues, implementation, garbage collection.
• Dictionaries: Hash tables, Binary search trees, AVL trees, Red-Black trees, Splay trees, Skip-lists, B-Trees.
• Priority queues. Graphs: Shortest path algorithms, minimal spanning tree algorithms, depth-first and breadth-first search.
• Sorting: Advanced sorting methods and their analysis, lower bound on complexity, order statistics.