CIT 505 Fall 2003 (CTE SSD5) Outline:
Instructor: Kenneth L Moore email kmoore@ccac.edu Office N457
Site http://web.acd.ccac.edu/~kmoore/
This information applies to: CIT505 BC63 6:00-10:10PM W Boyce S585
Texts:
Data Structures and Problem Solving Using C++ 2nd edition
Mark Allen Weiss
Addison Wesley Publishing
ISBN: 0-201-61250-X
C++: The Complete Reference
4th Edition Herbert Schildt
McGraw-Hill
Grading: There are 4 exams, however, only the final is for CTE certification. Each exam has 2 sections a multiple choice and a practical (programming) part. For certification, the student must obtain an 80% minimum on each of the last test.
Note: Completing this course can provide you with iCarnegie certification (iCarnegie is a CMU for-profit subsidiary) ; however, the requirements are stringent. iCarnegie has provided grading rubrics which will be adhered to 100%. These grading criterion will be spelled out in class. In addition to class room attendance, you must complete all assignments and quizzes. Further, expect to spend a MINIMUM of 10 hours per week in study time.
Instructor’s Statement: I am committed to seeing every student in this class become certified. Do not fall behind. If you are getting into trouble I will be more than happy to assist you.
Visual Studio .net: Go to: http://www.ccac.edu/default.aspx?id=138906 for information on how to obtain a free copy of Visual Studio .net from the library.
| Section | Weiss | Schildt |
|---|---|---|
| 1.1: C++ Introduced | None | Chapter 11 |
| 1.2: Data Structures and Algorithms | None | None |
| 1.3: Basic C++ Programming | Chapter 2 | Chapters 12, 19 - 21 |
| 1.4: Memory Management | Chapter 1 | Chapters 13 - 15 |
| 1.5: Mechanisms for Code Reuse and Abstraction | Chapters 3, 4 | Chapters 16 - 18 |
2.1: Using the Standard
string
Class |
None | Chapter 36 (Reference) |
| 2.2: The STL and Basic Containers | Sections 1.2, 2.6 | Chapter 36 (Reference) |
| 2.3: Linked Lists | Section 7.6, Chapter 17 | Chapters 33 - 36 (Reference) |
| 2.4: Queues | Section 7.2, Chapter 12 | Chapters 33 - 36 (Reference) |
| 2.5: Stacks | Section 7.2, Chapter 12 | Chapters 33 - 36 (Reference) |
| 3.1: The Basic Concept of Recursion | Sections 8.1 - 8.3 | Chapters 33 - 36 (Reference) |
| 3.2: Problem Solving with Recursion | Sections 8.5, 8.7 | Chapters 33 - 36 (Reference) |
| 4.1: Sorting and Searching | Chapters 9, 20 | Chapters 33 - 36 (Reference) |
| 4.2: Complexity | Chapter 6 | Chapters 33 - 36 (Reference) |
| 5.1: Trees | Chapter 18, Sections 7.7 - 7.9, 19.1 | Chapters 33 - 36 (Reference) |
| 5.2: Graphs | Chapter 15 | Chapters 33 - 36 (Reference) |
Fall 2003 CIT 505 (CTE SSD5) Schedule:
This schedule is subject to change during the semester based on level of student difficulty. This is a brand new course and this is the first time I have taught it as such. (This is my eighth time teaching this course, but this is a new format.) We are going to have to get a feel for how to proceed as we go.
|
Week 1 Jan 26 |
CCAC student net ID’s. CTE ID’s. Familiarity with CTE. Sections 1.1, 1.2, 1.3 Visual Studio .net |
|
Week 2 Feb 2 |
Section 1.4 |
|
Week 3 Feb 9 |
Section 1.5 |
|
Week 4 Feb 16 |
Exam 1 |
|
Week 5 Feb 23 |
Sections 2.1, 2.2 |
|
Week 6 Mar 1 |
Sections 2.3, 2.4, 2.5 |
|
Week 7 Mar 8 |
Sections 3.1, 3.2 |
|
Week 8 Mar 15 |
Sections 4.1, 4.2 |
|
Week 9 Mar 22 |
Exam 2 |
|
Week 10 Mar 29 |
Section 5.1 |
|
Week 11 Apr 12 |
Section 5.2 |
|
Week 12 Apr 19 |
Exam 3 |
|
Week 13 Apr 26 |
Review |
|
Week 14 May 3 |
Certification Exam |