1 Data Structures COP 4530 Spring 2010 MW 4:35 PM – 5:50 PM CHE 101 Instructor:Dr. Rollins Turner Dept. of Computer Science and Engineering ENB Office Hours: M & W 1:00 – 3:00 PM (OK to drop in any time)

2 Course Objectives You will be able to: Say what an Abstract Data Type (ADT) is and how ADTs relate to general data structures. Describe common ADTs such as lists, stacks, queues, trees, hash tables, and graphs, and use them in the design and implementation of computer programs. Design and use new ATDs.

3 Preliminaries Prior to taking this course, you should Be competent at programming in C++. Be familiar with a development environment for C++. Unix/Linux (e.g., Circe, Grad) Windows/Visual Studio

4 Textbook Data Structures and Algorithms in C++ Third Edition Adam Drozdek

5 Exams and Grading Grading:Projects 30% Midterm Exam 30% Final Exam 30% Quizzes10% Exams missed for a legitimate reason can and must be made up. Consult me, in advance when possible, to arrange makeup exam. Provide written documentation of cause of absence. (e.g., letter from doctor)

6 Letter Grades 90 – 100A 80 – 89B 70 – 79C 60 – 69D < 60F No “+” or “-” grades will be issued. Numerical average will be rounded to nearest integer..5 rounded up

77 University Policies Procedures for Alleged Academic Dishonesty or Disruption Of Academic Process: See current undergraduate catalog Page 59 and following.

88 Accommodations Disabilities Students in need of academic accommodations for a disability may consult with the Office of Services for Students with Disabilities to arrange appropriate accommodations. Please inform me if there is a need for alternate format for documents or a note taker. Religious Observances Students who anticipate the necessity of being absent from class due to a major religious observance must provide notice of the date (or dates) to me, in writing, by the second class meeting. Athletic Events Students who must miss an exam due to participating in a varsity athletic event should contact me two weeks in advance in order to make alternative arrangements.

99 Departmental Policies All students enrolled in courses taught by the Computer Science and Engineering Department are advised that unless an instructor specifies otherwise, all work done in homework, programming, or exams must be the result of a student’s individual effort. Students who copy, or who provide material for others, or who show dishonesty in their work as described in the university catalog, will be subject to disciplinary action, typically the receipt of a failing grade in the course, but also possible academic dismissal from the program.

10 Course Policies Programming projects will be graded. You may work with one other student on each project. If you work as a pair: Submit only one copy of the program. Include both names in Blackboard submission comments. Other student submit just a Blackboard comment Both students are expected to understand the program in detail.

11 Course Policies Projects must be submitted on time. Late projects will not be accepted, get an automatic 0. No replacements or substitutions after the deadline. Don't post assignments on the Internet Don't ask for help on Internet forums.

12 Course Policies It is OK to discuss projects with other students, but outright copying is not acceptable. Don’t copy anyone else’s work. Don’t let anyone copy your work. Penalty: 0 for the project. Reduction of one letter grade for the course. Projects must be submitted on time. Late projects will not be accepted, get an automatic 0.

13 Course Policies Attendance will not be taken after the first class. Attendance will not be a direct factor in grades. But class attendance is highly recommended. You may not sell notes or tapes of class lectures. OK to give them away!

14 Slides from some lectures will be available on the class web site: Also on class web site: Examples Project solutions Not all material covered in class will be on slides. Class Web Site

15 Blackboard ( ) will be used for all program submissions. Grades posted there also. Feedback in the form of annotated source files. Be sure you can log in and can find this class under the Courses tab. USF will be used for messages to students. Be sure you can receive messages sent to your official USF address. Check your regularly. Don’t let backlog exceed your quota. Welcome message will be sent out as a test. Communications

16 Course Schedule M10-Jan-11Week 1Abstract Data Types W12-Jan-11 Singly Linked Lists (Chapter 3) M17-Jan-11Week 2USF Holiday W19-Jan-11 Doubly Linked Lists (Chapter 3) M24-Jan-11Week 3A List Template W26-Jan-11 Lists of Objects M31-Jan-11Week 4Stacks (Chapter 4) W2-Feb-11 Queues (Chapter 4) M7-Feb-11Week 5Binary Search Trees (Chapter 6) W9-Feb-11 M14-Feb-11Week 6 W16-Feb-11 The Standard Template Library M21-Feb-11Week 7 W23-Feb-11 Midterm Exam Postponed!

17 Course Schedule M28-Feb-11Week 8Midterm Exam (New Date) W2-Mar-11 Huffman Codes M7-Mar-11Week 9 W9-Mar-11 Multiway Trees (Chapter 7) M14-Mar-11 AVL Trees W16-Mar-11 AVL Tree Rotations M21-Mar-11Week 10ALV Tree Implementation W23-Mar Trees, Red-Black Trees M28-Mar-11Week 11B Trees W30-Mar-11 Graphs (Chapter 8) M4-Apr-11Week 12 W6-Apr-11 M11-Apr-11Week 13Dikjstra's Algorithm W13-Apr-11 Heaps M18-Apr-11Week 14Sorting (Chapter 9) W20-Apr-11 M25-Apr-11Week 15Hashing (Chapter 10) W27-Apr-11 Sun1-May-11 Final Exam 12:30 PM - 2:30 PM