CS1410 Introduction to Computer Science with C

CS1410 Introduction to Computer Scie= nce with C++

Fall 2008 (CRN: 10843 Classroom: N-702 Class Times: 1:00pm – 2:45pm MW)<= /span>

CATALOG DESCRIPTION: This course is designed as a first course for majors in= Computer and Mathematical Sciences. It covers history, nature and uses of the comput= er, algorithms, number systems, information representation, and organization, w= ith an overview of computer hardware and software, computing systems and major applications. An introduction to high-level languages with an emphasis on writing programs in C++. Topics include control statements, subprograms, da= ta types, arrays, and an introduction to records and streams. Closed (supervis= ed) laboratories are conducted throughout the proceeding of the course. Program= ming platform is Windows Visual C++.

PREREQUISITE: Credit= or enrollment in MATH 1404 or MATH 1306 or MATH 1505; and placement in ENG 130= 1 or above.

LEARNING OUTCOMES: At the completion of the course, the student should be able to:

1.	understand syntax vs. semantics, rules for identifiers, standard data types, variabl= es and constants, rules for constants, named constants, assignment statement= s, types of operators, standard stream output with the insertion operator, comments, block statements, and introduction to compiler directives.=
2.	perform arithmetic expression evaluation, operator precedence, type coercion and casting, mixed type expressions, function calls and actual parameters, st= andard function libraries, value-returning functions vs. procedures, formatting output and stream manipulators.
3.	understand standard stream input with the extraction operator, the new line character and the get function, the ignore function, interactive I/O, file I/O, elements of top-down design, pseudo-code, implementing a top-do= wn design, and documentation.
4.	perform Boolean expression evaluation, relational operators, Boolean operators, <= i>if-then-else statements, nested if-then-else statements, stream I/O error-check= ing, pre and post conditions in modular design; test control structures, and t= race code execution.
5.	design the while loops, categories of loops, major components of loops, a= nd test loops comprehensively.
6.	know how to use the switch statements, do-while loops, for loops, break and continue statements.
7.	understand user-defined functions and modular design, void functions, actual and for= mal parameters, value vs. reference parameters, local variables, function prototypes vs. function definitions, function pre and post conditions, and the assert function.
8.	distinguish the difference between global and local identifiers, understand scope rul= es, function interface design and side effects, value-returning functions, stubs and driver.
9.	understand simple data types, specialized operators, external vs. internal representation of data, user-defined data types and the enum keywo= rd, named vs. anonymous data types, details of type coercion, and user-written header files.

TEXTBOOK: Programming and Problem solving with C++, by N. Dale, C. Weems and M. Headington, 4^rd Edition, Jones and Barlett Publishers, Inc.

METHOD OF EVALUATION:

Course grade: The course average is determined by two major tests, and a comprehensive final exam, several major programming projects which thoroughly cover all required topics, and graded= lab assignments or in-class exercises at the instructor's discretion. The course grade is determined by the standard college formula based on the course average: "A" (90 100), "B" (80-89), "C" (70-7= 9), "D" (60 69), or "F' (0-59). Major tests must include an in-class, close book component that comprises a majority of the test score. Test dates are announced in the course schedule. The student must have a passing average (60+) on both test and programming projects to pass this course, otherwise he or she should receive at best a "D".

Grading Scale: There will be two in-c= lass exams (20% each), and a comprehensive final exam (30%). Programming projects (15%), labs and in-class exercises (15%).

A -- 90 above, B -- 80-= 89, C -- 70-79, D -- 60-69, F -- below 60

Programming projects: <= /span>One of the key objectiv= es of this course is to help the students to understand the modern program= ming concepts and basic programming techniques, and to be able to use the knowle= dge and experience in upper-level courses, and solving application problems. Therefore, programming projects must be assigned throughout the semester. Laboratory sessions should be used for students to master simple required components of the course. Group projects are NOT permitted. Every student m= ust complete his/her own programming. If the instructor detects that a student = did not write the program on his/her own, but make a copy of other’s work= in any form, that student's score will be zero. Projects should be = turn in on due date. Exceptions can only be made for emergency cases. In any cas= es, late submission will entail grade penalty on 10 points per day basis (inclu= ding weekends); and no submission late more than 1 week will be accepted<= o:p>

COURSE CONTENT:

Topics w= ith suggested contact time allocation (38 lecture hrs + 4 hrs testing)=

1.

Chapter 1 - History, nature, and uses of the computer; overview of programming and problem-solving techniques; algorithms; categories of information and dig= ital representation; converting decimal numbers to binary and vice versa; high-level vs. machine languages; the purpose of compiling; major compone= nts of a computer and a computing system; application vs. system softw= are; the functions of an operating system (4 hrs)

2.

