1.      COURSE SUMMARY:

This course is designed as a one-semester course for the algorithm concepts for undergraduate Computing & Information System students. The course covers the analysis of various algorithms while introducing the topic of time complexity as a metric to judge similar algorithms. Furthermore, the course enables the students to write pseudocodes and algorithms of their own based on the problem. This course has found a profound application in the field of computing since algorithms can very well be deemed as the soul of computing.

2.      COURSE OBJECTIVE:

 The course aims to provide the students with fundamental knowledge about algorithms and pseudocodes. Students will also learn about writing and analyzing algorithms and pseudocodes and simulate how very common algorithms work. Students will also be familiarized with common algorithms that they would need to utilize in the future.

• Lecture-1 (Introduction to Algorithms)


• Lecture-2 (Time Complexity Analysis)


• Lecture-3 (Searching Algorithms)


• Lecture-4 (Sorting Algorithms)


• Lecture-5 (Merge & Quick Sort)