|Fall 2017 CSCE 411 - 502 Design and Analysis of Algorithms|
Location and Hours:
Tuesday, 5:30pm-8:00pm @ Room 113 Bright Building
Prof. Anxiao (Andrew) Jiang, 309B Bright Building. Email: firstname.lastname@example.org
Office hours: After every class in 113 Bright Buidling, and
sometimes also joining TA's office hours.
TA and Grader:
TA: Xiaojing Yu. Email: email@example.com
Office hours: 4--6pm on Mondays and 9:30--11:30am on Wednesdays, in Room B021 in Reed McDonald Building (RDMC).
Textbook: Introduction to Algorithms (3rd Edition), by Thomas Cormen, Charles Leiserson, Ronald Rivest and Clifford Stein.
Grading and Requirements:
Two mid-term exams: 23% each.
Final exam: 24%.
Homework and in-class mini-tests: 30%.
Homework policy: No late homework is accepted.
Homework:1. Homework one. Due: 5:30pm on Tuesday, 9/12/2017 in class. [Solution Set (sketch)]
||Dynamic programming.||Chapter 15|
||Dynamic Programming. Greedy algorithms.
||Chapters 15, 16
||Amortized analysis. Elementary graph algorithms.
||Chapters 17, 22
||Minimum Spanning Tree.
||Single-Source Shortest Paths.
||Redefined Day. No class.
|Final exam: 3:30--5:30pm on 12/13/2017 in 113 Bright Building
Statement: The Americans with Disabilities Act (ADA) is a federal anti-discrimination statute that provides comprehensive civil rights protection for persons with disabilities. Among other things, this legislation requires that all students with disabilities be guaranteed a learning environment that provides for reasonable accommodation of their disabilities. If you believe you have a disability requiring an accommodation, please contact Disability Services, currently located in the Disability Services building at the Student Services at White Creek complex on west campus or call 979-845-1637. For additional information, visit http://disability.tamu.edu.
Aggie Honor Code: "An Aggie does not lie, cheat or steal, or tolerate those who do." See http://aggiehonor.tamu.edu.