README

DSC-13 Algorithms and Advanced Data Structures

Welcome to the collection of practical assignments for the Algorithms and Advanced Data Structures course.

1) Write a program to sort the elements of an array using Randomized Quick sort (the program should report the number of comparisons).

2) Write a program to find the ith smallest element of an array using Randomized Select.

3) Write a program to determine the minimum spanning tree of a graph using Kruskal’s algorithm.

4) Write a program to implement the Bellman Ford algorithm to find the shortest paths from a given source node to all other nodes in a graph.

5) Write a program to implement a B-Tree.

6) Write a program to search a pattern in a given text using the KMP algorithm.

7) Write a program to implement a Suffix tree.

<i>Developed with ❤️ by <a href="https://github.com/16ratneshkumar">16ratneshkumar</a></i>

</p>