Course Code - CSE131-132

Course Title - Algorithm Design And Analysis

CSE131 - Algorithm Design & Analysis

CSE132 - Algorithm Design & Analysis Lab

Algorithm Topics

This repository covers a variety of algorithm topics that are fundamental in computer science and problem-solving.

Table of Contents

• Sorting Algorithms
• Searching Algorithms
• Graph Algorithms
• Dynamic Programming
• Divide and Conquer
• Greedy Algorithms
• Backtracking Algorithms
• String Algorithms
• Computational Geometry
• Miscellaneous Algorithms

Sorting Algorithms

1. Bubble Sort
2. Selection Sort
3. Insertion Sort
4. Merge Sort
5. Quick Sort
6. Heap Sort
7. Radix Sort
8. Bucket Sort
9. Counting Sort

Searching Algorithms

1. Linear Search
2. Binary Search
3. Depth-First Search (DFS)
4. Breadth-First Search (BFS)

Graph Algorithms

1. Dijkstra's Algorithm
2. Bellman-Ford Algorithm
3. Floyd-Warshall Algorithm
4. Prim's Algorithm (Minimum Spanning Tree)
5. Kruskal's Algorithm (Minimum Spanning Tree)
6. Topological Sort
7. Strongly Connected Components (SCC)
8. Travelling Salesman Problem (TSP)
9. A* Algorithm (A-star)

Dynamic Programming

1. Fibonacci Series
2. Longest Common Subsequence (LCS)
3. Knapsack Problem
4. Matrix Chain Multiplication
5. Shortest Path in a Grid
6. Edit Distance
7. Coin Change Problem

Divide and Conquer

1. Maximum Subarray Sum
2. Closest Pair of Points
3. Strassen's Matrix Multiplication

Greedy Algorithms

1. Activity Selection Problem
2. Fractional Knapsack Problem
3. Dijkstra's Algorithm (Greedy Variation)
4. Huffman Coding
5. Job Scheduling Algorithms

Backtracking Algorithms

1. N-Queens Problem
2. Sudoku Solver
3. Hamiltonian Cycle
4. Subset Sum
5. Rat in a Maze

String Algorithms

1. String Matching Algorithms (Brute Force, KMP, Rabin-Karp)
2. Longest Common Substring
3. Longest Palindromic Substring
4. Pattern Searching Algorithms

Computational Geometry

1. Convex Hull Algorithms (Graham Scan, Jarvis March)
2. Line Intersection
3. Closest Pair of Points (Different Approach)

Miscellaneous Algorithms

1. Primality Testing
2. Sieve of Eratosthenes
3. Fast Fourier Transform (FFT)
4. Strassen's Matrix Multiplication

This list provides a broad overview of various algorithm topics categorized by their functionalities.