This is for the CSE 208: Algorithms Lab course at the Department of Computer Science and Engineering, University of Asia Pacific. This repo contains all the codes for this course. The codes are written in both C and C++.
This course is designed to provide students with a solid foundation and hands on experience in algorithm design and analysis. The course will cover the basic techniques for designing efficient algorithms and fundamental methods for analyzing their efficiency. The course will cover the following topics: algorithm analysis, sorting and searching, graph algorithms, greedy algorithms, divide-and-conquer, dynamic programming, and approximation algorithms.
- Course Title: Algorithms
- Course Code: CSE 208
- Semester: 2-2
- Credit Hours: 1.5
- Prerequisite: none
- Faculty: Md. Shahidul Islam
- Sorting Algorithms: Contains the codes for Merge and Quick Sort.
- Searching Algorithms: Contains the codes for Binary Search and Ternary Search.
- Dynamic Programming: Contains the codes for 01 Knapsack and Longest Common Subsequence.
- Greedy Algorithms: Contains the codes for Coin Change, Fractional Knapsack and Job Sequencing with Deadlines.
- Graph Algorithms: Contains the codes for BFS, DFS, Dijkstra's and Bellman-Ford Algorithm.
- Backtracking: Contains the codes for N-Queens and Graph Coloring Algorithm.
- Branch and Bound: Contains the codes for the 15-Puzzle Problem.
- String Matching: Contains the codes for Rabbin-Karp Algorithm.
- Approximation Algorithms: Contains the codes for Travelling Salesman Problem, Vertex Cover and Subset Sum Algorithm.
- README.md: Contains the description of the repository (This file).