CSCI 1321 (Principles of Algorithm Design II), Fall 2001Syllabus1 Course descriptionThis course is the second course for computer science majors, following the guidelines establishedby the Association for Computing Machinery. This course also partially satisfies the requirementsfor Understanding the World Through Science of the common curriculum. The course content willinclude defining data types including singly-linked lists, doubly-linked lists, stacks, queues, andtrees; recursion; use of libraries; pointers; dynamic memory; type-independent programming; andprogram implementation strategies.The objectives of this course include, but are not limited to, the following:• Learning fundamental problem-solving methodology.• Implementing algorithms using a programming language.• Dealing with complex systems.• Development and analysis of algorithms.• Introduction to the basic topics in data structures.2 Basic informationClass meeting times and location• TR 2:10pm – 3:25pm, Halsell 228Prerequisites• CSCI 1320, or consent of instructorInstructor and contact information• Dr. Berna Massingill• Office: Halsell 201L• Office phone: (210) 999-8138• Web page: http://www.cs.trinity.edu/~bmassing• E-mail: [email protected]• Office hours: Monday noon – 3:30pm, Tuesday 3:30pm – 5pm, Wednesday noon – 4:30pm,Thursday 3:30pm – 4pm, and by appointment1CSCI 1321 Syllabus Fall 20013 Course materialsTextbook• Michael Main and Walter Savitch. Data Structures and Other Objects Using C++. AddisonWesley, second edition, 2001.Web pageMost course-related information (this syllabus, homework and reading assignments, etc.) will bemade available via the World Wide Web. The course Web page is a starting point for Web-accessible course material; you can find it linked from my home page (http://www.cs.trinity.edu/~bmassing), directly at http://www.cs.trinity.edu/~bmassing/CS1321_2001fall/, or viaTiger’s Lair (http://bb.trinity.edu/).Other references• T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. McGraw Hill,sixth edition, 1992. Emphasizes algorithms, not programming.• Cygnus. “The ISO/ANSI C++ Draft Standard”. http://www.cygnus.com/misc/wp/. Ifyou want to know about some obscure C++ rule and have lots of hours to understand theterminology.• Daniel P. Friedman and Matthias Felleisen. The Little LISPer. MIT Press, trade edition,1987. A good book on recursion.• Daniel P. Friedman and Matthias Felleisen. The Little Schemer. MIT Press, fourth edition,1995. A good book on recursion.• Nicolai M. Josuttis. The C++ Standard Library: A Tutorial and Reference. Addison Wesley,1999. A good STL reference book.• Brian W. Kernighan and Dennis M. Ritchie. The C Programming Language. Prentice Hall,second edition, 1989. The reference for C, written by its creators.• Andrew Koenig and Barbara Moo. Ruminations on C++. Addison Wesley, 1997. A greatbut advanced book on C++ programming.• Stanley B. Lippman. Essential C++. Addison Wesley, 2000. A very short book coveringC++ essentials.• Stanley B. Lippman and Jos´e Lajoie. C++ Primer. Addison Wesley, 1998. A lengthy bookintroducing C++ language features.• P.J. Plauger, Alexander A. Stepanov, and Meng Lee. Standard Template Library: A DefinitiveApproach to C++ Programming. Prentice Hall, 1996. Presumably authoritative, since one ofthe authors wrote the STL.• Bjarne Stroustrup. The C++ Programming Language. Addison Wesley, 1997. The creatorof the C++ programming language introduces its features.2CSCI 1321 Syllabus Fall 20014 Course requirementsGradingGrades in this course will be determined by the results of three major exams (two midsemesterexams and a final exam) and several homework assignments. Each midsemester exam will be worth100 points, the final exam will be worth 200 points, and together the homework assignments willbe worth approximately 400 points, with the weight of individual assignments determined by theirlength and difficulty. Numeric grades will be calculated as a simple percentage, by dividing pointsearned (on homework assignments and exams) by points possible. These numeric grades will thenbe converted to letter grades based on a curve, but in no case will the resulting letter grades beworse than students would receive based on the following scheme:Numeric grade Letter grade90 – 100 A80 – 89 B70 – 79 C60 – 69 D0 – 59 FExamsExams are comprehensive but will emphasize the most recent material. They are scheduled asfollows. Please plan accordingly.• Exam 1: October 4, in class. Changed to: October 11, in class.• Exam 2: November 1, in class. Changed to: November 20, in class.• Final exam: December 15, 8:30am.Homework assignmentsSeveral homework assignments will be required for successful completion of this course. Detailedrequirements, including due dates and times, will be provided as part of each assignment; normallyyou will have about a week between the time the homework is assigned and the time it is due. Mosthomeworks will be C++ programming assignments. You are encouraged to use the department’snetwork of Linux machines, but unless otherwise specified for individual assignments, you may useany other system that provides a suitable environment.AttendanceRegular class attendance is strongly encouraged.E-mailCourse-related announcements will sometimes be made by sending e-mail to the Trinity e-mailaddresses of all registered students. Students are strongly encouraged to read mail sent to theirTrinity addresses frequently. An archive of such announcements will be provided via the courseWeb page.3CSCI 1321 Syllabus Fall 2001Late and missed workExams can be made up only in cases of documented conflict with a university-sponsored activityor documented medical emergency. Homework will normally be accepted up to one class periodlate, but no more, at a penalty of 10 percent off per working day. This penalty may be waived oradditional time allowed at the instructor’s discretion in cases of illness or conflict with a university-sponsored activity.If you have unusual circumstances (as we all sometimes do), please discuss these with theinstructor as far in advance as possible.Collaboration and academic integrityUnless otherwise specified, all work submitted for a grade (homework assignments and exams) mustrepresent the student’s own individual effort. Discussion of homework assignments among studentsis encouraged, but not to the point where detailed answers are
View Full Document
Unlocking...