Section: Week 1: Ice Breaking and Course Overview | Algorithm -SMAH(Fall 2022)

Course Menu

Do not miss your weekly practice quizzes!

Calendar

Saturday	Sunday	Monday	Tuesday	Wednesday	Thursday	Friday
No events, Saturday, 1 March No events, Saturday, 1 March	No events, Sunday, 2 March No events, Sunday, 2 March	No events, Monday, 3 March No events, Monday, 3 March	No events, Tuesday, 4 March No events, Tuesday, 4 March	No events, Wednesday, 5 March No events, Wednesday, 5 March	No events, Thursday, 6 March No events, Thursday, 6 March	No events, Friday, 7 March No events, Friday, 7 March
No events, Saturday, 8 March No events, Saturday, 8 March	No events, Sunday, 9 March No events, Sunday, 9 March	No events, Monday, 10 March No events, Monday, 10 March	No events, Tuesday, 11 March No events, Tuesday, 11 March	No events, Wednesday, 12 March No events, Wednesday, 12 March	No events, Thursday, 13 March No events, Thursday, 13 March	No events, Friday, 14 March No events, Friday, 14 March
No events, Saturday, 15 March No events, Saturday, 15 March	No events, Sunday, 16 March No events, Sunday, 16 March	No events, Monday, 17 March No events, Monday, 17 March	No events, Tuesday, 18 March No events, Tuesday, 18 March	No events, Wednesday, 19 March No events, Wednesday, 19 March	No events, Thursday, 20 March No events, Thursday, 20 March	No events, Friday, 21 March No events, Friday, 21 March
No events, Saturday, 22 March No events, Saturday, 22 March	No events, Sunday, 23 March No events, Sunday, 23 March	No events, Monday, 24 March No events, Monday, 24 March	No events, Tuesday, 25 March No events, Tuesday, 25 March	No events, Wednesday, 26 March No events, Wednesday, 26 March	No events, Thursday, 27 March No events, Thursday, 27 March	No events, Friday, 28 March No events, Friday, 28 March
No events, Saturday, 29 March No events, Saturday, 29 March	No events, Sunday, 30 March No events, Sunday, 30 March	No events, Monday, 31 March No events, Monday, 31 March

Final Exam

Days

Hours

Minutes

Seconds

CSE Fall 2022

Abdullah Al Kafi

Aminul Haque

Mahbubur Rahman

Md Atik Asif Khan Akash

Section outline

Welcome Note from Instructor

ABOUT COURSE

GENERAL GUIDELINES ABOUT THE COURSE

All the students registered for this course have to enroll in the Blended Learning Center (BLC)

Students can find all the course materials in the BLC

Discussion forums are created to help students discuss about problems with their fellow classmates

Courses in the BLC is designed to promote active learning. So students must attach to BLC to progress their learning and to obtain good grades

Courses in BLC are designed to allow students to work both in onsite & offsite environment. Onsite/ online engagement will allow students to have interactions, group studies, and problem solving

Assessments are also designed in the BLC to ensure students are acquiring the desired skills from the course

In order to have quick communication between the instructor & the students, an instant messaging group is created using "Telegram" application

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 OBJECTIVES

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:

To analyze the asymptotic performance of algorithms

To demonstrate a familiarity with major algorithms and data structures

To apply algorithmic design paradigms like: divide & conquer, greedy, dynamic programming, graphs and methods of analysis of real life problems

To synthesize efficient algorithms in common engineering design situations

COURSE TOPICS (WEEK-WISE)

Week01: Ice-breaking with students, Course Overview & Motivation

Week02: Function, Recursion, GCD, Introduction to Asymptotic notation and complexity analysis

Week03: Brute Force type problems: Linear Search, Insertion Sort, Bubble Sort, Selection Sort

Week04: Divide & Conquer: Binary Search, Quick Sort, Merge Sort

Week05: Greedy Algorithms: Coin Change, Bin Packing, Fractional Knapsack, Huffman Coding

