Scribd
Upload
129 views

CSE 373 - Course Objective and Outcome Form - Sec 6,9

This document outlines the course objectives and outcomes for CSE 373 Design and Analysis of Algorithms, a 3-credit core course offered by the Department of Electrical and Computer Engineering at North South University. The course introduces methods for designing and analyzing efficient algorithms, covering topics like sorting, searching, divide-and-conquer, dynamic programming, greedy algorithms, graph algorithms, string matching, and NP completeness. Upon completing the course, students will be able to analyze time complexity using asymptotic analysis, apply different algorithm paradigms to problems, and explain major graph algorithms and their analysis in engineering contexts. Student learning will be assessed through quizzes, exams, and assignments.

Uploaded by

Prince Deb
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
129 views

CSE 373 - Course Objective and Outcome Form - Sec 6,9

This document outlines the course objectives and outcomes for CSE 373 Design and Analysis of Algorithms, a 3-credit core course offered by the Department of Electrical and Computer Engineering at North South University. The course introduces methods for designing and analyzing efficient algorithms, covering topics like sorting, searching, divide-and-conquer, dynamic programming, greedy algorithms, graph algorithms, string matching, and NP completeness. Upon completing the course, students will be able to analyze time complexity using asymptotic analysis, apply different algorithm paradigms to problems, and explain major graph algorithms and their analysis in engineering contexts. Student learning will be assessed through quizzes, exams, and assignments.

Uploaded by

Prince Deb
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Course Objective and Outcome Form

Department of Electrical and Computer Engineering


School of Engineering and Physical Sciences
North South University, Bashundhara, Dhaka-1229, Bangladesh

1. Course Number and Title: CSE 373 Design and Analysis of Algorithms

2. Number of Credits: 3

3. Type: Core

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

5. Contact Hours: 3 Hours (Theory)

6. Course Summary:
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.

7. Course Objectives:
The objectives of this course are to
a. analyze the asymptotic performance of algorithms.
b. write rigorous correctness proofs for algorithms.
c. demonstrate a familiarity with major algorithms and data structures.
d. apply important algorithmic design paradigms and methods of analysis.
e. synthesize efficient algorithms in common engineering design situations.

8. Course Outcomes (COs):


Upon Successful completion of this course, students will be able to:

Sl. CO Description Weightage (%)


CO1 analyze time complexity of algorithms using 20
asymptotic analysis.
CO2 apply different algorithm paradigms for a given 35
problem
CO3 explain the major graph algorithms and their analyses 35
to model engineering problems.
CSE- 373 Course Objective ECE- NSU Summer 2020- Sec: 6, 9 Ashfia B. Habib (ABH1)
CO4 explain the classes P, NP, and NP-Complete . 10

9. Mapping of CO-PO:

Sl. CO Description POs Bloom’s Delivery Assessmen


taxonomy methods t
domain/level and tools
activities
CO1 Analyze time complexity of algorithms b Cognitive/ Lectures, Quiz/
using asymptotic analysis. Analyze Notes assignment/
exam
CO2 Apply different algorithm paradigms for a Cognitive/Appl Lectures, Quiz/Exam
a given problem y Notes /assignment
CO3 Explain the major graph algorithms and a Cognitive/ Lectures, Quiz/Exam
their analyses to model engineering Understand Notes
problems.
CO4 Explain the classes P, NP, and NP- a Cognitive/ Lectures, Quizzes,
Complete . Understand Notes Exam

10. Resources

Text books:

No Name of Year of Title of Book Edition Publisher’s ISBN


Author(s) Publication Name
rd
1 Thomas 2009 Introduction to 3 MIT Press 9780262033848
H. Algorithms
Cormen,
Charles
E.
Leiserson,
Ronald L.
Rivest
and
Clifford
Stein
2

Reference books:

No Name of Year of Title of Book Edition Publisher’s ISBN


Author(s) Publication Name
th
1 Robert 2011 Algorithms 4 Addison- 9780321573513
Sedgewick Wesley
and Kevin
Wayne

CSE- 373 Course Objective ECE- NSU Summer 2020- Sec: 6, 9 Ashfia B. Habib (ABH1)
Online resources:

11. Weightage Distribution among Assessment Tools -TBA

12. Grading policy: As per NSU grading policy available in

http://www.northsouth.edu/academic/grading-policy.html

CSE- 373 Course Objective ECE- NSU Summer 2020- Sec: 6, 9 Ashfia B. Habib (ABH1)

You might also like