Posts by Collection

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 practicle problems.

Prerequisites

CMPS 341 and 406

Instructor and Office Hours

Instructor	Dr. Min Shi
Office	Oliver 350
Office Hours	Appointment only
Phone	(337) 482-8410
Email	min.shi@louisiana.edu

Lecture Schedule

Index	Topics	Events
1	Introduction to class and algorithms
2	Graph basics	HW1 out
3	Graph algorithms
4	Devide and conquer	HW2 out
5	Dynamic programming
6	Greedy algorithm	HW3 out
7	Midterm Exam
8	NP-Completeness
9	Exercise Problems
10	Project/Paper Presentation
11	Algorithm Design Competition
12	Final 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

Item	Percentage	Note
Homework	30%	3 HWs
Project/Paper presentation	20%
Midterm exam	20%
Final exam	30%

Homework (30%)

HW1.
- Due:
HW2.
- Due:
HW3.
- Due:

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

Project/Paper Assignment (20%)

TBD

Algorithm design competition (10%)

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

Min Shi

Posts by Collection

portfolio

publications

talks

teaching

Overview