CSE5311 Design and Analysis of Algorithms

Fall 2008

By Dr. Sajal K. Das

Mon, Wed 10:30-11:50 AM, GS (Geo Science Bldg) 104

Resource:	CSE 5311 Section 001
Homeworks Exams Final Exam: Dec 8 (Monday) 10:30 am - 12:30 pm GS 104	Instructor：Dr. Sajal K. Das Office Room: NH 249 B Office Hour: Monday and Wednesday 1:30-2:30pm Office Tel: 817-272-7405 Email: das@uta.edu GTA：Ms. Na Li Office Room: NH 239 Office Hour: Tuesday and Thursday 15:00 pm-16:30 pm Email: nalisammy@gmail.com
	“... pleasure has probably been the main goal all along. But I hesitate to admit it, because computer scientists want to maintain their image as hard-working individuals who deserve high salaries. Sooner or later society will realize that certain kinds of hard work are in fact admirable even though they are more fun than just about anything else.” — Donald E. Knuth TextBook: Algorithm Design Jon Kleinberg and Eva Tardos Addison Wesley 2006 ISBN: 0-321-29535-8 Reference Book: Introduction to Algorithms Thomas H. Cormen, Charles E. Leiserson , Ronald L. Rivest , Clifford Stein MIT Press Second Edition 2001 Concrete Mathematics: A Foundation for Computer Science R. L. Graham, D. E. Knuth, and O. Patashnik Addison-Wesley Second Edition  1999 COURSE DESCRIPTION: This foundational graduate course deals with design and analysis of algorithms, which are considered the bread and butter in computer science and engineering. Emphasis will be on understanding the inherent complexity of a given problem, how to develop "cool" solutions by applying various fundamental algorithmic techniques, and also how to prove and analyze the developed algorithms. Interesting example problems will be considered to illustrate the underlying concepts. When appropriate, important real-life problems in networking, multiprocessing, scheduling, VLSI, databases and data mining, image processing, Internet routing, wireless mobile computing, and so on will also be discussed. Topics to be covered but not limited to: - Algorithm Analysis Tools - Mathematical Proof Techniques - Recurrence Relations - Basics of Combinatorics and Graph Theory - Divide and Conquer Approach - Greedy Method - Dynamic Programming - Search and Optimization Techniques - NP-Completeness - Approximation and Randomized Algorithms Course PRE-REQUISITES: CSE 2315, CSE 2320, and problem solving mind! Grading Policy: Homeworks                          30% Midterm exam                       30% Final exam                             40% Missed Exams and Homeworks If you miss an exam or homework due to unavoidable circumstances (e.g., health), email the instructor for an appointment or meet with him during office hours. Do NOT ask for make up exams and homework due to travel (except when you are required to travel to represent the university or the department).
News: 1. Lecture1 Note by Dr.Ghosh 2. Lecture2 Note by Dr.Ghosh
Americans With Disabilities Act The University of Texas at Arlington is on record as being committed to both the spirit and letter of federal equal opportunity legislation; reference Public Law 93112 -- The Rehabilitation Act of 1973 as amended. With the passage of new federal legislation entitled Americans With Disabilities Act - (ADA), pursuant to section 504 of The Rehabilitation Act, there is renewed focus on providing this population with the same opportunities enjoyed by all citizens. As a faculty member, I am required by law to provide "reasonable accommodation" to students with disabilities, so as not to discriminate on the basis of that disability. Student responsibility primarily rests with informing faculty at the beginning of the semester and in providing authorized documentation through designated administrative channels. Academic Dishonesty It is the philosophy of The University of Texas at Arlington that academic dishonesty is a completely unacceptable mode of conduct and will not be tolerated in any form. All persons involved in academic dishonesty will be disciplined in accordance with University regulations and procedures. Discipline may include suspension or expulsion from the University. "Scholastic dishonesty includes but is not limited to cheating, plagiarism, collusion, the submission for credit of any work or materials that are attributable in whole or in part to another person, taking an examination for another person, any act designed to give unfair advantage to a student or the attempt to commit such acts." (Regents’ Rules and Regulations, Part One, Chapter VI, Section 3, Subsection 3.2, Subdivision 3.22)