Office Room #505 (5th floor), CSE Building, Daffodil International University, 102, Subhanbagh, Dhanmondi, Dhaka-1207
Office Hour :
Contact Number: 01915638046
Email : samia@daffodilvarsity.edu.bd
Web Profile: https://faculty.daffodilvarsity.edu.bd/profile/cse/samia.html
CO1
Analyze and calculate time complexity and space complexity of various algorithms or any written code using mathematical formula and comparison of algorithms.
CO2
Generate and interpret the output of iterative and recursive codes with the analysis of the problem definition.
CO3
Identify which algorithm listed under which algorithmic paradigm. Compare among various algorithms/implemented codes and choose the efficient one.
CO4
Break down and describe the simulation of various algorithms for different input values.
CO5
Design and apply appropriate algorithms to solve real-life problems.
**** Additional Support for Students
Introduction and importance of Algorithm and its applicationFunction and Recursion, Euclid’s Greatest Common Divisor(GCD) Algorithm
Gain knowledge about the importance of algorithmPerform exercise on function and recursion function
Week-01: Lecture-01
Week-01: Lecture-02
PowerPoint Slide
Week-01: Lab - 01
Lecture 1 Section H
Lecture 1 Section G
Lecture 1 Section I
Complexity Analysis Sec G
Complexity Analysis Sec H
Complexity Analysis Sec I (1)
Complexity Analysis Sec I (2)
Lab Section H
Lab Section I
Introduction with the Asymptotic Notation Discussion on the Complexity of AlgorithmsImportance of Complexity for designing an Algorithm
Gain knowledge about the importance of algorithmFind out the Asymptotic Notation from an AlgorithmFind out the complexity from any code or algorithm
Complexity Analysis Section G
Complexity Analysis Part 2 Sec G
Discuss on Week-02 content if you have any problem and confusion.
Introduction to brute force techniques.Introduction to the searching Algorithm.Introduction to the sorting AlgorithmQuiz #01
Knowledge about the Linear Search algorithm and its complexityKnowledge about the Insertion sort algorithm and its complexityKnowledge about the Bubble sort algorithm and its complexity Knowledge about the Selection sort algorithm and its complexity Exercise the Sorting and searching Algorithm with some additional problems.
Power point Lecture Slide
=======================
Click for Derails Explanation
Selection Sort and Insertion Sort Section I
Merge Sort Section I
Merge Sort (Class 2) Section I
Merge Sort (Class 3) Section I
Selection Sort and Insertion Sort Section H
Divide and Conquer Approach and Merge Sort Section H
Merge Sort Section H
Merge Sort (Class 3) Section H
Selection Sort and Insertion Sort Section G
Divide and Conquer Approach and Merge Sort Section G
Merge Sort Section G
Introduction to Divide and Conquer Approach.Introduction to the searching Algorithm based on Divide and Conquer Approach. Introduction to the Sorting Algorithm based on Divide and Conquer Approach.
Knowledge about the Binary Search algorithm and its complexityKnowledge about the Merge sort algorithm and its complexityKnowledge about the Quick sort algorithm and its complexityExercise the Sorting and searching Algorithm with some additional problems.
Section: O-2
Question Pattern Discussion
Quick Sort Section I
Quick Sort Section H
Quick Sort Section G
Discuss on Week-04 content if you have any problem and confusion.
Introduction to Greedy ApproachDiscussion on Coin Change ProblemDiscussion on Bin packing ProblemDiscussion on Knapsack ProblemDiscussion on Hoffman codingAssignment-01
Solve the Coin Change Problem based on Greedy MethodSolve the Knapsack Problem based on Greedy MethodSolve the Hoffman coding based on Greedy Method Solve the Bin packing Problem based on Greedy Method Exercise the Sorting Algorithm with some additional problems in the Lab.
*** Section: O-2
Greedy Algorithm and Coin Changing Problem Section I
Bin Packing Algorithm Section I
Bin Packing Algorithm (Part 2) Section I
Fractional Knapsack Problem Section I
Huffman Coding Section I
Huffman Coding (part 2) Section I
Greedy Algorithm and Coin Change Problem Section H
Bin Packing Algorithm Section H
Introduction to Dynamic Programming (DP)Discussion on Fibonacci Numbers ProblemDiscussion on Coin Change Problem (DP)Discussion on Knapsack Problem (0/1)
Solve the Coin Change Problem based on DPSolve the Knapsack Problem based on DPSolve the Fibonacci Numbers Problem based on DPExercise the Bin-packing Algorithm with some additional problems in the Lab.
DP: Coin Change
Coin Change
Bin Packing
Fractional Knapsack
Live discussion
Introduction to Dynamic Programming (Sec G)
Dynamic Programming: Coin Change (Sec G)
Dynamic Programming: Coin Change (Part 2) (Sec G)
Introduction to Dynamic Programming (Sec I)
Dynamic Programming: Coin Change (Sec I)
Dynamic Programming: Coin Change (Part 2) (Sec I)
Lab Section I (Part 2)
Introduction to Dynamic Programming (Sec H)
Dynamic Programming: Coin Change (Sec H)
0/1 Knapsack Problem (Sec H)
Lab Section G
0/1 Knapsack Problem (Sec I)
Longest Increasing Subsequence (Sec I)
Longest Common Subsequence (Sec I)
0/1 Knapsack Problem (Sec G)
Longest Increasing Subsequence (Sec G)
Longest Increasing Subsequence (Sec H)
Longest Common Subsequence (Sec H)
Longest Common Subsequence (Sec G)
(2) Write responses in the answer script template either type or hand written
(3) Save the answer script template as pdf e.g. CSE214-O1-111-15-1234-mid.pdf (Course Code-Section-Student ID)
During this open book exam, you need to ensure the following items and code of conducts:
(1) You can use your Books, online repository and other relevant materials
(2) Your other supporting materials like clock, pen, pencil, eraser, calculator etc
(3) No discussion in group or with your classmates as it will be reflected in your answers
(4) No sharing of codes, write-ups or ideas as this will be automatically detected by DIU BLC and will lead to negative marking proposed by the system
l
Introduction to Dynamic Programming (DP)Discussion on longest Common Subsequence and Edit Distance ProblemDiscussion on longest Increasing Subsequence (DP)
Solve the Longest Common Subsequence (LCS) Problem based on DPSolve the Longest Increasing Subsequence (LIS)Exercise the Bin-packing, LCS, LIS Algorithm with some additional problems in the Lab.
LIS
LCS
Discuss on Week-08 content if you have any problem and confusion.
Introduction to GraphGraph RepresentationDiscussion on Graph Traversal
Solve the Breadth-First Search (BFS) algorithmSolve the Depth First Search (DFS) Algorithm
Lab Task on Graph
Graph Introduction (Sec I)
BFS (Sec I)
DFS Sec I
Topological Sort Sec I
MST and Prims Sec I
Kruskal Sec I
Dijkstra Sec I
Graph Introduction (Sec H)
BFS (Sec H)
DFS (Sec H)
DFS Part 2 Sec H
MST and Prims Sec H
Kruskal Sec H
Dijkstra Sec H
Graph Introduction (Sec G)
BFS Sec G
DFS Sec G
Topological Sort Sec G
MST and Prims Sec G
Prims Part 2 Sec G
Dijkstra Sec G
Discussion on Minimum Spanning Tree (MST)Discussion on Single Source Shortest Path
Solve MST using Kruskal’s AlgorithmSolve MST using Prim’s AlgorithmSingle-Source Shortest Path(SSSP) by Dijkstra’s Algorithm
Discuss on Week-11 content if you have any problem and confusion.
Discuss on Final Exam content if you have any confession or question
(3) Save the answer script template as pdf e.g. CSE214-O1-111-15-1234-final.pdf (Course Code-Section-Student ID)