CSE 373: Design and Analysis of Algorithms

CSE 373

Course Meeting Time:
(Section 4) MW 09:40 AM - 11:10 AM
(Section 5) MW 11:20 AM - 12:50 PM

Office Hours:
MW 2:00 PM to 5:00 PM

Undergraduate Teaching Assistant:
Name: Abrar Sultan Hud
Email: abrarsultan.hud@northsouth.edu
Office Hours: ST 09:00 AM - 11:00 AM

Credit Hours: 3

Prerequisites:
CSE 225 - Data Structure and Algorithms
MAT 361 - Probability and Statistics

Course Description: This course introduces basic methods for the design and analysis of efficient algorithms emphasizing methods useful in practice. Different algorithms for a given computational task are presented and their relative merits evaluated based on performance measures. The following important computational problems will be discussed: sorting, searching, elements of divide-and-conquer, dynamic programming and greedy algorithms, advanced data structures, graph algorithms (shortest path, spanning trees, tree traversals), string matching, NP completeness.

Course Objectives: The objectives of this course are to

  • analyze the asymptotic performance of algorithms.
  • write rigorous correctness proofs for algorithms.
  • demonstrate a familiarity with major algorithms and data structures.
  • apply important algorithmic design paradigms and methods of analysis.
  • synthesize efficient algorithms in common engineering design situations.

Required Text and Materials: “Introduction to Algorithms”, 3rd Edition by Charles E. Leiserson, Clifford Stein, Ronald Rivest, and Thomas H. Cormen.

Reference Text and Materials: “Algorithms”, 4th Edition by Robert Sedgewick and Kevin.

Course Grade

ACTIVITIES PERCENTAGES
Quizzes 25%
Assignments 15%
Midterm 25%
Final 30%
Viva 05%
Total 100%

This course will be graded on as per university grading policy.

Lectures

LECTURE DATE TOPIC
1 15-02 Introduction
2 17-02 Getting Started
3 22-02 Growth of functions
4 24-02 Divide and Conquer Algorithms
5 01-03 Divide and Conquer Algorithms (Continues)
6 03-03 Divide and Conquer Algorithms (Continues)
7 08-03 Sorting
8 10-03 Sorting (Continues)
9 15-03 Sorting (Continues)
10 22-03 Sorting (Continues)
11 24-03 Greedy Algorithms
12 29-03 Greedy Algorithms (Continues)
13 31-03 Greedy Algorithms (Continues)
14 05-04 Dynamic Programming
15 07-04
16 12-04 Dynamic Programming (Continues)
17 19-04 Dynamic Programming (Continues)
18 21-04 Graph Algorithms
19 26-04 Graph Algorithms (Continues)
20 28-04 Graph Algorithms (Continues)
21 03-05 Graph Algorithms (Continues)
22 05-05 Graph Algorithms (Continues)
23 17-05 Graph Algorithms (Continues)
24 18-05 Review

Policy

  • Course Structure: This course will be delivered entirely online through the course management system Google Classroom. You will get all necessary information through SMS notification to join the virtual classroom.

  • Student Expectations: In this course every student will be expected to complete the following types of tasks.

    • communicate via email
    • complete basic internet searches
    • read documents online
    • read required text book and materials
    • view online videos
    • participate in online discussions
    • complete quizzes/tests online
  • Participation: Students are expected to participate in all online activities as listed on the course calendar.

  • Quizzes and Exams: There will be three quizzes. Best two quizzes will be counted for the final grading. There will be one midterm and final exam.

  • Assignments: All assignments for this course will be submitted electronically through google form unless otherwise instructed. Assignments must be submitted by the given deadline or special permission must be requested from faculty before the due date. Extensions will not be given beyond the next assignment except under extreme circumstances. There will be three assignments throughout the whole semester. One assignment with the lowest performance will be dropped for the final grading.

  • Late Work Policy: Be sure to pay close attention to deadlines—there will be no make-up assignments, quizzes, exams or late work accepted without a serious and compelling reason and faculty approval before due date.

  • Commit to Integrity: As a student in this course (and at this university) you are expected to maintain high degrees of professionalism, commitment to active learning and participation in this class and also integrity in your behavior in and out of the classroom.

  • Academic Honesty Policy: North South University system believe that academic honesty and integrity are fundamental to the mission of higher education. Students are responsible for the honest completion and representation of their work, for the appropriate citation of sources, and for respect of others’ academic endeavors. Students who violate these standards must be confronted and must accept the consequences of their actions. Academic misconduct include, but are not limited to:

    • cheating on an examination;
    • collaborating with others in work to be presented, contrary to the stated rules of the course;
    • submitting a paper or assignment as one’s own work when a part or all of the paper or assignment is the work of another;
    • submitting a paper or assignment that contains ideas or research of others without appropriately identifying the sources of those ideas; stealing examinations or course materials;
    • submitting, if contrary to the rules of a course, work previously presented in another course;
    • tampering with the laboratory experiment or computer program of another student;
    • knowingly and intentionally assisting another student in any of the above, including assistance in an arrangement whereby any work, classroom performance, examination or other activity is submitted or performed by a person other than the student under whose name the work is submitted or performed.
Mirza Mohammad Lutfe Elahi
Mirza Mohammad Lutfe Elahi
Senior Lecturer

My research interests include Machine Learning and Computer Vision.