INTRODUCTION TO DATA STRUCTURES: SYLLABUS Gary T. Leavens, Department of Computer Science, Iowa State University, Ames, Iowa 50011-1040 USA leavens@cs.iastate.edu $Date: 1995/04/28 13:58:00 $ This syllabus tells when we will be discussing the various topics. The ``when'' is specified below by class meeting numbers (a count of the ``lectures''), and by a separate table (overleaf) that relates class meeting numbers to calendar dates. This syllabus will doubtless be changed, including the exact dates of tests. (Changes will be announced in class.) In the syllabus, the abbreviation HR below means Headington and Riley's book ``Data Abstraction and Structures'' (D.C. Heath, 1994). The abbreviation DD means Deitel and Deitel's book, ``C++: How to Program'' (Prentice-Hall, 1994). These books and other reference materials are on reserve at the library. Both of the course texts (HR and DD) present C++ code as fully worked out solutions to problems, with little discussion about intermediate steps in the development of the code. So that you do not passively skip over the code without understanding it, it is important that you read the code in these texts carefully. One way to do that is to read it over as if you were checking for errors. Even better, before reading any code that is not presenting a new language feature, try the following. First, be sure you understand the problem that is to be solved. Second, sketch out in your head (better: on paper) how you would solve it. Then read the code carefully to see if your ideas are correct or not, and note where the authors did something differently. Meetings Topic Essential Readings Other Readings --------------------------------------------------------------- 1-2 Introduction 3 Compiling C++ programs DD 1.12-13, 1.14-16 4-11 Scheme to C++ Handout, HR App. A DD 1.6-7, 1.17-19, 4.1-5 12-16 Control Abstraction HR 1 DD 2, 3.3-9, 3.11, 3.15 17 test 16-19 Modules & Info. Hiding HR 2 DD 3.10, 18.5, 17.1-2 19-22 Data Abstrac. & Classes HR 3 DD 6, 7.1-4, 7.8, 8 23-26 Client View of Data S. HR 4, HR 12.1-3 HR 12.9 26-30 Records & Variants HR 5 DD 16.2-4, 18.12 31 test 32-39 Pointers & Dynamic Data HR 7 DD 5, 7.5-6 40-43 Linked Lists HR 8 DD 15.4 44-47 Design/Impl. of ADTs HR 9 DD 15.5-6 48,50-51 Searching & Hashing HR 12.4-6 49 test 51-52 Sorting (may slight) HR 12.7-8 HR 12.10 52-56 Trees HR 13.1-3, 13.6-7 HR 13.4-5, DD 15.7 57 File I/O DD 14.7-11 HR A-93-95, A-101-111 58-59 Review and Course Eval final exam The following table relates the meeting numbers to the calendar. Please don't plan to miss the meetings before and after Break. (Note there is a test planned for the last meeting before break.) Date Meeting Num. Comment ------------------------------------------------ January 17, 1995 1 January 23, 1995 4 free drop deadline January 30, 1995 8 pass/not pass deadline February 2, 1995 10 March 2, 1995 26 March 9, 1995 30 midterm grades decided March 10, 1995 31 last meeting before break March 20, 1995 32 first meeting after break March 29, 1995 drop deadline April 2, 1995 40 May 1, 1995 56 May 5, 1995 59 last meeting before exams May 9, 1995 final exam, 9:45am - 11:45am