INSTRUCTOR: BJ Gleason

Phone: 723-4300

EMail: bjgleas@aol.com

Web Site: http://www.seoulcc.org/tal

Office Hours: Before/After class, and by appointment.

TEXTBOOK: Dale, Weems, & Headington, Programming and Problem Solving with C++, 1996

Whimbey and Lochhead, Problem Solving and Comprehension, LEA Press, 1999

SOFTWARE: Turbo C++ by Borland (Student Edition available at the website.)

DESCRIPTION: (Prerequisites: None) Introduces the student with little prior programming experience to the concepts of discrete logic and formal problem solving. Demonstrates the application of formal problem solving in computer programs. Introduces the use of a procedural computer language (C/C++). In this class you will learn to think about HOW you think. You will learn techniques for improving your ability to "reason out" solutions to problems. These skills will be useful not only in this class and other programming courses, but anywhere that technical reading and problem solving are used. (Includes math courses, standardized tests and most technical workplaces.)

INTERNET ACCESS: Students will be expected to have e-mail and Internet access. Some homework assignments will require extensive use of these resources.

MAILING LIST: Students are required to sign up for the class mailing list before the first class meeting. See the website for instructions.

OBJECTIVES: Upon successful completion of this course the student will:

Have improved his or her ability to apply specific problem solving techniques.

Be able to describe specific solutions in algorithm form.

Apply algorithms by constructing simple computer programs.

Write C/C++ programs.

EVALUATION:

Programming Projects: 25%

Exams 1, 2, 3: 45%

Final Exam: 20%

Attendance/Participation: 10%

POLICIES, PROCEDURES AND GRADES: IAW with the University of Maryland, University Catalog, Asian Division, and the Student Handbook (current editions). These cover essential information such as attendance, grading, make-up work and plagiarism.

ATTENDANCE: Because much of the material in this class consists of in-class group problem solving activities, class attendance is essential. Students are expected to attend all scheduled classes. However, if a student must miss a class due to military obligations or other unavoidable circumstances, every effort must be made by the student to obtain class notes and other material discussed. Communication with the instructor is vital and the student should notify the instructor of any anticipated absences. There are NO makeups for missed assignments or examinations unless the instructor is informed ahead of time. Attendance is taken only at the beginning of class.

HOMEWORK: All assignments must be turned in at the beginning of class on the due date. In the event of bonafide duty-related absence on the due date, arrangements must be made with the instructor in advance. Homework is not accepted late.

PLAGIARISM POLICY: Plagiarism is defined: to steal or use the ideas or writings of another as one's own. This may be avoided in most instances by giving credit/recognition to the original author. The University of Maryland, Asian Division's standard plagiarism policy is: intentionally plagiarized papers, reports, or exams will receive an F or 0 (zero), whether copied whole or in part. Subsequent cases of plagiarism can result in failure in the course. Unintentional plagiarism - cases arising from student inexperience rather than deliberate deception can result in a lower grade on papers than they might otherwise deserve and in mandatory rewriting.

MISCELLANEOUS: Students will be required to use a computer and associated software to complete course assignments. Software unique to the course will be introduced in class. However, students will be expected to make a determined effort to learn to use course unique programs on their own.

HAND PHONES, BEEPERS: Are to be tuned off before class begins. Emergency personnel should set their devices to a setting that will not disturb the class.

OUTLINE

Schedule is subject to change, however all subjects will be covered.