SPRING 2017 COP 3530 Data Structures Section U03 M, W : 7:50PM - 9:05PM ECS 132 COURSE SYLLABUS =============== I. TEXTBOOK Mark Allen Weiss Data Structures and Algorithm Analysis in Java Third Edition Addison-Wesley, 2012 ISBN-13 978-0-13-257627-7 ISBN-10 0-13-257627-0 II. PREREQUISITE COURSES COP3337, Programming II, and MAD 2104, Discrete Math III. PREREQUISITE TOPICS 1. Master the design and the implementation of classes using inheritance and polymorphism 2. Master the use and the implementation of interfaces 3. Be exposed to writing recursive methods 4. Be familiar with the implemntation of linked data structures 5. Be familiar with the Stack and Queue data structures 6. Be exposed to the Java Collection interface IV. COURSE OUTCOME 1. Be familiar with the basic techniques of algorithm analysis 2. Be familiar with writing recursive methods 3. Master the implementation of linked data structures such as linked lists and binary trees 4. Be familiar with advanced data structures like balanced search trees, hash tables, priority queues, and disjoint set union/find data structure 5. Be familiar with several sub-quadratic sorting algorithms including quicksort, mergesort and heapsort 6. Be familiar with some graph algorithms like shortest path and minimal spanning tree 7. Master the standard data structure library of a major programming language V. HOMEWORKS There are 4 homeworks, worth 12 points each, for a total of 48 points. They will be posted on the web at http://users.cis.fiu.edu/~pelina/COP3530. All homeworks are Java programs. You must e-mail me the Java file(s) as a text file at the address pelina@cis.fiu.edu. You may send them as an attachment, but do not send me zip files because they may be deleted by the system. For each homework you must submit only one version. The homework must reach me by the due date, otherwise there is a 10% penalty for each late day. If the student shows good reasons for the lateness, the penalty may be reduced. However, the forgiveness policy applies to at most 2 homeworks. The homeworks must follow the assignment specifications. They are graded on correctness, style, and efficiency. VI. EXAMS There are 2 exams, a midterm worth 20 points and a final worth 32 points. Both exams are closed book, closed notebook. You will get a practice test at least 4 days before the exam. The dates of the exams are Midterm: Wednesday, March 1, 2017 Final: Monday, April 24, 2017, from 7:15 PM to 9:15PM The midterm and the final are in ECS 132. The midterm is held during the scheduled class time and the final is a 2 hour test. There are no make up exams. VII. CLASSROOM ATTENDANCE It is required that you attend all lectures and take both exams. Good attendance will get you extra points. VIII. BONUS POINTS You can get extra points by having good attendance and by doing an extra homework. The extra homework will be given during the last 2 weeks of the course and is due on the exam day. It is worth 12 points. The good attendance is worth up to 6 points and you earn it by being present to the lectures. From time to time I will take attendance and if you are absent you loose 0.5 points. If you are late or leave early, you loose 0.25 points. IX. COURSE GRADE At the end of the course I add up the scores for the homeworks, exams, and bonus points. Then I assign the grade based on the scheme below. Total Points Grade ------------ ----- total < 70 less than C 70 <= total < 80 C and C+ 80 <= total < 90 B-, B, B+ total >= 90 A- and A X. OFFICE HOURS Mondays and Wednesdays: 12:30PM - 1:45PM and 9:15PM - 10:30PM. For other times contact me for an appointment at the address below. Dr. Alex Pelin ECS 318 Tl. (305) 348-3386 email: pelina@cis.fiu.edu XI. TOPICS SCHEDULE Week Topic Book Chapter(s) ---- ----- --------------- Jan 8-14 Discuss syllabus, Generics Chapter 1 Jan 15-21 Generics Chapter 1 Jan 22-28 Algorithm analysis Chapter 2 Jan 29-Feb 4 Algorithm analysis Chapter 2 Feb 5-11 Lists, Stacks, and Queues Chapter 3 Feb 12-18 Lists, Stacks, and Queues Chapter 3 Feb 19-25 Trees Chapter 4 Feb 26-Mar 4 Midterm, Trees Chapter 4 Mar 5-11 Trees Chapter 4 Mar 12-18 Spring Break, No Classes Mar 19-25 Hashing Chapter 5 Mar 26-Apr 1 Hashing, Priority Queues Chapters 5, 6 Apr 2-8 Priority Queues Chapter 6 Apr 9-15 The Disjoint Set Class Chapter 8 Apr 16-22 Graph Algorithms Chapter 9 XII. IMPORTANT DATES Mon, Jan 9 : Classes begin Mon, Jan 16 : MLK Birthday, no class Tu, Jan 17 : Last day to add or drop a course without incurring a financial penalty Wed, Mar 1 : Midterm Mon, Mar 13 : Spring Break, no class Wed, Mar 15 : Spring Break, no class Mon, Mar 20 : Last day to drop a class with a DR grade Wed, Apr 19 : Last day of class Mon, Apr 24 : Final exam from 7:15 to 9:15PM Th, May 4 : The grades are available to students