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.
Grading Scheme
Theory Class Lab ClassAttendance: 7% Attendance: 10% Class Tests/Quizzes: 15% Lab performance Test: 40% Assignment: 5% Lab problem Solving: 25%Presentation (using video/ppt): 8% Lab Submission: 25%Midterm Exam: 25%Final Exam: 40%
Text Book:a. Introduction to Algorithms, (3rd Edition, MIT Press, 2009) ISBN: 9780262033848. Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein
Course Outline
Reference Books:a. Algorithms (4th Edition) Author: Robert Sedgewick and Kevin Wayneb. Algorithm Design Author: Jon Kleinberg, Eva Tardosc. Data Structures And Algorithms Made Easy In JAVA Author: Narasimha Karumanchi
Useful Web Links:
Additional Support for Students
· Student Portal: http://studentportal.diu.edu.bd/
· Academic Guidelines https://daffodilvarsity.edu.bd/article/academic-guidelines
· Rules and Regulations of DIU https://daffodilvarsity.edu.bd/article/rules-and-regulation
· Career Development Center: https://cdc.daffodilvarsity.edu.bd/
· For general queries: http://daffodilvarsity.edu.bd/
Topics of discussion
Expected Learning Outcome
Function and Recursion Euclid’s Greatest Common Divisor(GCD) Algorithm
A decision on structures and loop, Array, String, Function, Recursion
Discuss on Week-01 content if you have any problem and confusion.
Complexity Analysis
problems with Array, String, Function, Recursion
Discuss on Week-02 content if you have any problem and confusion.
Brute Force algorithm Linear SearchInsertion Sort
Bubble Sort,Selection Sort
Linear Search
Simulate step by step sorting Algorithm for given array: [input your ID last 5 digit]
1. Insertion Sort
2. Bubble Sort
Solve selection sort by yourself and comment when done.
Binary SearchMerge SortDivide and Conquer Approach
Video LinkPPT link
Quick Sort
PPT 2
Bubble SortInsertion SortBinary Search
Video Link Manual Link
Question:
Discuss on Week-04 content if you have any problem and confusion.
Coin Change (Greedy Method) Bin-Packing Problem
Suppose DIU is setting up a high configuration Computer Lab at Ashulia Campus. Now there will be hundreds of computers and they all need to be labeled. After labelling the lab assistant got puzzled thinking that how he’s going to sort them in the lab room. Help him to sort the PC’s . You can do it by sampling any 10 PC’s so that he understands the process. [10]
Devise an algorithm which will find out the smallest element from an n sized array. [05]
Take your mothers name in an array and search your last name's last letter as a searching element. [05]
Narrate a problem where you can use any particular sorting Algorithm and also mention why you have selected it. [10]
Oral for all(Once you submit your work, you can appear in Oral) [10]
***Late submission will deduct -5
***No submission over any media except BLC will be considered in any circumstances. Upload partial works if you can not submit within time as after given time NO SCRIPTS WILL BE EVALUATED IN ANY CIRCUMSTANCES.
Solve the First Fit decreasing and Full Bin Packing problem from slide and submit here
Your Script must contain your course code, ID and section and exam type like: CSE214_171-15-887_MID_PCE
Dear Students,
4. Follow the instructions strictly.
Dynamic Programming Fibonacci Numbers Problem
DP: Coin Change DP: 0/1 Knapsack
Bin Packing
Longest Common Subsequence (LCS)
Longest Increasing Subsequence(LIS)
Bin Packing, LCS, LIS
1. For LCS: Input First name, Last name
2. For LIS: Input Your ID
Discuss on Week-08 content if you have any problem and confusion.
Graph and Graph Representation
BFS, DFS
DFS
1. Apply DFS/LCS/LIS Algorithm(Codes provided in BLC Lab Manual)
2. Submit at least two of the above codes in the following Classwork Section
DFS: https://drive.google.com/file/d/1qXnmPxm7-p_f0x2zmeM8PkskeUHFD9sc/view?usp=sharing
LCS/LIS: https://drive.google.com/file/d/1EFBXsttpWABRK77Ay5A9-d_ZVvvRtAeP/view?usp=sharing
Discuss on Week-09 content if you have any problem and confusion.
Full Tree TraversalCycle FindingComponent Finding
Ts, SCC
DFS, MSTLab performance-02
Propose a real life problem with it's solving Algorithm(Individual)
****No repetition will be considered.
Discuss on Week-10 content if you have any problem and confusion.
MST: Kruskal’s Algorithm MST: Prim’s Algorithm
SSSP: Dijkstra’s Algorithm
MST, Dijkstra’s Algorithm
Quiz Syllabus:
1. Brute force
2. Divide and Conquer
3. Greedy Approach
4. Dynamic programming
Discuss on Week-13 on Final Presentation and Lab Final.
Submit all the problems solved in the entire semester in a PDF form as Lab Report
Discuss on Final Exam content if you have any confession or question