Computer Science 231 - Syllabus

COMPUTER SCIENCE 231 - SYLLABUS File Structures Concepts FALL - 2001 Section 5

Instructor: Dr. Dorota M. Huizinga

Room: CS-417 E-mail: [email protected]

Phone/Voice: (714) 278-7150 Computer Science: (714) 278-3700

Office Hours: Tuesday 9:30 am - 11:25 am, Thursday 10:30 am – 11:25 am and 2:15 pm- 3:00 pm, or by appointment.

Course Time: T, TH 11:30 AM -12:45 PM Place: CS 110 B Course Prerequisites: CPSC 131 and CPSC 223V

Course Objectives: Concepts: The conceptual part of the course covers description and understanding of computer file structures and software systems. Topics include: file processing operations, secondary storage management, file structure concepts, indexing, sorting, and hashing. The students are expected to have basic understanding of these concepts by the end of the semester. Skills: The technical skill component of the course comprises C++ programming projects requiring file operations on text, binary, sequential and random files. The students are expected to have mastered basic file operations in C++ by the end of the semester.

Text: “File Structures An Object Oriented Approach with C++”, M.J. Folk, B. Zoellick, Greg Riccardi. Class and lecture notes available at ftp site: : http://ecs.fullerton.edu/~dorota

Grading Policy: Programming Assignments 25% Class Participation 10% Exam-1: 20% Exam-2: 20% Final: 25% TOTAL 100%

Final course grades will be assigned as follows:

90 -100 % A 80 - 89 % B 70 - 79 % C 60 - 69 % D 0 - 59 % F

Withdrawals: The last day to drop this course without record of enrollment is September 4. The last day to withdraw with the "W" grade for serious and compelling reasons is November 9. Penalty For Academic Dishonesty (see the quote below):

A grade of "F" will be assigned in the course if the academic dishonesty occurs.

ACADEMIC DISHONESTY

The following is taken from the University Rules (UPS 300.021):

"Academic dishonesty includes such things as cheating, inventing false information or citation, plagiarism, and helping someone to commit an act of academic dishonesty. It usually involves an attempt by a student to show possession of a level of knowledge or skill which he/she in fact does not possess.

Cheating is defined as the act of obtaining or attempting to obtain credit for work by the use of any dishonest, deceptive, fraudulent, or unauthorized means. Examples of cheating include, but are not limited to, the following: using notes or aids or help of other students on tests and examinations in ways other than those expressly permitted by the instructor, plagiarism as defined below, tampering with grading procedures, and collaborating with other on any assignment where such collaboration is expressly forbidden by an instructor. Violation of this prohibition of collaboration shall be deemed on offense for the person or persons collaborating on the work, in addition to the person submitting the work.

Plagiarism is defined as the act of taking the work of another and offering it as one's own without giving credit to that source. When sources are used in a paper, acknowledgment of the original author or source must be made through appropriate references and, if directly quoted, quotation marks or indentations must be used".

Examinations: Exam-1: Sep 20 (Th) (unless rescheduled and announced in class) Exam-2: Oct 25 (Th) (unless rescheduled and announced in class) Final : 12:00-1:50 PM, Dec 14 (T) CS 110 B

Attendance on exam days is mandatory; there will be no make-up exams unless extenuating circumstances prevail and the instructor reserves the right to make this determination.

Attendance: Attendance and class participation is extremely important in this course. COURSE OUTLINE

Date Topics Reading Aug 21 T Course Overview Syllabus Aug 23 Th Introduction to File Structures Ch 1 Aug 28 T Review of C++ - classes Ch 2 Aug 30 Th Review of C++ - files Ch 2 Sep 4 T Secondary Storage Ch 3 Sep 6 Th Secondary Storage Cont. Ch 3 Sep 11 T Fundamental File Structure Concepts Ch 4 Sep 13 Th Fundamental File Structure Concepts Cont Ch 4 Sep 18 T Study Day/Review Ch 1-4 Sep 20 Th EXAM 1 Ch 1-4 Sep 25 T Managing Files of Records Ch 5 Sep 27 Th Managing Files of Records Cont. Ch 5 Oct 2 T File System Performance Ch 6 Oct 4 Th File System Performance Cont. Ch 6 Oct 9 T Indexing Ch 7 Oct 11 Th Indexing Cont. Ch 7 Oct 16 T Cosequential Processing Ch 8 Oct 18 Th Sorting of Large Files Ch 8 Oct 23 T Study Day/Review Ch 5-8 Oct 25 Th EXAM 2 Ch 5-8 Oct 30 T Multilevel Indexing and B-Trees Ch 9 Nov 1 Th Multilevel Indexing and B-Trees Cont Ch 9 Nov 6 T Indexed Sequential File Access Ch 10 Nov 8 Th Prefix B+ Trees Ch 10 Nov 13 T Hashing Ch 11 Nov 15 Th Hashing Cont. Ch 11 Nov 20 T Thanksgiving Recess - no class. Nov 22 Th Thanksgiving Recess - no class. Nov 27 T Introduction to DBMS Class notes Nov 29 Th Introduction to DBMS cont. Class notes Dec 4 T Study Day/Review Ch 1-11 Dec 6 Th Study Day/Review Cont Ch 1-11 Dec 13 Th FINAL 12:00-1:50 PM Ch 1-11