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

Course Times and Locations:      LECTURE:    TR 12:30-1:45 PM in MLIB 31 
                                                       LAB:             TBA

Instructor: Dr. Melody Stapleton

Instructor's Office Hours: TuTh 2 - 3:15 pm in OCNL 208

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
• Mandatory Software: WebTutor on WebCT for Drozdek's Data Structures and Algorithms in C++,2nd Edition,
  George Harrison Norfolk State University,Published by Brooks/Cole,© 2001,ISBN/ISSN: 0-534-38396-3
• Recommended Text: Data Structures and Program Design in C++
  by Robert Kruse and Alex Ryba, published by Prentice Hall; ; 1st edition ©1998, ISBN: 0137689950

Note: Both of the above can be found at: http://www.brookscole.com/cgi-brookscole/course_products_bc.pl?fid=M2b&product_isbn_issn=0534375979&discipline_number=6&subject_code=CS01

• 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
  

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/ (watch for Live and Internet Courses for Spring 2003 -  CSCI 151 : Data Structures and Algorithms using C++).

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.