Academic Year: 2022/2023
Semester: Semester I
Analysis of algorithms: Time complexity, Big-O notation, Complexity classes; Sorting algorithms and their analysis: Insertion sort, Bubble sort, Selection sort, Quick sort, Heap sort, Merge sort; Algorithm Design Paradigms: Divide and Conquer, Dynamic Programming, Greedy algorithms;
Algorithms by field of study: Graph algorithms, Searching algorithms, Optimization algorithms; NP-completeness: Polynomial time, NP-completeness and reducibility, NP-complete problems.
Practical assignments will be given for this course.
Semester: Semester I
Analysis of algorithms: Time complexity, Big-O notation, Complexity classes; Sorting algorithms and their analysis: Insertion sort, Bubble sort, Selection sort, Quick sort, Heap sort, Merge sort; Algorithm Design Paradigms: Divide and Conquer, Dynamic Programming, Greedy algorithms;
Algorithms by field of study: Graph algorithms, Searching algorithms, Optimization algorithms; NP-completeness: Polynomial time, NP-completeness and reducibility, NP-complete problems.
Practical assignments will be given for this course.
- Teacher: Kansaji Kotuwage
- Teacher: Keerthiha Krishnapillai
- Teacher: Ruwan Nawarathna