Chapter 2 - Elements of C++ programs; types of tokens; C++ program structure; syn= tax vs. semantics; rules for identifiers; standard data types; variabl= es and constants; rules for constants; named constants; assignment statement= s; introduction to operators; standard stream output with the insertion operator; comments; block statements, introduction to compiler directives= (5 hrs)

3.

Chapter 3 - Arithmetic expressions; operator precedence; type coercion and castin= g; mixed type expressions; function calls and actual parameters; standard fu= nction libraries; value-returning functions vs. procedures; formatting output and stream manipulators (3 hrs)

4.

Chapter 4 - Standard stream input with the extraction operator; the newline chara= cter and the get function; the ignore function; interactive I/O; file I/O; elements of top-down design; pseudocode; implementing a top-down design; documentation (3 hrs)

5.

Chapter 5 - Boolean expressions and data; relational operators; boolean operators= ; if-else statements; nested if-else statements; stream I/O error-checki= ng; pre- and post-conditions in modular design; testing control structures; tracing code (3.5 hrs)

6.

Chapter 6 - while-loops; categories of loops; nested loops; major componen= ts of loops; testing loops comprehensively (3.5 hrs)

7.

Chapter 7 - User-defined functions and modular design; void functions; actual and formal parameters; value vs. reference parameters; local variables; funct= ion prototypes vs. function definitions; function pre- and post-conditions; t= he assert function (3 hrs)

8.

Chapter 8 - Global vs. local identifiers and scope rules; function interface desi= gn and side effects; value-returning functions; stubs and drivers (3 hrs)

9.

Chapter 9 - switch statements; do-while loops; for loops; break and continue statements; loop invariants (2 hrs)

10.

Chapter 10 - Simple data types; specialized operators; external vs. internal representation of data; user-defined data types and the enum keywo= rd; named vs. anonymous data types; details of type coercion; user-written header f= iles (2 hrs)

Laboratory content:
Lab number=

Title

Brief description

1
Introduction

Windows 95; using the lab software; the Borland C++ programming environment<= /o:p>

2
Data Representation

Demonstration and practice with encoding information in binary form: positive integers, characters, and simple graphics

3
Syntax/Expressions

Practice with C++ syntax (debugging code) and evaluating C++ arithmetic expressions

4
Input/Output

Practice with format manipulators and file I/O

5
Selection Statements<= o:p>

Activities involving the if-else statement, including boolean expressions and= nested statements

6
While-Loops

Practice with various types of while-loops

7
Alternative Controls<= o:p>

Activities involving the switch, for, and do-while statements

8
Functions<= /span>

Activities tracing and using predefined functions in code; explaining and demonstrat= ing parameter passing; implementing function prototypes based on pre- and post-conditions

9
Procedures=

Activities explaining and demonstrating variable parameters; practice writing proced= ures involving multiple files

Policies: Students are responsible for the materials assigned fr= om the book and the lecture notes. To pass this course a passing grade on both programming assignments and exams is required. No make up tests will be giv= en. You are expected to turn in your own work on time. Assignments submitted at= any later time without an approved excuse will not be accepted. In any circumstances, late submission will cause a loss of 10 points per day (including weekends), and no submission late more than 1 week will be accep= ted. All missed grades will be recorded as zero. It is up to you to determine the version of your assignment to be graded. You must weigh the late penalty against the completeness of your assignment.

Academic Dishonesty: For this class, all wor= k must be done individually -- no group work is allowed. You are encouraged to generally discuss assignments with fellow students, but may not copy their solution or code. Significant identicalness constitutes duplication. This includes but not be limited to: the main body of the programs are the same; only variable names are different; etc. Doing so constitutes academic dishonesty that will be sanctioned with a grade of F in the course.

General University Policies and Procedures= : All students are subjec= t to UH-Downtown's Academic Honesty Policy and to all other university-wide poli= cies and procedures as they are set forth in the UH-Downtown University Catalog = and Student Handbook. The Academic Honesty Code is embraced by all members of t= he University of Houston-Downtown academic communit= y and is an essential element of the institution’s academic credibility. The Honesty Code states "We will be honest in all our academic activities = and will not tolerate dishonesty." The purpose of the Academic Honesty Pol= icy is to deal with alleged violations of the Honesty Code in a fair and consis= tent manner. The policy is administered jointly by students and faculty. It is e= ach student's responsibility to read and understand the Academic Honesty Policy. It may be found in the Student Handbook.

STATEMENT ON REASONABLE ACCOMMODATIONS: UHD adheres to all appl= icable federal, state, and local laws, regulations, and guidelines with respect to providing reasonable accommodations for students with disabilities. Students with disabilities should be notified to register with Disab= led Student Services and contact the instructor in a timely manner to arrange f= or appropriate accommodations.

Instructor:

Dr. Hong Lin, Office: S-717, office phone: (713) 221 278= 1, email: linh@uhd.edu

web page: http://cms.uhd.edu/faculty/linh/courses/cs1410=

