Min Shi

Min Shi

Assistant Professor

2025-Spring-CSCE500-Design and Analysis of Algorithms

Graduate Course, CSCE, ULL, 2025

Class Time: Mondays and Wednesdays, 10:00AM to 11:15AM.
Room: James R. Oliver, Room 113.

Overview

This course introduces basic elements of the design and analysis of algorithms. Topics include asymptotic notations and analysis, divide and conquer, greedy algorithms, dynamic programming, fundamental graph algorithms, and NP-completeness. Students will gain hands-on experience to design and analyze algorithms for solving problems.

Learning Objectives

  • Study common data structures and algorithms.
  • Understand the design principles and efficiencies of various algorithms.
  • Gain hands-on experiences to design algorithms to solve practical problems.

Prerequisites

CMPS 341 and 406

Instructor and Office Hours

InstructorDr. Min Shi
OfficeOliver 350
Office HoursAppointment only
Phone(337) 482-8410
Emailmin.shi@louisiana.edu

Lecture Schedule

IndexTopicsEvents
1Introduction to class and algorithms 
2Graph basicsHW1 out
3Graph algorithms 
4Devide and conquerHW2 out
5Dynamic programming 
6Greedy algorithmHW3 out
7Midterm exam 
8NP-completeness 
9Exercise problems 
10Project / paper presentation 
11Algorithm design test 
12Final exam 

Textbook

  • Introduction to Algorithms, Fourth Edition, by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, The MIT Press, 2022, ISBN: 978–026204630–5

Course Grading Scale

90-100%A
80-89%B
70-79%C
60-69%D
0-59%F

Course Evaluation Method

ItemPercentageNote
Homework30%3 HWs
Project / paper presentation20% 
Algorithm design test10% 
Midterm exam20% 
Final exam20% 

Homework (30%)

  • HW1.
    • Due:
  • HW2.
    • Due:
  • HW3.
    • Due:

HW Note: All HWs due by the end of the day, Central Time.

Project/paper presentation (20%)

TBD

Algorithm design test (10%)

Each team, consisting of two students, will work together to solve a set of algorithm design problems.