Tag: algorithms

All the articles with the tag "algorithms".

• CS3016/02. Program graph theory reductions among clique, vertex cover, and independent set problems.

   Updated: Mar 5, 2025  4 hours read

  To understand and implement polynomial-time reductions among the Clique, Vertex Cover, and Independent Set problems, which are fundamental in computational complexity and NP-completeness.

• CS3016/01. Implement divide-and-conquer algorithms for binary search, merge sort, and quick sort.

   Published: Feb 22, 2025  4 hours read

  To understand and implement divide-and-conquer algorithms - Binary Search, Merge Sort, and Quick Sort, and analyze their time and space complexities.