
Algorithms Design and Analysis is a fundamental area of computer science that focuses on developing efficient methods for solving computational problems. It involves creating algorithms that are both correct and optimized in terms of time and space complexity. The process includes analyzing their performance, proving their correctness, and ensuring they meet the requirements of the given problem. Key topics include sorting, searching, graph algorithms, dynamic programming, greedy algorithms, and computational complexity. This field is essential for building scalable and effective software solutions.
- Teacher: Rakshya Lama Moktan
- Teacher: Chantri Polprasert

- Teacher: Chantri Polprasert
- Teacher: Sunil Prajapati

An algorithm describes how to carry out a problem-solving task implementable by computer programs. The design of an algorithm is tightly coupled with how information to be manipulated by it is organized i.e. data structuring. A course in Algorithm and Data Structure is therefore fundamental to a study in Computer Science.
- Teacher: Nont Arayarungsarit
- Teacher: Sandhya Lamichhane
- Teacher: Chantri Polprasert
- Teacher: Jirapas Sangsue
- Teacher: teal2 ait
- Teacher: Chantri Polprasert