CIS 250 – Computer Science
II
|
Instructor: Chuck Kelly |
Office:
E-120A |
Telephone: (734) 384-4149 |
|
mail: ckelly@monroeccc.edu |
|
Office
Hours:
My office hours for the semester
are posted on my web site and on my office door. Look for me in the computer labs if I am not
in my office.
Texts: C++ Plus Data Structures (Fourth Edition) - by: Nell Dale, ISBN 0-7637-4158-2
Object Oriented Programming in C++ (Fourth Edition) - by: Robert LaFore, ISBN 0-672-32308-7
|
Assignments: |
|
|
Grading Scale: |
|
|
Programs |
40% |
|
A |
90%
- 100% |
|
3
Tests |
20%
each |
|
B |
80%
- 89% |
|
|
|
|
C |
70%
- 79% |
|
|
|
|
D |
60%
- 69% |
Student
Responsibilities:
·
Read
material appropriate to lecture topic prior to class.
·
Follow
policies and procedures presented in the College's catalog and course schedule.
·
Check
grade/assignment posting for assignments, due dates and test dates.
·
Turn
off cell phones, pagers and any other device that might disturb class.
·
Ask
questions, often.
Programs:
You should plan on spending outside class time working on the programs. Programs turned in late will receive a 20% reduction in grade for each class session past the due date. Program grading will be based upon the following criteria:
·
Correctly
performs the operation(s) specified in the assignment.
·
Written
in a clear and concise manner.
·
Proper
source code formatting is used.
·
The
program contains appropriate comments.
General
Policies:
·
Tests
may include material from the lectures and the related chapters in the text.
·
No
lab partners. Do your own work, unless specifically directed to work in a
group.
A grade of incomplete cannot be
given except in the case of serious illness or accident. If you must quit the
class, drop officially at the office to avoid an E on your permanent record.
Class
Schedule:
Week Topic
1. Software Engineering Principles (Dale 1)
Data Design and Implementation (Dale 2)
2. Object Oriented Programming in C++ (LaFore 4,5)
3. Object Oriented Programming in C++ (LaFore 6)
4. Inheritance (LaFore 9), Pointers (Lafore 10)
5. test 1
6. ADTs Unsorted List and Sorted List (Dale 3)
7. ADTs Stack and Queue (Dale 4)
8. Linked Structures (Dale 5)
9. Lists Plus (Dale 6)
10. test 2
11. Programming with Recursion (Dale 7)
12. Binary Search Trees (Dale 8)
13. Priority Queues, Heaps, Graphs, and Sets (Dale 9)
14. Sorting and Searching Algorithms (Dale 10)
15. test 3
Information
in this document is subject to change at any time and for any reason. J
Your mileage may vary. Void where prohibited. The author make
no warranty either expressed or implied as to the accuracy of this document or any information derived
therefrom.
08/2007
CK