CSE5311 Design and
Analysis of Algorithms
SPRING 2007
Instructor: Dr. Mohan Kumar
|
Home Page on FRIDAY 04/27/2007 starting 0900 hrs - Attendence is compulsory during the Presentations! - Distance Students should email an audio plus presentation to the instructor and TA - FINAL EXAMS date: April 27, 2007! - Distance Students can also take the exam at the above time - Module 10 has been posted - Projects are due by April 30, 2007 (09:00 AM CST) - All questions related to the project must be directed to the TA and CC'ed to all team memebers PROJECT PRESENTATION SCHEDULE - 4 slots per class - Each presentation is for 20 minutes - Everyone is requested to book slots asap! May 1: Vivek, Andrew, Sandeep May 3: Sujan, Shruthi, Aqeel, Swathi |
Course DescriptionDesign and Analysis of Algorithms is THE most important basic course in any graduate computer science and engineering curriculum. It is vital for every computer science student to be fluent with algorithms and their analysis. ALGORITHMS ARE FUN; ALGORITHM ANALYSIS is a NECESSARY TOOL; Students are encouraged to solve homework problems and discuss/solve problems in the class. Each student will be given one specific algorithm or problem to carry out an in-depth study. Typically, this course should be taken in the very first semester of your graduate study because algorithms are used in Networks, Operating Systems, Databases, and other (including advanced) courses. Course ObjectivesThe objective of this course is to build a solid foundation of the most important fundamental subject in computer science. Creative thinking is essential to algorithm design. Algorithm analysis and verification demands sound mathematical acumen and programming skills. Course PrerequisitesData Structures (CSE 2320) and Theoretical Concepts in Computer Science and Engineering (CSE 3315) OR Equivalent. Mode of TeachingMode of Teaching: The class meets twice a week (Tuesdays and Thursdays 11:00am to 12:20). The Tuesdays class will be of lecture type and the Thursdays class will be of tutorial type. Power point slides and other lecture material will be used on Tuesdays. At the end of each topic, students must attempt to solve exercise problems. Exercise problems can be found on the course web page and in the text book. All students are expected to work on these problems and may be required to solve these in the class on Thursdays. Instructor: Mohan Kumar, 333 NH Class: Tue/Thu Email: mailto:kumar@cse.uta.edu Office Hours: Thursdays 4 to 6:00 PM Phone: (817) 272-3610 or main office: (817) 272-3785; WWW site: http://crystal.uta.edu/~kumar/cse5311/spring2007
GTA: Arjun Dasgupta Office Hours: Monday, Wednesday:4-5 PM and by appointments
Location:
GS 237
(Map) Course Syllabus:
Text book
Algorithm Design Pearson Addison-Wesley ISBN 0-321-29535-8 ReferencesThe Design and Analysis of Algorithms 1974 AV Aho, JE Hopcroft and JD Ullman, Addison-Wesley Publishing Company Introduction to Algorithms: A Creative Approach, Reprinted 1989 Udi Manber, Addison-Wesley Publishing Company Introduction to Algorithms, Second Edition, 2001 T Cormen, C Graph Algorithms, 1979 Shimon Even, Computer Science Press Introduction to the Theory of Computation, 1992 Michael Sipser, PWS Publishing Company The Art of Computer Programming, Vols. 1 and 3 Knuth, Addison Wesley Publishing Company AssessmentCourse
grades will be based on the following: Class participation: ACTIVE
Participation will prepare you well for Quizzes and Exams Students are
expected to interact actively during lectures. All students are expected to
solve homework problems and discuss solutions in the class. Quizzes and class participation:
30% There will be 2 quizzes. The structure of the quizzes will
be discussed in class, at least one week prior to the quiz. Quiz 1 (15%): Quiz 2 (15%): March 22, 2007
Exam: 35% There will be ONE exam. The
questions will test your ability to write and analyze algorithms. The exam
will NOT test your memory. The exam will be a comprehensive exam lasting for
about 3-4 hours. Exam: April 26, 2007 Group Project: 35% Students will have the option of
doing a group study or group project. Project problems will handed out
at least one month prior to the expected date of completion. The students
will be required to write programs and run experiments. OR Groups of students will be given a
research problem to work on. Students are encouraged to come up with new and
creative ideas. A presentation of this work will be on May 1 and 3, 2007. Homework Assignments: No Grades awarded directly! Missed Exams, Quizzes, and Makeup WorkIf you miss an exam or quiz 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 or other components if you missed an exam or a project due to travel (except when you are required to travel to represent the university or the department). Attendance and Drop PolicyAttendance though not mandatory, is HIGHLY encouraged. Class participation is important to your grade in the 'Quizzes and Class Participation' component Final Review Week
A period of five class days prior to the first day of final examinations in the long sessions shall be designated as Final Review Week. The purpose of this week is to allow students sufficient time to prepare for final examinations. During this week, there shall be no scheduled activities such as required field trips or performances; and no instructor shall assign any themes, research problems or exercises of similar scope that have a completion date during or following this week unless specified in the class syllabi. . During Final Review Week, an instructor shall not give any examinations constituting 10% or more of the final grade, except makeup tests and laboratory examinations. In addition, no instructor shall give any portion of the final examination during Final Review Week. Americans With Disabilities Act |
