Design and Analysis of Algorithms
CSE373: Design and Analysis of Algorithms
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.
Informations
- Credit Hours : 03
- Type: Core
- Prerequisites: CSE 225 – Data Structure and Algorithms, MAT 361 – Probability and Statistics
- Faculty Name: Muhammad Shafayat Oshman (MUO)
- Office Room: SAC1181
- Office Hours: RA 9:40 AM - 2:30 PM (I prefer to go by email appointments first so I can first hand know what you plan to discuss with me)
- Email: muhammad.oshman@northsouth.edu
- Lectures - 3 Hours/week
- Class timing: Section 6 - RA 02:40 PM - 04:10 PM - SAC212
- Teaching Assistant: Kazi Ramisa Rifa
- Email: kazi.rifa@northsouth.edu
- Consultation hours: MW 10:00 AM - 12:00 PM
- Office room: SAC944C
Resources
Text Books :
- Introduction to Algorithms, 3rd Edition by Charles E. Leiserson, Clifford Stein, Ronald Rivest, and Thomas H. Cormen.
Course Slides :
Any and all course materials and announcements will be posted in Canvas.
Topics
These are some of the topics we will cover (but not limited to this list exclusively)
- Introduction to Algorithms
- Sorting Algorithms
- Order of Growth
- Divide and Conquer
- Greedy Algorithms
- Dynamic Programming
- Graph Algorithms
Marking Scheme (Theory)
| Assessment Tools | Weightage (%) |
|---|---|
| Assignments (Written + Viva) | 40 |
| Quiz | 10 |
| Mid-term | 20 |
| Final | 30 |
| 100 |
Grading policy
As per NSU grading policy available in http://www.northsouth.edu/academic/grading-policy.html
Course Policies
Follow university policies. Any breach of university policies will be reported to the Department, Proctor Office and University Syndicate for further actions. Any additional directions will be updated as we proceed through the course.