office hours: 3:00-4:30pm MW and 1:00-3:00pm TR

Course Schedule

This is the tentative course schedule. It will be updated during the proceeding of the course. You should check it regularly for the assignment due dates and exam dates. Although it= will be updated in the best effort, any conflicts should be resolved according to the announcements made in the class.

Week\Day=

Monday

Wednesday

1 <= /o:p>

8/25

C= hapter 1

Intro to Explorer and Visual Studio

8/27

C= hapter 1

Lab 1 – Task 2, 3

2 <= /o:p>

9/1

Labor Day Holiday

9/3

C= hapter 1

Lab 2 – Task 1

1^st Project H= andout: Case Study Follow-Up (pg 42) 2 & 6

3 <= /o:p>

9/8

Chapter 2

Lab 2 – Task 2

9/10

Chapter 2

Lab 3 – Task 1=

4

9/15

Hurricane Ike

9/17

Hurricane Ike

5 <= /o:p>

9/22

Chapter 3

Lab 3 – Task 2

9/24

Chapter 3

Lab 3 – Task 3

2nd Project Handout =

6 <= /o:p>

9/29

Review for the 1^st Exam

1st Project Due

10/1

1^{st Exam}

7

10/6

Chapter 4

Lab 4 – Task 1

10/8

Chapter 4

Lab 4 – Task 2, 3

8

10/13

Chapter 5

Lab on logical expression

10/15

Chapter 5

Lab 5 – Task 1

9

10/20

Chapter 5

Lab 5 – Task 2 & 3

2^nd Project Due=

3^rd Project Handout: p246 - 3

10/22

Chapter 6

Lab 6 – Task 1

10<= /o:p>

10/27

Chapter 6

Lab 6 – Task 2

10/29

Review for the 2^nd Exam

11<= /o:p>

11/3

2^{nd Exam}

11/5

Chapter 9

Lab7 – Task 1

12<= /o:p>

11/10

Chapter 9

Lab 7 – Task 2

3^rd Project Due=

4^th Project Handout: p448 – 5&6=

11/12

Chapter 7

Lab 8 – Task 1

13<= /o:p>

11/17

No class

11/19

Chapter 7

Lab 8 – Task 2

14<= /o:p>

11/24

Chapter 8

Lab 9 – Task 1

11/26

No Class

15<= /o:p>

12/1

Chapter 8

Lab 9 – Task 2&3

4^th Project Due=

12/3

Review for the Final Exam

16<= /o:p>

12/8

No Class

12/10

Final Exam 1:00-3:30p= m

	Topics w= ith suggested contact time allocation (38 lecture hrs + 4 hrs testing)=
1.	Chapter 1 - History, nature, and uses of the computer; overview of programming and problem-solving techniques; algorithms; categories of information and dig= ital representation; converting decimal numbers to binary and vice versa; high-level vs. machine languages; the purpose of compiling; major compone= nts of a computer and a computing system; application vs. system softw= are; the functions of an operating system (4 hrs)
2.	Chapter 2 - Elements of C++ programs; types of tokens; C++ program structure; syn= tax vs. semantics; rules for identifiers; standard data types; variabl= es and constants; rules for constants; named constants; assignment statement= s; introduction to operators; standard stream output with the insertion operator; comments; block statements, introduction to compiler directives= (5 hrs)
3.	Chapter 3 - Arithmetic expressions; operator precedence; type coercion and castin= g; mixed type expressions; function calls and actual parameters; standard fu= nction libraries; value-returning functions vs. procedures; formatting output and stream manipulators (3 hrs)
4.	Chapter 4 - Standard stream input with the extraction operator; the newline chara= cter and the get function; the ignore function; interactive I/O; file I/O; elements of top-down design; pseudocode; implementing a top-down design; documentation (3 hrs)
5.	Chapter 5 - Boolean expressions and data; relational operators; boolean operators= ; if-else statements; nested if-else statements; stream I/O error-checki= ng; pre- and post-conditions in modular design; testing control structures; tracing code (3.5 hrs)
6.	Chapter 6 - while-loops; categories of loops; nested loops; major componen= ts of loops; testing loops comprehensively (3.5 hrs)
7.	Chapter 7 - User-defined functions and modular design; void functions; actual and formal parameters; value vs. reference parameters; local variables; funct= ion prototypes vs. function definitions; function pre- and post-conditions; t= he assert function (3 hrs)
8.	Chapter 8 - Global vs. local identifiers and scope rules; function interface desi= gn and side effects; value-returning functions; stubs and drivers (3 hrs)
9.	Chapter 9 - switch statements; do-while loops; for loops; break and continue statements; loop invariants (2 hrs)
10.	Chapter 10 - Simple data types; specialized operators; external vs. internal representation of data; user-defined data types and the enum keywo= rd; named vs. anonymous data types; details of type coercion; user-written header f= iles (2 hrs)