|
|
|
CAPITOL COLLEGE |
|
|
|
CS230 D01 |
|
Computer Science Fundamentals II |
|
Spring 2012 |
TIME & LOCATION: Tuesday and Thursday 1:10PM to 2:40PM, Room M103
REQUIRED TEXT: Programming and problem solving with C++, Comprehensive edition, 5th edition, Nell Dale and Chip Weems
REFERENCE TEXT: Not applicable
GOALS AND OUTCOMES:
1. Will be able to understand and code classes in C++ and use them in a client class
2. Will be able to understand and code linked lists
3. Will be able to understand and code stacks and queues
4. Will be able to understand and code recursive functions
5. Will be able to understand various searching and sorting algorithms and functions
6. Will be able to understand binary trees and binary search trees
7. Will be able to evaluate the efficiency of a simple algorithm
COURSE SUMMARY AND SCHEDULE: This is a 3-credit course.
Review of C++;
introduction to Object oriented Programming.
Abstract data types, pointers, dynamic
memory allocation,
linked lists, stacks, queues, templates, inheritance, polymorphism, searching,
sorting,
trees, algorithm's efficiency.
WEEK OF
|
CHAPTER |
TOPICS (Tentative Schedule of
Topics) |
EVENTS |
|
|
1 |
Jan 10, 12
|
5,6,7,8,9 |
Review of C++, Phases of software
development |
|
|
2 |
Jan 17, 19 |
8,9,14 |
Review of C++, Pointers and dynamic arrays |
|
|
3 |
Jan 24, 26 |
12 |
Abstract data types, classes |
Quiz 1 (Jan 26) |
|
4 |
Jan 31, Feb 2 |
12,16 |
Classes,
Operator overloading |
|
|
5 |
Feb 7, 9 |
15 |
Inheritance and polymorphism |
Quiz 2 (Feb 9) |
|
6 |
Feb 14, 16 |
14 |
Linked Lists |
|
|
7 |
Feb 21, 23 |
14,17 |
Linked Lists, Stacks and Queues |
Quiz 3 (Feb 23) |
|
8 |
Feb 28, Mar 1 |
|
Midterm 1 review and midterm 1 |
Midterm 1 (Mar 1) |
|
9 |
Mar 6, 8 |
16,14 |
Templates, Other Linked Lists |
|
|
10 |
Mar 13, 15 |
|
Spring break – no class |
|
|
11 |
Mar 20, 22 |
18,13 |
Recursion, searching |
Quiz 4 (Mar 22) |
|
12 |
Mar 27, Mar 29 |
|
Midterm 2 review and midterm 2 |
Midterm 2 (Mar 29) |
|
13 |
Apr 3, 5 |
18 |
Sorting |
|
|
14 |
Apr 10, 12 |
18 |
More Sorting |
Quiz 5 (Apr 12 ) |
|
15 |
Apr 17, 19 |
17 |
Binary Trees, Binary Search Trees |
|
|
16 |
Apr 24, 26 |
|
Graphs (if time allows), Final review |
Quiz 6 (Apr 24) |
|
17 |
May 1, 3 |
Final |
Final exam (date and time TBD) |
|
Last day to withdraw from a course is March 15, 2012
|
PROFESSOR: |
Hervé Franceschi |
M202 |
X 3613 |
|
|
|
|
|
|
|
|
|
Software: C++ (Windows or Unix)
Lab Facilities: lab (C++ under Unix)
Getting Help: Please feel free to ask questions during
class as necessary. For additional help, visit me
during my office hours or by appointment, or call me at the above given numbers, or send me an email.
Office Hours:
|
DAYS |
HOURS |
|
Monday |
12:20PM to 1:10PM and 2:40PM to 5:00PM |
|
Tuesday |
12:20PM to 1:10PM |
|
Wednesday |
12:20PM to 1:10PM and 2:40PM to 5:00PM |
|
Thursday |
12:20PM to 1:10PM |
|
SEMESTER GRADES: |
Projects (4 or 5) |
30% |
<A: 90-100%> |
|
|
Quizzes (6) |
10% |
<B: 80-89%> |
|
|
Midterm 1 |
15% |
<C: 70-79%> |
|
|
Midterm 2 |
15% |
<D: 60-69%> |
|
|
Final |
30% |
<F: < 60%> |
|
|
Total |
100% |
|
Homework: All assignments are individual in this class; they must be completed individually. You must completely understand all work that you submit; you must be able to provide explanations for all work that you submit.
Assignments: As a general rule, all assignments must be completed to pass the course.
Late assignments : Loss of 11% per week late. Example: perfect assignment 3 days late = grade of 89
Very late assignments may be handed in with your final exam at the end of the semester for a
maximum grade of 40%.
QUIZZES: There are 6 quizzes total; you can drop your worst quiz grade (i.e. only your 5 best
quizzes will count). No make ups will be allowed.
TESTS & FINAL: There are 3 tests in this class: 2 midterms and 1 final. The final is cumulative.
Make ups are possible in exceptional circumstances provided advance
notice and suitable
documentation is provided to me.
Unless otherwise stated, make-ups must be completed
within 1 week of the original exam date. Both the midterm and the final
are closed books, open personal
handwritten notes (i.e. you cannot have notes that are copied from
another source, and they must be
handwritten by you ; you cannot have handouts).
ATTENDANCE: Attendance is important; a lot of labs are scheduled for this class and a lot of learning will happen in the classroom. Please send me an email if you are going to miss a lecture.
WRITING REQUIREMENTS: The ability to communicate ideas using established rules of the English language is an important outcome of everyone’s technical education. In this course, you will be required to complete assignments for which writing is an important component, and attention to the grammar, spelling, and style of writing that you employ will have a significant impact on your grade in such assignments. You may seek help at the tutoring resource center to improve your writing abilities, should you feel that such help is necessary.
INFORMATION LITERACY: Given the magnitude of information that we are expected to deal with in performance of our tasks, it is important to learn the proper ways of finding, retrieving, storing, processing and incorporating the right type of information. This course may include assignments that would require the use of on-campus and on-line libraries, the Internet or other sources of publicly available information.
OUTCOMES ASSESSMENT: In order to determine the level of learning
achieved in this course through the semester, you will be given a pre-test that
covers some of the fundamental topics covered in this course and possibly in
the prerequisite courses, accompanied by an exit test toward the end of the
semester. The grades you receive in the
pre-test and exit test will not affect your overall grade for this course. They are used for the sole purpose of institutional
assessment of learning outcomes.
THE "INCOMPLETE" GRADE: There is occasionally a misunderstanding about “incompletes.” College regulation specifies that an incomplete grade may be awarded only if the student has completed almost all the work for a course and has a valid, institution-approved, reason for being unable to complete it. If you are awarded an incomplete grade, it is your responsibility to complete all work for the course within the first 4 weeks of the next semester or summer term. After this time, the Registrar automatically converts the incomplete to an F.
ACADEMIC INTEGRITY: It goes without saying that all work handed in for grading must be your own, but you must go further than this. Avoid situations that could compromise your integrity. For example, do not allow others to copy your work. If inclusion of another person’s writings in your submitted work is appropriate, then proper credit should be given to the author of that writing. I will report any instance of suspected academic dishonesty to the appropriate committees of the school for further investigation and possible sanctions.
USE OF MATLAB: Not applicable
First Homework Assignment: Fill in the list in class with your name and email.
Web Site: I will maintain a web site for this course that can be reached from the following address:
http://faculty.capitol-college.edu/~hfranceschi/. Starting from this homepage you can follow the appropriate links to see postings for assignments, homework, examples, etc. related to this course. This syllabus is also posted on line.