SCMP 118 - Introduction to Programming in C++

Fall 2017: Sections 01 and 02

Section 01: 9:40-11:00AM TH
Section 02: 1:10-2:30PM TH

Instructor: James Skon

This course presents an introduction to computer programming intended both for those who plan to take further courses in which a strong background in computation is desirable and for those who are interested in learning basic programming principles. The course will expose the student to a variety of applications where an algorithmic approach is natural and will include both numerical and non-numerical computation. The principles of program structure and style will be emphasized. Offered every semester.

Course Information

  • James Skon
  • Office Hayes Hall 303
  • Office Hours: 3-4 TH, 11-12 MWF
  • Phone: (740) 427-5369
  • Textbook: Problem Solving with C++ 8th, 9th, or 10th ed, by Walter Savitch.
  • Pearson.Problem.Solving.with.C.7th.Ed.Walter.Savitch.2009.pdf: Text_Book_Seventh_Ed
  • Room and Time: PRCL09, 9:40-11:00 and 1:10-2:30 Tuesday and Thursday
  • Paperless: This course is intentionally paperless. All assignments are turned in online through Moodle. The instructor will normally not accept work written or printed on paper. (Any exceptions must be pre-approved by the instructor).

Tutors and Graders

  • Tutors: Kara Braun and John Welhelm
  • Tutoring schedule: Hayes 311, Sunday 7-9pm and Wednesday 7-9pm
  • Graders: Miku Fukuyama and Nicky Ogilvie-Thompson


Code Lab

CodeLab is a tool that develops coding skills and understanding through coding exercises. The best way to learn to program is to program! Just like the best way to learn to play a sport is to play that sport. CodeLab assignments are NOT accepted late. Code lab is required, and counts for 15% of your grade.


Due Date: All assignments are due by midnight the day of due unless otherwise specified. There will be a 12 hour grace period during which the student will received a penalty equal to 5% of the value of the assignment; any assignments submitted more than 12 hours late will not be accepted. Exception: Each student may have a 24 hour extension on one lab and one history without penalty. This extension will be applied to the first assignment submitted outside the grace period (or retroactively used to cancel one grace-period penalty if not used by the end of the semester.)

Missing Lab Assignments: Labs are an important part of this class; the effort spent on them is a crucial part of the learning process. Failure to submit labs is unacceptable: students earning 0s on two assignments cannot receive a grade higher than a B- for the course; students earning three 0s will receive an automatic F for the course.

Collaboration and Academic: In order to facilitate learning, students are encouraged to discuss assignments amongst themselves. Copying a solution is not, however, the same as “discussing.'' A good rule of thumb is the “cup of coffee'' rule. After discussing a problem, you should not take away any written record or notes of the discussion. Go have a cup of coffee or cocoa, and read the front page of the newspaper. If you can still re-create the problem solution afterward from memory, then you have learned something, and are not simply copying. (The “group problems” are exempt from this, as they are intended to be done together.)

Computer History Assignments: Once a week you will turn in a brief essay on some computer history fact from the Computer History Museum ( Timeline) (or other computer history source). One or two people people will be chosen each week to oraly describe what they found in 2 minutes at the beginning of class. I will ask for volunteers, but will cycle through everyone before I repeat anyone. The idea is give to us all an opportunity to explore the history of computer science, and to find something that interests each of us. Start by going to the computer history timeline, and for each assignment explore the requested years until you find something interesting. Then write up a 200-300 word essay about what you found, what you found compelling, and why you think it is significant. Write the essay in Moodle, and include a link to the item you found so it can be displayed while you share in class. These are due midnight before the day they will be presented (and appear in the calendar below). Late submissions will not be accepted on these assignments.

Course Grades

Category % Notes
History Essays 5% Equally distributed
Labs 45% Equally distributed
Quizzes 10% Equally distributed
Code Lab 15% All questions equal weight
Exams 25% Midterm 10%, Final 15%

Course Calendar

May be subject to change as course unfolds. Asways check here for latest update.

