#### Welcome to Algorithm Lab

**This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis. Here I will focus on different types of algorithms like Dynamic Programming, Greedy Approach and so on.***Welcome Audio by Taslima Ferdaus:*Instructor

*:**Designation:*Senior Lecturer

710001783*Employee ID:*

*Email: shuva .cse@diu.edu.bd*

Office: House # 2, Road # 1, Sector # 6, Uttara. Room No: 601

**Appointment in Google Calendar: Click here****Google Classroom Code:****re6bkiz**

*Course Rationale:*Algorithms deals with efficient ways to solve different mathematical and real-life problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve computational problems. This course emphasizes the relationship between algorithms and programming and explores algorithms from the programmer’s perspective for solving problems efficiently using various programming languages.

*Course Objective:*This course introduces students to the analysis and design of computer algorithms. Upon completion of this course, students will be able to do the following:

• Analyse the asymptotic performance of algorithms.

• Demonstrate familiarity with major algorithms and data structures.

• Apply important algorithmic design paradigms and methods of analysis.

• Synthesize efficient algorithms in common engineering design situations.*Course Outcomes (CO’s):*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:***Attendances: 10%****Lab Performance: 25%****project: 25%****Final Exam: 40%***Grading System:*

a. Introduction to Algorithms , (3rd Edition, MIT Press, 2009) ISBN: 9780262033848. Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein*Text Book:**Course Outline:*Click here

a. Algorithms (4th Edition)*Reference Books:*

Author: Robert Sedgewick and Kevin Wayne

b. Algorithm Design

Author: Jon Kleinberg, Eva Tardos

c. Data Structures And Algorithms Made Easy In JAVA Author: Narasimha Karumanchi*Useful Web Links:**Additional Support for Students:*· Student Portal:

· Academic Guidelines

· Rules and Regulations of DIU

· Career Development Center:

· For general queries:

*Survey!!!*Please let me know what do you want to learn from this course

*Daily_Attendance:**Lab Note (Updated Daily)*