Regular class participation is expected. Students who fail to participate in class regularly are inviting scholastic difficulty. A portion of the grade for this course is directly tied to your participation in this class. It also includes engaging in group or other activities during class that solicit your feedback on homework assignments, readings, or materials covered in the lectures (and/or labs). Class participation is documented by faculty. Successful participation is defined as consistently adhering to University requirements, as presented in this syllabus. Failure to comply with these University requirements is a violation of the Student Code of Conduct.Students are expected to follow appropriate University policies and maintain the security of passwords used to access recorded lectures. Unless the Office of Student AccessAbility has approved the student to record the instruction, students are expressly prohibited from recording any part of this course. Recordings may not be published, reproduced, or shared with those not in the class, or uploaded to other online environments except to implement an approved Office of Student AccessAbility accommodation. Failure to comply with these University requirements is a violation of the Student Code of Conduct.Comet CreedThis creed was voted on by the UT Dallas student body in 2014. It is a standard that Comets choose to live by and encourage others to do the same:“As a Comet, I pledge honesty, integrity, and service in all that I do.”The information contained in the following link lists the University’s academic support resources for all students.The information contained in the following link constitutes the University’s policies and procedures segment of the course syllabus. Please review the catalog sections regarding the credit/no credit or pass/fail grading option and withdrawal from class.Please go to http://go.utdallas.edu/syllabus-policies for these policies.CS 6363.001 Design and Analysis of Computer Algorithms – Spring 2022TR 10:00-11:15 am, ECSS 2.412Instructor: D.T. HuynhOffice: ECSS 3.801Office Hours: Tues./Thurs.. 1:00 – 2:00pm (via MS Teams) (For an appointment please email [email protected])Teaching Assistant: TBACourse Prerequisites: CS 5343 (Data Structures) or equivalent (Fast-track students should have taken CS 4349)Contents Description:1. Introduction (Algorithms, asymptotic notation, recurrence relations…)2. Sorting and Order Statistics(Heapsort, Quicksort, Median & Order Statistics…)3. Algorithm Design Techniques (Divide-and-Conquer, Dynamic Programming, Greedy technique…)4. Algorithms Involving Sets and Sequences (Binary Search Trees, Pattern Matching, Union-Find…)5. Graph Algorithms (Graph Search, Minimum-Cost Spanning Trees, Shortest Paths, Network Flows…)6. Geometric Algorithms (Basic geometric algorithms incl. Convex Hull, Closest Pairs …)7. Algebraic Algorithms (Polynomials, Matrix Multiplication, Fast Fourier Transform…)8. Linear Programming (if time allows) (Simplex Method, Duality…)9. NP-Completeness (Polynomial-time reducibilities, NP-completeness, Cook’s Theorem, NP-complete problems)Course Description: The study of efficient algorithms for various computational problems. Algorithm design techniques. Sorting, manipulation of data structures, graphs, matrix multiplication, and pattern matching. Complexity of algorithms, lower bounds, NP completeness. Prerequisite: CS 5343 (3-0) SCourse Objectives: Asymptotic notations, recurrences, algorithm analysis. Divide and conquer algorithms. Greedy algorithms. Dynamicprogramming algorithms. Graph algorithms. Flow networks. NP-completeness.Required Textbooks and Materials:T. Cormen, C. Leiserson, R. Rivest & C. Stein.: “Introduction to Algorithms”, MIT Press, (3rd edition) 2009. Copies of class notes, HW assignments and solutions will be uploaded on UTD eLearningSuggested Further Reading Materials:Sipser, M.: “Introduction to the Theory of Computation”, Cengage Learning, 3rd Edition, 2013.Arora, S & Barak, B.: “Computational Complexity: A Modern Approach”, Cambridge University Press, 2009.Vazirani, V.: “Approximation Algorithms”, Springer 2003.Assignments and Academic Calendar/Grade Scale:- 5 Homework assignments 10%(Solutions of HW problems will be provided in eLearning.)(HW assignments are due on eLearning on the date given. Late HWs will not be accepted. HW assignments will be uploaded on eLearning.)- Exam #1 (75 minutes) 25% Tues., Feb. 22, 10:00 am- Exam #2 (75 minutes) 30% Tues., March 29, 10:00 am- Exam #3 (75 minutes) 35% Thurs., May 5, 10:00amCourse and Instructor Policies:- A copy of the lecture notes (Chapters 1-9) can be found on UTD eLearning- Exam #3 is not comprehensive. (Each exam will cover approx. 1/3 of course content.)- Students are encouraged to discuss HW problems. However, your submission must be your own work. Anyone caught cheating on HWs will receive zero credit. - If you decide to stop attending class, be sure to drop the course since you will not be dropped automatically.- Any student wishing to contest a grade on a HW should contact the TA.- Final grades will be posted by the Records Office.- All exams will be graded by the instructor. HWs will be graded by the TA.- There will be no makeup exams under normal circumstances.- No late homework or assignment will be accepted!- I do not read e-Learning e-mails. Please use my UTD e-mail account above for any communications.- All grade disputes must be reported within 1 week of the grade in question being posted on eLearning. Uncontested grades will be final after 1 week. If you have questions concerning your exam grades, please contact me. Due to FERPA grades cannot be discussed via email.Class MaterialsThe instructor may provide class materials that will be made available to all students registered for this class as they are intended to supplement the classroom experience. These materials may be downloaded during the course,however, these materials are for registered students' use only. Classroom materials may not be reproduced or shared with those not in class, or uploaded to other online environments except to implement an approved Office of Student AccessAbility accommodation. Failure to comply with these University requirements is a violation of the Student Code of Conduct.Classroom Conduct Requirements Related to Public Health