SCMP 118 - Introduction to Programming in C++

Spring 2017: 1:10-2:30 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: 10-11 M-F
• Phone: (740) 427-5369
• Textbook: Problem Solving with C++ 8th ed, by Walter Savitch.
• Room and Time: Hayes 311, 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

• Juviand Rivera and Anna Gerhardinger
• Tutoring schedule: Sunday and Tuesday evening from 7:00-9:00 pm in Hayes 311.

Resources

• NetBeans - The Integrated Development Enviornment (IDE) we will be using.
• ideone - Web interface allows you to write and text code anywhere, from any machine, online. You must select C++.
• CodePad - Another web interface to programming in C++.
• Team Selector - Students
• Dealing with character data for a numeric input
• C++ Coding Style Standards
• How to print bold from C++
• BlackJack Applet
• Algorithms visualization
• Data Structures Visualization

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 labe is required, and counts for 15% of your grade.

• Codelab Registration Instructions

Assignments

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: 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 (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

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
Jan 17	Chapter 1 - Introduction to Computers and C++ Programming. Our Computing Environment. Trying C++, using CodeLab	Netbeans First Program	CodeDay1		Ch1.ppt
Jan 18	Evening (7:00) in Hayes 311. Help installing Netbeans on your Laptop.
Jan 19	Chapter 1.3-1.4 and C++ Programming. Our Computing Environment.	Notes2 Hands on	Code2		Day2.pptx
Jan 24	Chapter 2.1-2.2 - C++ Basics (Variables, Assignments, I/O)	Notes3 Hands on	CodeDay3	Link	ch2-2.1-2.pptx	First Exercises, Data, Comments	Lab 0 Chapter 1
Jan 26	Chapter 2.2-2.5 - Data Types, Expressions, Flow Control, Style	Notes4 Hands on	CodeDay4	Link	ch2.3-5.ppt	Assignment, Input And Output, Integers, Other Expressions	1930s
Jan 31	Chapter 3.1-3.3 - Boolean Expressions, Branches, Loops	Notes5	CodeDay5	Link	ch2.3-5.ppt ch_03-1.ppt	Logical Expressions, Arithemetic Expressions, Branching Statements	Lab 1-1 Chapter 2
Feb 2	Chapter 3.3-3.4 - More on Loops	Notes5	CodeDay5	Link	ch_03.ppt	Techniques1, Conditionals, Loops, Constants	Lab 1-2 Chapter 2
Feb 7	Chapter 3.3-3.4 - More on Loops	Notes Quote	Code		ch_03-Part3.ppt		1940-1944
Feb 9	Chapter 4.1-4.2 - Introduction to Functions	Functions	Code1 Code2	Link	ch4.1-3.ppt ch_04.4-6.ppt
Feb 14	Chapter 4.3-4.6 - Procedural Abstraction, Local Variables, and Overloading Names.	Functions2 Hands On	Code	Link	ch_04.4-6.ppt	Functions, Type casting, Boolean Expressions, Multiway If-Else, Switch, Iteration	1945-1949 Lab 2 Chapter 3
Feb 16	Chapter 5.1-5.3 - void Functions, Call-By-Referance, Procedural Abstraction	Hands On	Code	link	CH_5.1-3.ppt CH_5.4.ppt	Void functions, Call-By-Referance	1950-1954
Feb 21	Chapter 5.3-5.5 - Procedural Abstraction, debugging	Creating random numbers Hands On Quote			CH_5.4.ppt		Lab 3 Chapter 4
Feb 23	Chapter 7.1-7.3 - Arrays, Arrays with Functions	Hands On	Code	link	Ch7.1-4.ppt	Random	Lab 4-1 Chapter 5
Feb 28	Chapter 7.1-7.3 - Arrays, Arrays with Functions	Hands On	Code		Ch7.1-4.ppt	Arrays	Lab 4-2 Chapter 5
Mar 2	Midterm Exam			Link
	Midterm Break
Mar 21	Chapter 7.3-7.4 - Programming with Arrays, sorting, Multidimensional Arrays		Code		Ch7.1-4.ppt	Array Techniques	Lab 5 Chapter 7 1955-1959
Mar 23	Guest Speaker Ashleigh Zarley (ITS), Lab work	StringNotes1	Code		Ch8.1-2.ppt
Mar 28	Multidimensional Arrays - Tick Tack Toe Chapter 8.1, 8.2 - C-Strings and String class		Code		Ch7.4.ppt Ch8.1-2.ppt		1960-1964 Lab 6 Chapter 7
Mar 30	Chapter 8.2 - String class		Code	Link		Strings	1965-1969
Apr 4	Chapter 8.3,10.1 Vectors	StructNotes C++ string reference	Code	Link	Ch8-3.ppt	Vectors
Apr 6	Chapter 10.2 - Intro to Object Oriented Concepts, structures	ClassNotes1	Code		IntroObjectsc.ppt	OOP	Lab 7 Chapter 7 1970-1974
Apr 11	Chapter 10.2, 10.3, Classes,		Code		Ch_10_2-3.ppt	Class Definitions	1975-1979
Apr 13	Chapter 10.3, 6.1, 6.2 - ADT's, File I/O		Code		Ch_06.1-3.ppt	File I/O	Lab 8 Chapter 8
Apr 18	Chapter 6.2, 6.3 - Character I/O, Array's with Classes	Classes Tutorial			Ch_06.1-3.ppt		1980-1984
Apr 20	Chapter 11.1,11.2,11.3 - Friend Functions, Overloading	Shakespeare in class start activity	Code	Link	ch_11.ppt		Lab 9 Chapter 10
Apr 25	Chapter 11.2, 11.3 - Arrays and Classes, Dynamic Arrays		Code		ch_11.ppt		1985-1989 Extra Credit Tick Tack Toe
Apr 27	Chapter 12.1 Friend Functions, Overloading, inheritance	In Class Activity	Code	Link	ch_12.ppt		1990-1994
May 2	Chapter 14.1, 14.2 - Recursion, The Binary Search Algorithm	Factorial, Binary Seach, Binary/Linear Compare, Sorting, Merge Sort	Code, Merge Sort	Link	ch14.ppt		1995-1999
May 4	Towers of Hanoi - Example,	Program	Code		ch14.ppt	Recursion	2000-2010 Final Project
May 12	Final Exam: Monday, May 12 at 8:30 a.m.

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.

Disabilities

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: http://www.kenyon.edu/directories/offices-services/title-ix/policy/.

SCMP11801S17@kenyon.edu

• ch2-2.1-2.pptx: ch2-2.1-2.pptx

• ch2.3-5.ppt: ch2.3-5.ppt

• ch_03-1.ppt: ch_03-1.ppt

• : ch_03-Part3.ppt

• ch_04.4-6.ppt: ch_04.4-6.ppt

• ch_03-Part3.ppt: ch_03-Part3.ppt

• CH_5.1-3.ppt: CH_5.1-3.ppt

• ch_04.4-6.ppt: ch_04.4-6.ppt

• CH_5.1-3.ppt: CH_5.1-3.ppt

• CH_5.4.ppt: CH_5.4.ppt

• Ch7.1-4.ppt: Ch7.1-4.ppt