Date Required Reading Notes/Hands On/Links Code Samples Quiz Slides CodeLab Assignment Due
Aug 24 Chapter 1 - Introduction to Computers and C++ Programming. Our Computing Environment. Trying C++, using CodeLab Netbeans First Program CodeDay1   Ch1.ppt    
Evening (7:00) in Hayes 311. Help installing Netbeans on your Laptop.            
Aug 29 Chapter 1.3-1.4 and C++ Programming. Our Computing Environment. Notes2 Hands on Code2   Day2.pptx    
Aug 31 Chapter 2.1-2.2 - C++ Basics (Variables, Assignments, I/O) Notes3 Hands on CodeDay3 Link 1 ch2-2.1-2.pptx 1. First Exercises,
Lab 0 Chapter 1
Lab 0 Sample Code
Sept 5 Chapter 2.2-2.5 - Data Types, Expressions, Flow Control, Style Notes4 Hands on CodeDay4 Link 2 ch2.3-5.ppt 2. Assignment,
Input And Output,
Other Expressions,
Sept 7 Chapter 3.1-3.3 - Boolean Expressions, Branches, Loops Notes5 CodeDay5 Link 3 ch2.3-5.ppt
3. Logical Expressions,
Arithemetic Expressions, Branching Statements
Lab 1-1 Chapter 2
Sept 12 Chapter 3.3-3.4 - More on Loops Notes5 CodeDay5   ch_03.ppt 4. Techniques1, Conditionals, Loops, Constants Lab 1-2 Chapter 2
Sept 14 Chapter 3.3-3.4 - More on Loops Notes Quote Code Link 4
Sept 19 Chapter 4.1-4.2 - Introduction to Functions Functions Code1 Code2 Link 5 ch4.1-3.ppt
Sept 21 Chapter 4.3-4.6 - Procedural Abstraction, Local Variables, and Overloading Names.
Chapter 5.1-5.3 - void Functions, Call-By-Referance, Procedural Abstraction
Functions2 Hands On
Hands On



5. Functions,
Type casting, Boolean Expressions, Multiway If-Else, Switch, Iteration


Lab 2 Chapter 3

Sept 26 Chapter 7.1-7.3 - Arrays, Arrays with Functions Creating random numbers Hands On Quote   Link 6 CH_5.4.ppt Ch7.1-4.ppt 6. Void functions, Call-By-Referance 1950-1954
Sept 28 Chapter 7.3-7.4 - Programming with Arrays Hands On Code Link 7 Ch7.1-4.ppt   Lab 3 Chapter 4
Oct 3 Chapter 7.3-7.4 - Arrays, Arrays with Functions, sorting, Hands On   link 8   7. Random Lab 4-1 Chapter 5
Oct 5 Fall Break            
Oct 10 Chapter 7.4 - Multidimensional Arrays, - Tick Tack Toe Hands On Code   Ch7.1-4.ppt 8. Arrays Lab 4-2 Chapter 5
Oct 12 Midterm Exam            
Oct 17 Chapter 10.2 - Intro to Object Oriented Concepts, structures ClassNotes1 Code   IntroObjectsc.ppt 9. Array Techniques Lab 5 Chapter 7 1955-1959
Oct 19 Chapter 10.2, 10.3, Classes, Friend Functions Classes Tutorial Code   Ch_10_2-3.ppt    
Oct 24 Chapter 10.3 - ADT's, Separate Compilation Hands On Code(Friend Example) Link 9 ch_12.ppt   1960-1964
Lab 6 Chapter 7
Oct 26 Chapter 8.1, 8.2 - C-Strings and String class StringNotes1
Hands On
Code Code   Ch8.1-2.ppt 10. Strings 1965-1969
Oct 31 Chapter 8.3,10.1 Vectors Hands On
C++ string reference
Code Link 10 Ch8-3.ppt    
Nov 2 Chapter 8.3,10.1 Vectors Hands On Vector and String Example Link 11     Lab 7 Chapter 7
Nov 7 Start Fractions Lab, C++ file I/O Classes Tutorial, In Class Activity, Solution Code(Friend Example)     11. Vectors 1975-1979
Nov 9 Files - input and output Hands On - Poetry Fun
, Code
12. OOP Lab 8 Chapter 8
Nov 14 Classes, Card Game, Intro to GitHub Blackjack start on GitHub     GitHubIntro.pptx 13. Class Definitions 1980-1984
Nov 16 Graphing Emily Dickinson (Files, classes, Vectors) Emily Dickinson Part 1 Code   ch_11.ppt 14. File I/O  
Nov 18-25 Thanksgiving Break            
Nov 28 Chapter 6.1 6.2, 6.3 - File I/O, Character I/O, Array's with Classes Shakespeare in class start activity Code, ShakespeareDemo   Ch_06.1-3.ppt


