Skip to content

Commit ae4ae25

Browse files
Venkata ChiluvuriVenkata Chiluvuri
authored andcommitted
Readme Updated
1 parent 5cb9882 commit ae4ae25

File tree

1 file changed

+3
-2
lines changed

1 file changed

+3
-2
lines changed

README.md

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# Data Structures
22

3-
## Introduction to Data Structures: Information and Meaning
3+
### Introduction to Data Structures: Information and Meaning
44

55
A Data-Structure is data organization, management and storage format that enables efficent efficient access of data and modification.
66

@@ -12,6 +12,7 @@ Whereas data structure is implementation dependent, as in the same example, it i
1212

1313
Next we will learn following Data structures and implement their operations in python.
1414

15+
### Working on Data Structures
1516
| Data Structures | Operations |
1617
| :-------------: |:-------------:|
1718
| Stack | As an Abstract Data Type - Implementing the Stack and Infix, Postfix and Prefix: Definitions, Evaluationand Conversions.|
@@ -25,7 +26,7 @@ Next we will learn following Data structures and implement their operations in p
2526
| Tree Searching | Insertion into a Binary Search Tree – Deleting from a Binary Search Tree – Efficiency of Binary Search Tree operation|
2627
| Graphs and Their Application | Application of Graphs – Representation of Graphs in C – Transitive closure – Warshall’s Algorithm – Shortest Path Algorithm.|
2728
| Linked Representation of Graphs | Dijikstra’s Algorithm – Organizing the set of Graph Nodes – Application to Scheduling and its implication.|
28-
| Graph Traversal and Spanning Forests| Undirected Graph and their Traversals, Applications and Efficiency – Minimal Spanning Trees –Prim’s and Kruskal’s Algorithms.|
29+
| Graph Traversal and Spanning Forests| Undirected Graph and their Traversals, Applications and Efficiency – Minimal Spanning Trees – Prim’s and Kruskal’s Algorithms.|
2930

3031

3132

0 commit comments

Comments
 (0)