CS 1336 Section 002 Programming Fundamentals Syllabus

Instructor: Laurie Thompson Office: ECSS 3.610 Office Hours: Tuesday & Thursday 9:30am. – 11:30am. Telephone: (972) 883-4839 Email: Laurie.Thompson@utdallas.edu TA: Office: Office Hours: Email: Yanyan Zeng ECSS 4.703 Monday & Friday 1:00pm. – 3:00pm. in ECSS 4.623 yxz052000@utdallas.edu

Corequisite : CS 1136 Textbook: Materials : Grading: Standard Version of Starting Out with C++ 4th Edition 2005 Update by Tony Gaddis. Homework assignments, programming assignments, and homework solutions will be available at webct.utdallas.edu. Homework assignments & unannounced quizzes – 10% Lecture attendance – 5% Programming projects – 20% Exam #1 – 20% September 30, 2005 Exam #2 – 20% November 4, 2005 Final Exam – 25% December 2, 2005, 5:00pm. – 7:00pm. 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. Late programming projects and homework 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. You must bring a photo ID to examinations. There will be assigned seating for examinations. All exams are open book and open notes. PDAs, computers, cell phones, and backpacks will not be allowed at desks during 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: • • • • • • • • • • • • Tentative Schedule:
Date August 19 August 22 August 24 August 26 August 29 August 31 September 2 September 7 September 9 September 12 September 14 September 16 September 19 September 21 September 23 September 26 September 28 September 30 October 3 October 5 October 7 October 10 October 12 October 14 October 17 October 19 October 21 October 24 October 26 October 28 October 31 November 2 November 4 November 7 November 9 November 11 November 14 November 16 November 18 November 21 November 23 November 28 December 2 Class Material Review of syllabus & Intro. to Programming Intro. to Programming Intro. to C++ Intro. to C++ Cont'd 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 Intro. to File Input & Output Intro. to File Input & Output Cont'd Making Decisions Making Decisions Cont'd Making Decisions Cont'd Making Decisions Cont'd Looping & Review Exam #1 Looping Looping Cont'd Looping Cont'd Looping Cont'd Functions Functions Cont’d Functions Cont'd Functions Cont'd More File Operations Arrays Arrays Cont'd Arrays Cont'd Arrays Cont'd Arrays Cont'd & Review Exam #2 Searching Arrays Searching & Sorting Arrays Sorting Arrays Cont’d Pointers Pointers Cont’d Characters & Strings Characters & Strings Cont'd Intro. to Structures Intro. to Structures & Review 5:00pm. – 7:00pm. Final Exam Reading Assignment Due Chapter 1 Text Chapter 2 Text

Develop algorithmic solutions for use on computers Express algorithmic solutions in a high level computer la nguage 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

Chapter 3 Text

Chapter 4 Text

Chapter 5 Text

Chapter 6 Text

Chapter 12 Sections 12.1-12.6 Chapter 7 Text

Chapter 8 Text

Chapter 9 Text Chapter 10 Sections 10.1-10.6 Chapter 11 Sections 11.1-11.10

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.