CS 1336 Section 002 Programming Fundamentals Syllabus

Instructor: Laurie Thompson

Office: ECSS 3.610
Office hours: Tuesday 11:00am. – 12:00pm. & Friday 11:30am. – 1:30pm.
Telephone: (972) 883-4839
Email: Laurie.Thompson@utdallas.edu

TA: Hui Li
Office: ECSS 3.405
Office hours: Wednesday 4:00pm. – 6:00pm. & Thursday 5:00pm. – 6:00pm. in ECSS 4.623
Email: Hui.Li@student.utdallas.edu

Corequisite: CS 1136

Textbook: Standard Version of Starting Out with C++ 4th Edition 2005 Update by Tony Gaddis.

Materials: Homework assignments, programming assignments, and other materials will be available at
webct.utdallas.edu.

Grading: Homework assignments & unannounced quizzes – 10%

Lecture attendance – 5%
Programming projects – 20%
Exam #1 – 20% February 22, 2006
Exam #2 – 20% April 5, 2006
Final Exam – 25% April 28 2006, 5:00pm. – 7:00pm.

According to the university catalog a grade of C or better in CS 1336 is a prerequisite for CS

1337.
An attendance sheet will be sent around the room each class. You will be considered absent if
you have not signed the attendance sheet by ten minutes after the scheduled start time of the class.
Each absence after the fourth will result in a loss of twenty points of the total 100 points allocated
for the lecture attendance grade. Note: If you have nine or more absences your grade for lecture
attendance is zero. Excuses for absences are not necessary. You have four free absences to be
used at your discretion.
Late assignments will not be accepted.
The instructor reserves the right to give unannounced quizzes. Each quiz will count as a
homework grade. There are no make-ups for missed quizzes.
There will be assigned seating for examinations. All exams are open book and open notes.
PDAs, computers, cell phones, other electronic devices, and backpacks will not be allowed at
desks during examinations. You must bring a photo ID to examinations.
The final exam is comprehensive.
Make up examinations will be administered only for well-documented emergencies. A student
must make every attempt possible, via telephone and email, to notify the instructor that he/she
will miss the exam prior to the examination date and time.

Scholastic
Dishonesty: Incidence of scholastic dishonesty will be handled according to university regulations.

Scholastic dishonesty includes, but is not limited to: copying assignments, giving your work to
another to be copied, looking at another students paper during the examination, using
unauthorized materials during examination, giving students in subsequent sections test or quiz
questions, handing in another persons work as your own, having someone else take an
examination for you, and changing a graded paper and requesting that it be regraded.
Page 1 of 2
Objectives: To develop the student’s abilities to:

• Develop algorithmic solutions for use on computers

• Express algorithmic solutions in a high level computer language
• Use programming tools such as an editor, compiler, and linker
• Utilize fundamental programming structures - linear processing
• Utilize fundamental programming structures - conditional processing
• Utilize fundamental programming structures - loop processing
• Process data in arrays
• Develop programs in a functional/method form
• Perform searches and sorts
• Utilize reference variables
• Manipulate character and string data
• Perform sequential file input and output

Tentative Schedule:
Date Class Material Reading Assignment Due
January 9 Review of syllabus & Intro. to Programming
January 11 Intro. to Programming Chapter 1 Text
January 13 Intro. to Programming
January 18 Intro. to C++ Chapter 2 Text
January 20 Intro. to C++ Cont'd
January 23 Intro. to C++ Cont’d
January 25 Expressions & Interactivity Chapter 3 Text
January 27 Expressions & Interactivity Cont'd
January 30 Expressions & Interactivity Cont'd
February 1 Expressions & Interactivity Cont'd
February 3 Expressions & Interactivity Cont'd
February 6 Making Decisions Chapter 4 Text
February 8 Making Decisions
February 10 Making Decisions Cont'd
February 13 Making Decisions Cont'd
February 15 Making Decisions Cont'd
February 17 Looping Chapter 5 Text
February 20 Looping & Review
February 22 Exam #1
February 24 Looping Cont'd
February 27 Looping Cont'd
March 1 Looping Cont'd
March 3 Intro. to File Input Chapter 3 Section 3.14, Chapter 5 Section 5.7, Chapter 12
Sections 12.1-12.6
March 13 Intro. to File Output
March 15 Functions Chapter 6
March 17 Functions Cont'd
March 20 Functions Cont’d
March 22 Functions Cont’d
March 24 Arrays Chapter 7 Text
March 27 Arrays Cont'd
March 29 Arrays Cont'd
March 31 Arrays Cont'd
April 3 Searching Arrays & Review Chapter 8 Text
April 5 Exam #2
April 7 Searching & Sorting Arrays
April 10 Sorting Arrays Cont’d
April 12 Pointers Chapter 9 Text
April 14 Pointers Cont’d
April 17 Pointers Cont’d
April 19 Characters Chapter 10 Sections 10.1-10.6
April 21 Strings
April 24 Review
April 28 5:00pm. – 7:00pm. Final Exam

Page 2 of 2