Spring 2003, Section 00, 1:00-2:15 TuF, Curtis 208
SI Leader: Rajani Rajbhandari
e-mail: rrajbhan@cedarcrest.edu
Hours:
| Monday | 4:30-5:30 | Curtis 102 |
| Tuesday | 3:30-4:30 | Curtis 103 |
| Wednesday | 4:30-5:30 | Curtis 103 |
| Thursday | 4:00-5:00 | Curtis 103 |
| Friday | 12:00-1:00 | Curtis 103 |
This course develops algorithmic design and problem solving using structural programming techniques and the C++ programming language. Programming emphasis will be on block structures and stepwise refinement of algorithms. Language syntax, data types, and control structures are presented. Data structures considered include one- and two-dimensional arrays. Search and sort algorithms are developed. Modular coding, parameter passage, correct use of local and global variables, and debugging techniques are stressed.
None, although familiarity with Windows and basic computer literacy are assumed.
Dale, N., Weems, C., and Headington, M., Programming and Problem Solving with C++, 3ed, Jones and Bartlett, 2002. ISBN: 0-7637-2103-4.
Grades for this course will be based on the following assessment items with weights as follows:
Assignments will consist of one or more problems for which you will need to devise a solution and implement that solution as a C++ program (the first assignment will not involve implementation). Assignments are to be submitted in both electronic and printed form, and must include any appropriate accompanying documentation. Your instructor will provide instructions on submitting electronic copies of C++ programs over the Internet. Any C++ programs submitted that result in compiler errors from the Microsoft Visual C++ compiler will not be accepted.
Through programming assignments the student gains hands-on experience in programming and demonstrates ability to apply course material in problem solving situations, and ability to implement those solutions as computer programs.
Tests for this course will be written and will consist of problems and short answer questions. Tests will be open-book and open-notes.
Through tests, the student demonstrates competency in understanding and applying programming concepts and techniques in limited specific situations.
The format for the final exam will be the same as that of the tests, but longer. The final exam is comprehensive.
| Date | Topic |
|---|---|
| 1/14 1/17 |
Course Intro Ch. 1; Overview of Programming and Problem Solving |
| 1/21 1/24 1/28 |
Ch. 2; C++ Syntax and Semantics,
Program Development Process Ch. 3; Numeric Types, Expressions, and Output |
| 1/31 2/4 |
Ch. 4; Program Input and the Software Design Process |
| 2/7 2/11 2/14 |
Ch. 5; Conditions, Logical Expressions, and Selection Control Structures |
| 2/18 | Test 1 |
| 2/21 2/25 2/28 3/11 3/14 |
Ch. 6; Looping Ch. 9; Additional Control Structures |
| 3/18 3/21 3/25 3/28 |
Ch. 7; Functions Ch. 8; Scope, Lifetime, and More on Functions |
| 4/1 | Test 2 |
| 4/4 4/8 4/11 |
Ch. 12 - Arrays |
| 4/15 4/25 4/29 4/30* |
Sorting and Searching |
| TBA | Final Exam |
* Wednesday, April 30 follows a Friday schedule.
| No. | Assigned | Due |
| 1 | 1/17 | 1/24 |
| 2 | 1/28 | 2/4 |
| 3 | 2/4 | 2/11 |
| 4 | 2/14 | 2/25 |
| 5 | 2/28 | 3/18 |
| 6 | 3/21 | 3/28 |
| 7 | 3/28 | 4/11 |
| 8 | 4/11 | 4/29 |