SYLLABUS for CMPSC 101 Spring COURSE OVERVIEW: Text: Starting Out with C++ from Control Structures to Objects - 8th Ed, by Tony Gaddis.

Transcription

1 SYLLABUS for CMPSC 101 Spring 2015 Instructor: Maurin Lopez. Office: 270 Hawthrn Electronic-Mail ID: Bulletin Board: Office Hours TU 9:45 10: HAWTHRN Class Meets TU, TH 10:50 12:05P 259 HAWTHRN COURSE OBJECTIVES: Introduction to computer programming and problem solving strategies using structured design techniques (modular pseudocode and development in the C++ programming language). This course is commonly called CS1, Introduction to Structured Programming with generic problems for all disciplines. At Penn State, CMPSC 101 satisfies 3 credits of a General Education Quantification Requirement (GQ) for most non-engineering majors. COURSE OVERVIEW: Text: Starting Out with C++ from Control Structures to Objects - 8th Ed, by Tony Gaddis. COURSE GRADING: 4 Major Assignments - 40 (10 points each) Exam 1 Theory - 10 points Exam1 Lab - 15 points Final Exam Theory - 10 points Final Exam Lab - 15 points Quiz - 10 points Final Grading Scale: A = ; A- = ; B+ = ; B = ; B- = ; C+ = ; C = ; D = ; below 60 = F. GRADE POLICY: Lab work, programming problems, and written exams have scheduled deadlines. Students missing a scheduled deadline will forfeit 1/3 of the points for each day 2 an assignment is not submitted. After 3 days of missing a deadline, no points will be given. Deadlines may occur at start or end of lab time. Submission time is recorded when a student successfully posts his/her assignment to the designated ANGEL drop box. If a student posts an assignment after the deadline of the first day and before lab time on the second day, the assignment is automatically reduced in points by 1/3; after the deadline of the second day and before lab time on the third day, the assignment is automatically reduced in points by 2/3; after the deadline of the third day, no points will be given and the drop box is officially closed. Each student is limited to one posting per assignment. There will be plenty of opportunities to practice the necessary skills for mastery of submissions before the

2 deadlines. Ordinarily, a five- minute warning is given prior to a deadline. Only an Angel Mail posted in the instructor s mailbox prior to a deadline will be considered for an omission. Qualitatively, points will be lost for assignments that are not designed and implemented to specifications. Therefore, your course grading will be based emphatically on timeliness of your production and fulfillment of exact programing specifications. CLASS ATTENDANCE: Required. Computer demonstrations of problem solving occur in lab via large screen display. Programming assignments are introduced by the instructor with student engaged discussion about detailed specifications that culminate in partial solutions which may be used by students for lab projects. Students not in lab for discussion of programming specifications are individually responsible for the material missed. Deadlines for assignments and design specifications are principal rubrics for course grading and may be adjusted in lab as the problem discussion warrants. Students should read the assigned material before lab (RE: textbook and Angel Weekly Postings) and have the previous and current lab assignments on individual flash drives or PASS space. (Such that, you are expected to contribute/participate in the current algorithm design/development during the discussion at lab time as part of your daily laboratory assignment, which means, no participation points if no current algorithm). COURSE ETHICS: Students are responsible for completing individual assignments on your computing devices. You may not use, have in your possession, or loan another's device. (Back-up of your work is required, preferably stored on ITS PASS Space, but a flash drive or use of ANGEL mail is acceptable.) Students using work or claiming work of others is unethical and a form of plagiarism. Working with others or receipt of assistance must be cited in the documentation of programs, specifically at the beginning of the file comment lines of your project module. Any use of design or code from classmates, tutors, friends, textbook references, web references, etc., must be documented. Unethical practices are addressed in Altoona College s and Computer Science Department s Policies. See also PSU Course Policies provided later. Sample documentation of programs with receipt of assistance follows: //Programmer: Instructor //Date Due: 1/17/12 //Page 77 Program Challenge 6. Annual Pay--as Lab3.zip assignment. //Assistance with cout statements provided by Rob the tutor on 1/15/12. DUE DATES: Programming Problems and Exams will have scheduled due dates which are announced on ANGEL; a tentative schedule is listed in this document (see Tentative Schedule). The instructor reserves the right to adjust the due dates when situations necessitate. On the due date, a deadline is required for the submission of the assignment to an ANGEL folder. The time for the deadline will generally be the end of lab time, with a 5-minute warning announcement given by the instructor before the pending deadline. Grading may only occur when the assignment is posted to an official ANGEL folder called a DROP BOX. Assignments are not to be mailed to the instructor s ANGEL MAILBOX for submission. The best strategy to follow when submitting an assignment is to honor the deadline with at least some form of program that executes. A program that minimally executes and meets the deadline will normally provide the student with the highest grade points. If one misses the deadline but satisfies all of the programming requirements, there is an automatic late

