a.txt

mkdir "1. Program for Recursive Binary & Linear Search."
mkdir "2. Program for Heap Sort."
mkdir "3. Program for Merge Sort."
mkdir "4. Program for Selection Sort."
mkdir "5. Program for Insertion Sort."
mkdir "6. Program for Quick Sort."
mkdir "7. Knapsack Problem using Greedy Solution"
mkdir "8. Perform Travelling Salesman Problem"
mkdir "9. Find Minimum Spanning Tree using Kruskal’s Algorithm"
mkdir "10. Implement N Queen Problem using Backtracking"
mkdir "11. Sort a given set of n integer elements using Quick Sort method and compute its time complexity. Run the program for"
mkdir "12. Sort a given set of n integer elements using Merge Sort method and compute its time complexity. Run the program for"
mkdir "13.6. Implement , the 0/1 Knapsack problem using"
mkdir "14. From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra's algorithm."
mkdir "15. Find Minimum Cost Spanning Tree of a given connected undirected graph using Kruskal's algorithm. Use Union-Find"
mkdir "16. Find Minimum Cost Spanning Tree of a given undirected graph using Prim’s algorithm."
mkdir "17. Write programs to (a) Implement All-Pairs Shortest Paths problem using Floyd's algorithm."
mkdir "18. Design and implement to find a subset of a given set S = {Sl, S2,.....,Sn} of n positive integers whose SUM is equal to"
mkdir "19. Design and implement to find all Hamiltonian Cycles in a connected undirected Graph G of n vertices using"