California State University, Chico
Department of Computer Science

CSCI 151 Internet Course 

Syllabus/Course Requirements

Course Number: CSCI 151

Course Title: Algorithms and Data Structures

Prerequisite: A grade of C- or better in CSCI 15B - Programming and Algorithms II or equivalent

Instructor: Dr. Melody Stapleton

Faculty Phone: (530) 898-5617 , message 898-6442, fax 898-5995

Email: mjstapleton@csuchico.edu

Textbooks:

• Mandatory Text: Data Structures and Algorithms in C++, Second Edition by Adam Drozdek, published by Brooks/Cole Thomson Learning, © 2001, ISBN 0-534-37597-9
• Recommended Text: Data Structures and Program Design in C++ by Robert Kruse and Alex Ryba, published by Prentice Hall; ©1999, ISBN: 0137689950
• Optional: Any good STL reference such as - STL Programming from the Ground Up by Herbert Schildt, published by Osborne/McGraw-Hill, © 1999, ISBN 0-07-882507-5
• Optional: Any good C++ reference such as Object-Oriented Programming in C++ (4th Edition)
  by Robert Lafore, published by Sams, © 2001, ISBN: 0672323087
  
  Please note: In order to get into the WebCT home page for this course, you must purchase a student access code from WebCT for $15.00.  This code provide access to an epack that the author had created specifically for the course.  The epack is actually a "shell" that sits on top of my course.  When the enter the course home page (on our WebCT server) it will ask for an access code.  You actually purchase the code from a WebCT website (using a credit card) and get the code instantly.
   
  If you cut and paste the URL below into your browser they will go directly to the place in WebCT to purchase the code -
  http://www.webct.com/global/purchase/CourseInfo?PAGE=pgPINSearchResults&COMMAND=MORE_INFO&product=2522318
   
  Or if you go to the WebCT website, you should click on the choice in the header menu of "Digital Content", then when a submenu comes up, click on Student Access Codes.  You will go to a search page.  If you type in the keyword Drozdek (the author of the textbook/epack) then 2 choices will come up.  One choice is a C++ data structures epack and the other is Java.  Choose C++.  Now you are at the URL above and just need to give your credit card info and instantly get the code.  Then you can log in to my course in WebCT and see the recorded lectures.

  

Course Description: This course focuses  on object-oriented methodologies in designing and implementing a variety of data structures and algorithms.  Coverage includes recursion, trees, search structures, hashing, heaps, sorting algorithms, and graph algorithms.  Data structure and algorithm combinations will be studied and analyzed along with their relative merits using both mathematical and empirical measurements.  The course includes a number of large programming assignments focusing on object-oriented software engineering and algorithm development.  Students will be required to design, implement, test, and analyze their programs.   The language of focus for this incarnation of the course is C++. 

Course Goals: Students will be able to understand the role of several advanced data structures in programming object-oriented solutions to practical problems.  Students will be able to successfully design, code, analyze and test several large programming projects, covering a variety of data structures.  Students will understand time and space complexity issues as they relate to various algorithms and data structures.

Course Notes: To be posted on the web as the course develops.

Web Page: www.ecst.csuchico.edu/~melody/ 

The web page for this course is at : http://www.ecst.csuchico.edu/~melody/courses/Spring2003CSCI151/Default.htm

Plagiarism/Cheating Policy:  Programming assignments and homework assignments are to be an *individual* effort.  Anyone who as determined by the Instructor/TA has copied any part of another students work will automatically receive a grade of "F" for the course.  Anyone cheating on an exam will receive a grade of "F" for the course.  Anyone who alters their exam answers after receiving the exam back with receive a grade of "F" for the course.

Course Assignments:

There will be three large programming assignments for the course as well as some smaller homework assignments.  The topics of the programming problems will be selected from: Trees, Graphs, Heaps, Hashing, Data Compression, Memory Management

Policy on Turning in Programs and Homework Assignments:   Due dates are firm.  No late assignments will be accepted unless serious illness or other excused absences merit allowances in the judgment of the instructor.

Grade Evaluation Procedures (Note these are for the Internet Students since they do not have to turn in homework and there were no quizzes):  Students will be graded based on their performance in the following course components -

• Programming Problems/Homework Assignments               45%      (15% for each program)
• Midterm Exam                                                                      25%
• Final Exam                                                                             30%

Students need to receive at least 60% credit in *each* component of the course in order to pass the course.  Exams are the property of the instructor and may be reviewed by the students after completed and graded, but will be kept by the instructor.