for pages 1

Author: himanshu9084

README.md

@@ -5,15 +5,15 @@ E0 251 Data Structures and Algorithms course is offered by Department of Compute
 
 E0 251 Data Structures and Algorithms, CSA, IISc Bangalore
 - Solved Assignments for Aug 2019 Course
-1) Sparse Data Structures(Matrices), COO, CSR, CSC Format
-2) a) Large unsigned integer arithmetic
+*  Sparse Data Structures(Matrices), COO, CSR, CSC Format
+*  a) Large unsigned integer arithmetic
 
- b) Polynomial division
-3) Computing Betweenness Centrality in an Undirected Graph using Floyd Warshall and BFS algo
-4) a) Persistent Data Structures
+  b) Polynomial division
+*  Computing Betweenness Centrality in an Undirected Graph using Floyd Warshall and BFS algo
+*  a) Persistent Data Structures
 
  b) Solving a maze using persistent stack
-5) User defined malloc and free
+*  User defined malloc and free
 
 
 Syllabus :