3 submission reduction of 1/3 points. Note that your course work will be based primarily on two important things: 1. The quality of your work (program executes as specified); and 2. How well you meet deadlines. All college students profess to do great work, but may be lax about deadlines (E.G., professor, my submission was only 2-minutes pass the deadline!). Remember that your course grade will focus on both great work and meeting deadlines. OVERVIEW OF ASSIGNMENTS: Programming Problems and Exams are conducted in the computing lab. Seventy minutes are typically the maximum time available for graded assignments. An individual must have minimally input and output of his/her program executing to receive satisfactory credit. That is, at least the user interface between the client and the software program must be executable by the file named labx.exe to be considered successful. [If a labx.exe file is missing from the labx.zip file posted to the drop box, then that means there was no error-free code production. Thus no labx.exe results in unsatisfactory performance on a problem.] Practice is essential during lab work to develop a step-by-step, instruction-by-instruction testing strategy to guarantee successful execution under problem solving conditions. Your instructor advocates during his/her sample solutions in lab a one construct methodology of designing, compiling, debugging, executing, and testing program code which guarantees a student the ability to create an executable file if the method is mastered and used during assignments. Of course there are other problem solving methods such as brut force or trial-and-error, but there are no guarantees that ill-conceived habits of one s choosing will meet a deadline with an executable. As for the written exams, they are designed to test your knowledge of the programming constructs core to any computing environment. These constructs cover variables, data types, storage formats, input and output formats, decision structures, looping structures, functions, parameters, compound data types, and files. Practice questions for written exam problems may be found in the textbook under the Review Questions and/or Exercises sections. Exam problems may be administered with short answers, fill in the blanks, multiple choices, true/false, logical analyses, and syntax error recognition to name a few. ACCESSORIES: A minimum of 1 flash drive is required to save your work. Other media such as your PASS space provided by its.psu.edu may be substituted for your flash drive, but be aware that your PASS space or ANGEL may not always be available so a personal flash drive will be your most reliable storage resource in the PC lab. The internal and external labels of your personal flash drive should contain your last name for identification purposes. Occasionally, hurried students departing the lab have often left flash drives in usb ports of lab computers that were not easily returned by finders. EXPECTATIONS: Each student should read the ANGEL Weekly Postings and text before attending lab. Lab assignments and problems will accentuate the Postings. Attend all labs, and record design strategies/solutions to problems that are introduced in lab. These designs will be derived in a top-down manner and they will be presented collaboratively. Instructor uses the Problem-Based Learning strategy (PBL) that seeks individual contributions to problem solving, not solely instructor dictation. Do not expect a line-by-line solution to be written on the board for you to copy. Do not expect the solution to be C++ code only. PBL suggests that you be given a written problem statement and enough constructive information so that when you leave the lab you are expected to analyze and construct an algorithm of your own solution to a similar problem outside of lab. In lab, you will need to compile and build your program (and verify that it works correctly).

4 Your instructor will give you test data to execute so that your output will conform to required specifications. After each lab we recommend at least 2.5 hours of (practical) work to master your computing skills. To succeed in this course, you should build your own algorithm for each problem similar to those introduced in lab and understand how it works. To perform a step-by-step hand-calculation of your design/algorithm is recommended before coding. Programming/coding will translate from your correct algorithm, with the use of the one construct methodology and your textbook as a programming language reference manual for C++ syntax rules and examples of error-free coding techniques. Any and all refinements to your initial algorithm and program will be based on your understanding of the subject material(i.e., your tool to success). You should not rely on your friends, classmates, tutors, etc. toassist you throughout the semester. Once in awhile it may be necessary to minimize the time that it takes you to solve your problem by asking for and seeking assistance. When and if the need arises to seek help or render assistance, be sure to cite the person with whom you worked. Remember, you are responsible for academic integrity at the university; while the instructor is responsible for enforcing the university s code of conduct. Schedule CMPSC 101 Spring 2015 CMPSC 101 TENTATIVE COURSE OUTLINE Week Date Topics to be Covered Assignments 0 TU - Jan 13 Syllabus, course presentation TH - Jan 15 Introduction Computing Skills 1 TU - Jan 20 Programing is both art and a science TH - Jan 22 Code Blocks 2 TU - Jan 27 Edit/Compile/Execute TH - Jan 29 C++ program & COUT 3 TU - Feb 03 Programing Challenges Interactivity & CIN ASSIG-1 TH - Feb 05 If/else 4 TU - Feb 10 Braces{block of statements} input validations TH - Feb 12 Relational Operators 5 TU - Feb 17 Relational expressions TH - Feb 19 Logical operators ASSIG-2 6 TU - Feb 24 Braces{block of statements} while loop TH - Feb 26 For Statement 7 TU - Mar 03 While Statement TH - Mar 05 Exam 1 - Theory 8 TU - Mar 10 Spring Break TH - Mar 12 Spring Break 9 TU - Mar 17 Exam 1 - Lab

5 TH - Mar 19 Switch Statement 10 TU - Mar 24 Do-While statement ASSIG-3 TH - Mar 26 Go to Statement 11 TU - Mar 31 Modular Programing Defining Functions TH - Apr 02 Function Arguments Calling & Returning 12 TU - Apr 07 Pass by Value, Pass by Reference TH - Apr 09 Returning a value from a function 13 TU - Apr 14 Functions w/ Menu-Driven Stubs and Drivers TH - Apr 16 C++ Arrays List of elements ASSIG-4 14 TU - Apr 21 C String Arrays TH - Apr 23 C++ String class 15 TU - Apr 28 Members Functions of String class TH - Apr 30 Overview of Important concepts 16 WED - May 6 Final Exam Lab