Week06: Dynamic Programming: Fibonacci Series, DP Coin Change, 0/1 Knapsack

Week07: Midterm Examination: Week01 to Week06

Week08: Dynamic Programming: LCS, LIS

Week09: Introduction to Graphs, Graphs representation, BFS, DFS

Week10: Cycle Finding, Component Finding, SCC

Week11: Single Source Shortest Path Algorithms: Dijkstra's algorithm, MST

Week12: All Pair Shortest Path Algorithms: Bellmanford, Warshall

Week13: Presentation

Week14: Final Examination

PREREQUISITE TOPICS

Programming: loops, arrays, functions, recursions, objects

Data structures: arrays, stacks, queues, link lists

Mathematics: high school algebra

Programming environment: CodeBlocks/ Eclipse

REFERENCE MATERIALS

www.visualgo.net

www.geeksforgeeks.org

www.topcoder.com

www.codeforces.com

C Compiler for Android

C Compiler for ios

FOR STUDENT SUPPORT

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/

Student Interest Survey
- Select activity Course Outlines
  
  Course Outlines Page
- Select activity Course Assessment Plan
  
  Course Assessment Plan Page
- Select activity Text Book: Introduction to Algorithms
  
  Text Book: Introduction to Algorithms Page
  
  Viewing this resource may take some time.

CSE214 & CSE215 (Theory & LAB)

Announcements

Counseling Hour

Announcements

Week 1: Ice Breaking and Course Overview

Course Outlines

Course Assessment Plan

Text Book: Introduction to Algorithms

Week 2: Introduction to Algorithm

Introduction &amp; Complexity Analysis (videos)

Introduction &amp; Algorithm Complexity (readings)

Lab: Functions &amp; Pointers

Week 2 Discussion Forum

Week 3: Brute Force: Searching & Sorting

Brute Force: Searching &amp; Sorting (videos)

Brute Force: Searching &amp; Sorting (readings)

Lab: Linear Search, Insertion Sort

Week 3 Discussion Forum

Week 4: Divide & Conquer

Divide &amp; Conquer (videos)

Divide &amp; Conquer (readings)

Lab: Binary Search, Quick sort, Merge Sort

Week 4 Discussion Forum

Assignment

Assignment (Demo)

Assignment (Final)

Class Test 01

Lab Test-1 (25%)

Week 5: Greedy Algorithm

Greedy Algorithm (videos)

Greedy Algorithm (readings)

Lab: Coin Change &amp; Bin Packing

Week 5 Discussion Forum

Class Test 01

Midterm Examination

Week 6: Dynamic programming (part 1)

Dynamic Programming Part 1 (videos)

Dynamic Programming Part 1 (readings)

Lab: Dynamic Programming (part 1) (Coin Change, 0/1 Knapsack)

Week 6 Discussion Forum

Week 7: Dynamic Programming (part 2)

Dynamic Programming Part 2 (videos)

Dynamic Programming Part 2 (readings)

Lab: Dynamic Programming

Week 7 Discussion Forum

Class Test 02

Week 8: Graphs

Introduction &amp; Graph Traversals (videos)

Introduction &amp; Graph Traversals (readings)

Lab: Graphs Traversals

Class Test 03

Lab Final

Week 11: Presentation

Communication technique

Submit Your Recorded Presentation (deadline: 27 March 2022)

Class Test 03

Final Assessment

Lab Test 02 (Improvement)

March 2025

March 2025

March 2025

Section outline

Welcome Note from Instructor

Introduction & Complexity Analysis (videos)

Introduction & Algorithm Complexity (readings)

Lab: Functions & Pointers

Brute Force: Searching & Sorting (videos)

Brute Force: Searching & Sorting (readings)

Divide & Conquer (videos)

Divide & Conquer (readings)

Lab: Coin Change & Bin Packing

Introduction & Graph Traversals (videos)

Introduction & Graph Traversals (readings)