Course Code: CSE265 (BNQF 061)
Course Title: Algorithm
Credits: 3.0
Rationale of the Course:
The purpose of this course is to give basic knowledge of problem-solving procedures. Think of
it as laying out a step-by-step guide that will accomplish a specific task or solve a specific
calculation if the steps are followed in order. This course also teaches students about the time
and space complexity of a solution.
Course Contents:
S/N Contents of the course
1 Introduction: The role of algorithms in computing, Insertion Sort, Analyzing
algorithms, Designing algorithms, Growth of functions, Asymptotic notations,
Probabilistic analysis, and randomized algorithms.
2 Divide and Conquer: The maximum-subarray problem, Merge Sort, The substitution
method for solving recurrences, The recursion-tree method for solving recurrences, The
Master Theorem.
3 Sorting and Order Statistics: Heapsort, Quicksort, Sorting in linear time, Counting
sort, Radix sort, Bucket sort, Medians and order statistics.
4 Data Structures: Elementary data structures, Hash tables, Binary search trees,
Red-black trees, Augmenting data structures.
5 Dynamic Programming: Rod cutting, Matrix-chain multiplication, Longest common
subsequence, Optimal binary search trees.
6 Greedy Algorithms: Fractional Knapsack, An activity-selection problem, Huffman
codes, A task-scheduling problem.
7 Advanced Data Structures: B-Trees, Fibonacci Heaps, van Emde Boas Trees, Data
structures for disjoint sets.
8 Graph Algorithms: Breadth-first search, Depth-first search, Topological sort,
Minimum Spanning Trees, Kruskal and Prim algorithms, Bellman-Ford algorithm,
Dijkstra algorithm, The Floyd-Warshall algorithm, Flow networks, The Ford-Fulkerson
method, Maximum bipartite matching.
9 Number-Theoretic Algorithms: Elementary number-theoretic notions, Greatest
common divisor, Modular arithmetic, Solving modular linear equations, The Chinese
remainder theorem, Integer factorizations.
10 N-P Completeness: Polynomial-time, Polynomial-time verification, NP-completeness
and reducibility, NP-completeness proofs, NP-complete problems.
42
Course Learning Outcomes (CLOs):
At the end of the course, the students will be able to:
CLO1 Explain different algorithmic design strategies and the efficiency of algorithms.
CLO2 Implement the principles and concepts of appropriate algorithm strategies to solve
problems.
CLO3 Inspect various algorithm design techniques for prospective and alternative
solutions.
Mapping of CLOs with PLOs
CLO/PLO mapping ( One ✔ for every CLO )
CLO PLO
PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9 PLO10 PLO11 PLO12
CLO1 ✔
CLO2 ✔
CLO3 ✔
Mapping Course Learning Outcomes (CLOs) with the Teaching-Learning & Assessment
Strategy
Course Learning Teaching-Learning Strategy Assessment Strategy
Outcomes or CLOs
CLO1 Lectures. Formative:
-Discussion
-Problem-based Exercise
-Viva
Summative:
-Mid-Term Exam
CLO2 Lectures, Group Discussion, Formative:
Presentation. -Class Test
-Discussion
-Problem-based Exercise
-Case Study
-Viva
Summative:
-Mid-Term Exam
-Final Exam
CLO3 Lectures, Group Discussion. Formative:
-Class Test
-Discussion
-Problem-based Exercise
43
-Case Study
-Viva
Summative:
-Mid-Term Exam
-Final Exam
44