Lab 9 Chapter 10

Nov 30 Chapter 14 Recursion Hands On, Factorial, Reversing a string Recursion in graphics  
Dec 5 Chapter 14 Recursion, sorting with recursion Merge Sort Code, CodeComplete   ch14.ppt

  Extra Credit Tick Tack Toe
Dec 7 Chapter 14 - Recursion Binary Seach , Binary/Linear Compare , Sorting ,
Towers of Hanio
Link ch14.ppt 15. Recursion 2000-2010 Final Project
Dec 11 Final Exam for Section 02:
Mon, Dec 11 at 6:30-9:30 pm
Dec 12 Final Exam for Section 01:
Tues, Dec 12 at 6:30-9:30 pm
Assignments are due by midnight of the day due.

Academic Honesty

Any work you submit for credit in this course must result directly from your own understanding. Moreover, written work must be a creation of your own hand. Presenting the work of others as your own is strictly prohibited. At Kenyon we expect all students, at all times, to submit work that represents standards of academic integrity. It is the responsibility of each student to learn and practice the proper ways of documenting and acknowledging those whose ideas and words you have drawn upon (see Academic Honesty and Questions of Plagiarism in the Course Catalog). Ignorance and carelessness are not excuses for academic dishonesty. If you are uncertain about the expectations for academic honesty in this class, please ask for clarification.

It is likely that proof, algorithm and code solutions for most problems exist online. Generally you should not search for any of these solutions. If you do use online or written documents, you must fully disclose and reference everything used, and be prepared to lose some credit if the help is deemed to be beyond that which you should used. The rule of thump is you can use references to help understand the problems and terminology, but should not use (and copy or modify) complete or partial solutions found online.

If you use online resources, up to and including the use of code found on the internet, and do not disclose it, you will be subject to AIB notification.


If you have any disability and therefore may have need for some type of accommodation in order to participate fully in this class, please feel free to discuss your concerns in private with Erin Salva, Coordinator of Disability Services (phone 5145).

Statement on Title XI
Kenyon College seeks to provide an environment that is free of gender bias, discrimination, andharassment. If you have been the victim of sexual harassment/misconduct/assault, interpersonal violence, or stalking we encourage you to report this. If you report this to a faculty member, she or he must notify Kenyon's Title IX coordinator of any information about the incident that you provide. Kenyon College's Title IX and VAWA Policy is available at:

Topic attachments
I Attachment History Action SizeSorted ascending Date Who Comment
Texttxt EmilyDickinson1.txt r1 manage 51.9 K 2017-11-09 - 13:40 JimSkon  
PowerPointppt ch4.1-3.ppt r1 manage 445.0 K 2017-09-19 - 14:22 JimSkon  
PowerPointppt CH_5.4.ppt r1 manage 855.0 K 2017-09-26 - 13:32 JimSkon  
PowerPointppt CH_5.1-3.ppt r1 manage 1342.5 K 2017-09-21 - 13:28 JimSkon  
PowerPointppt ch_03-Part3.ppt r1 manage 1838.5 K 2017-09-14 - 13:31 JimSkon  
PowerPointppt Ch7.1-4.ppt r1 manage 2978.5 K 2017-09-26 - 13:32 JimSkon  
PowerPointppt ch_04.4-6.ppt r1 manage 3007.5 K 2017-09-21 - 13:28 JimSkon  
PowerPointpptx GitHubIntro.pptx r1 manage 4253.6 K 2017-11-14 - 14:33 JimSkon  
PowerPointppt Ch8.1-2.ppt r1 manage 4732.5 K 2017-10-31 - 12:53 JimSkon  
PDFpdf Pearson.Problem.Solving.with.C.7th.Ed.Walter.Savitch.2009.pdf r1 manage 6284.7 K 2017-08-30 - 00:33 JimSkon Text_Book_Seventh_Ed
PowerPointppt ch14.ppt r1 manage 6904.5 K 2017-11-30 - 14:24 JimSkon  
PowerPointppt Ch1.ppt r1 manage 38821.0 K 2017-08-23 - 19:06 JimSkon  
Edit | Attach | Watch | Print version | History: r48 < r47 < r46 < r45 < r44 | Backlinks | Raw View | Raw edit | More topic actions
Topic revision: r48 - 2017-12-05 - JimSkon
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2019 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback