CS 1336 Section 002 Programming Fundamentals Syllabus

Instructor: Office: Office hours: Telephone: Email: TA: Office: Office hours: Email: Laurie Thompson ECSS 3.610 Tuesday 11:00am. – 12:00pm. & Friday 11:30am. – 1:30pm. (972) 883-4839 Laurie.Thompson@utdallas.edu Hui Li ECSS 3.405 Wednesday 4:00pm. – 6:00pm. & Thursday 5:00pm. – 6:00pm. in ECSS 4.623 Hui.Li@student.utdallas.edu

Corequisite: CS 1136 Textbook: Materials: Standard Version of Starting Out with C++ 4th Edition 2005 Update by Tony Gaddis. Homework assignments, programming assignments, and other materials will be available at webct.utdallas.edu. 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

Grading:

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
Reading Assignment Due Chapter 1 Text Chapter 2 Text Chapter 3 Text

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

Chapter 4 Text

Chapter 5 Text

Chapter 3 Section 3.14, Chapter 5 Section 5.7, Chapter 12 Sections 12.1-12.6 Chapter 6

Chapter 7 Text

Chapter 8 Text

Chapter 9 Text Chapter 10 Sections 10.1-10.6

Page 2 of 2

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master Your Semester with a Special Offer from Scribd & The New York Times

Cancel anytime.