Вы находитесь на странице: 1из 3

CISP 430

Data Structures (C++)


Fall 2011

Professor: Fox, David Meetings: TuTh 5:30 pm - 6:50 pm Room: Liberal Arts 129 (LEC - 12204) Lab - Online Term: Fall 2011 | Full Semester | Aug 20, 2011 - Dec 15, 2011 Drop Date: November 15, 2011 Units: 4.00 Office hours: Room 19 CS&IT Area; Posted on my door Phone: 484-8681 (Except during office hours, use e-mail for a faster response) Email: foxd@arc.losrios.edu (Much better than the phone) D2L Page: https://d2l.losrios.edu Text: C++ Plus Data Structures Materials: Digital storage media Course Prerequisite: CISP 400 OR CISP 401 with a grade of C or better. Course Description: This course applies object-oriented techniques for systematic problem analysis and the
managing of program complexity using abstraction. Specifications, design, coding, testing, and documentation of large multi-file programs are covered. It uses advanced language features such as classes, strings, non-text files, pointers, and recursion. Abstract data types such as stacks, queues, lists, binary trees, heaps/priority queues, hash tables, and graphs are examined. Various sorting and searching algorithms are presented and analyzed using BigO notation.

Student Learning Outcomes - Upon completion of this course, the student will be able to:
Propose solutions to complex programming problems. Create code to implement these solutions. Formulate and interpret program specifications. Choose advanced features of the programming language to solve programming problems. Evaluate the use of various abstract data structures to solve programming problems. Estimate the efficiency of various sorting and searching algorithms using Big-O notation.

Evaluation Procedures: The course will be graded on the following: 6 Programming projects 2 Midterm exams 1 Final exam Class participation 600 150 200 50 1000

75, 75

Total

100% >= A >= 90% > B >= 80% > C >= 70% > D >= 60% > F Lab work: You are encouraged to discuss the programming projects with your fellows. However, students must
do their projects individually. Students who turn in work that is not original will receive an "F", dismissal from the class or other sanctions. In the case of duplicate work, both parties will be liable; DO NOT allow your original work to be copied under any circumstances. Identical code will be presumed to have been copied. You must follow the "Lab Manual" procedures on the class D2L page. Programming projects may NOT be turned in late.

Imail: You have a free Imail account. It is a requirement of this class that you activate this account. I
may send messages to the class using these addresses. You are responsible for any information that I send using this method.

Missed exams must be made-up within one week of the exam date and before the exam has been
returned to the class. You may not make-up the final exam.

Attendance Requirements: College students are expected to attend all sessions of their courses. Excessive
absence may result in the student being dropped from the class by the instructor. Excessive absence may be defined as the number of unexcused absences equal to the number of meetings of a class per week, plus one. Students who arrive late to class will not be counted as present for that session. A student will be considered to be late if he or she arrives after the time that the class begins as listed in the Schedule of classes.

Personal Computer use: The use of personal computers during class time shall be allowed at my
discretion. Anyone wishing to use a personal computer must sit in the first two rows of the classroom. You cannot use AC power.

CISP 430 - Tentative Class Schedule


Programming Projects: As the term progresses, these will increase in difficulty. Early assignments will
be worth fewer points than later ones. Due: See the D2L drop box. All of these must be turned in.

Week 1: Aug. 23- 25


Reading: the "Lab Manual" (D2L page) Lab: Introduction to the lab and the compiler Programming Project #1 (50 pts.) (D2L page)

Week 2: Aug. 30 Sept. 1


Reading Chapter 2.2 Homework: Chapter 2: 2, 5, 7, 8 Programming Project #1

Week 3: Sept. 6 - 8
Reading Chapter 2 (end of chapter) Programming Project #2 (100 pts.)

Week 4: Sept. 13 15
Reading: C++ and Memory (D2L page) Programming Project #2

Week 5: Sept. 20 22
Reading: Chapter 1 Programming Project #3 Lists, Stacks, Queues (100 pts.)

Week 6: Sept. 27 29
Reading: Chapter 3 Homework: Chapter 3: 1 a, b, c, d; 2 a, b, c, d Programming Project #3 Reading Chapter 4

Week 7: Oct. 4 - 6

Exam 1 - Chapters 1-3, C++ and Memory Programming Project# 4: Recursion (100 pts.)

Week 8: Oct. 11 - 13
Reading Chapter 4 Homework: Chapter 4: 1, 2, 9, 10 Lab: Chapter 4: 8

Week 9: Oct. 18 - 20
Reading Chapter 5 Homework: Chapter 5: 11, 12 Programming Project# 5: TBA (100 pts.)

Week 10: Oct. 25 - 27


Reading Chapter 6 Homework: Chapter 6: 2, 3

Week 11: Nov. 1 - 3


Reading: Chapter 7

Week 12: Nov. 8 10


Homework: Chapter 7: 1 a, b, c, d, e; 2 a, b, c, d, e, f ,g

Week 13: Nov. 15 - 17


Exam 2 - Chapters 1-7 Programming Project# 6: TBA. (150 pts.) Reading: Chapter 10

Week 14: Nov. 22


Reading Chapter 8 Homework: Chapter 8: 1 through 12 all parts

Week 15: Nov. 29 Dec. 1


Reading Chapter 9 (through 9.4) Homework: Chapter 9: 1

Week 16: Dec. 6 8


Additional topics Review for final

Final schedule: Tuesday, December 13

5:45-7:45 p.m.