Instructor: Li Yang
Lecture Time: TR 11:30am-12:45pm
Classroom: CEAS D206
Office: CEAS B248
Office Hour: TR 1-2pm
TA: Lin Cheng
Office Hour: Thuesday 1-2pm, Office: B252
Important announcements will come here.
There will be 5-6 assignments. Assignments will be posted on e-learning portal with due dates. They must be submitted to the e-learning portal exactly when they are due. No late submission will be accepted.
Name: CS4310 - Design and Analysis of Algorithms
Credit Hours: 3
Prerequisite: (MATH 1450 or CS1310) and CS3310 or equivalent with a grade of C or better.
A continuation of study of data structures and algorithms. It provides a theoretical foundation in designing algorithms. The focus is on the advanced analysis of algorithms and on how the selections of different data structures affect the performance of algorithms. Algorithmic paradigms such as divide and conquer, greedy method, dynamic programming, backtracking, and branch and bound are covered. B-tree, 2-3 tree and a variety of graph structures are discussed along with their applications to algorithm implementation. Algorithms will be analyzed for their complexity. NP-completeness will be introduced.
The general objective of this course is to develop algorithmic thinking to solve real world problems. Specific objectives include:
Upon completion of this course, students should:
There will be assignments, a midterm exam and a final exam. Your final grade is determined based on a weighted sum of your scores. Weights of the scores are:
The following code is required to be included in this syllabus:
You are responsible for making yourself aware of and understanding the policies and procedures in the Undergraduate (pp. 271-272) [Graduate (pp. 24-26)] Catalog that pertain to Academic Integrity. These policies include cheating, fabrication, falsification and forgery, multiple submission, plagiarism, complicity and computer misuse. If there is reason to believe you have been involved in academic dishonesty, you will be referred to the Office of Student Judicial Affairs. You will be given the opportunity to review the charge(s). If you believe you are not responsible, you will have the opportunity for a hearing. You should consult with me if you are uncertain about an issue of academic honesty prior to the submission of an assignment or test.