1. Introduction to CptS 111 Adam Carter

2. Meet your instructor Adam Carter "PhD Candidate" (ABD) Feel free to call me: – Adam (preferred) – Professor Carter – Mr. Carter – Doctor isn't technically correct yet! Email: mail@adam-carter.com Office: Sloan 320 See syllabus for office hours

3. Course Website Currently at http://adamcarter.com/teaching/fa2015/cpts 111. Can also just go to http://adamcarter.comhttp://adamcarter.com LMS in flux, might move content later on

4. Course Materials Python 3.4.x – Windows: https://www.python.org/ftp/python/3.4.3/python -3.4.3.msi – MacOS https://www.python.org/ftp/python/3.4.3/python -3.4.3-macosx10.6.pkg

5. Optional Development Enviornment (optional) Visual Stuido 2015 with Pytools – It’s free for students – VS is used CptS 121, 122, and 223. Good to practice now if you have the time.

6. We will use iClickers in this class Available at the bookie. Also at Amazon and other places – http://www.amazon.com/I-Clicker-2- Iclicker/dp/1429280476

7. We use an "online" textbook for this class Register an account at http://zyante.comhttp://zyante.com Book code: WSUCptS111Fall2015 The Zyante book has lots of cool, interactive programming exercises. Even better, you get credit for just reading the book!

8. Grade breakdown Programming assignments & homework (35%)* Labs (15%) iClicker Participation (5%) Zyante homework and book reading (5%) Exam(s) (20%) Final exam (20%)

9. Final grade translations 93.00 – 100.00A65.00 – 69.99C 90.00 – 92.99A-60.00 – 64.99C- 87.00 – 89.99B+50.00 – 59.99D 80.00 – 86.99B00.00 – 49.99F 75.00 – 79.99B- 70.00 – 74.99C+

10. iClicker Participation Policy 5% of overall grade 100% for answering 80% of the questions presented in class 100% for answering at least 70% of the questions correctly

11. Zyante Reading Policy You get credit for reading the book (cool!) The calendar lists the deadline for completing specific chapters. To receive credit, you must have read 90% of the chapter by this point. Otherwise, no credit for that chapter.

12. Homework Policy All homework must be submitted by the due date; NO LATE TURN-INS! You have 50"bonus" points that can be applied to one or more assignments Students who submit their work on time may resubmit their homework directly to their TA up to three days after having received their grade. Student who resubmit have the opportunity to receive a better grade, up to a maximum of an A- (90%) on the assignment.

13. Lab Policy Students must completely finish the lab in order to receive credit for that lab. Students who do not finish the lab can show the lab to their TA the following week for full credit for the lab. Students who are unable to finish the lab the following week but remain in lab for the full duration will receive 50% lab points for the week. Students who do not finish the lab must remain in the lab for the full duration if they want to have the opportunity to turn the lab in at a later date for full or partial credit. A student who leaves early forfeits his or her ability to turn the lab in for credit at a later date. Students must be in the lab for at least 45 minutes regardless of whether or not they come to lab with the lab already completed. If the student comes to lab with the lab completed, he or she may work on homework, participate in OSBIDE, or be otherwise productive for 45 minutes. Students with valid excuses (e.g. car accident, sick, etc.) are exempt from these rules, but must provide sufficient evidence to the TA. What constitutes as sufficient evidence is left to the discretion of the individual TA.

14. Exam Policy I'm trying something new! FORMATIVE ASSESSMENT

15. A Note on Cheating Don't do it! See syllabus for lots of examples of what is and is not cheating.

16. Getting to know my class How many of you…

17. Getting to know my class How many of you… – Are freshman?

18. Getting to know my class How many of you… – Are freshman? – Have CptS 111 as your first class of the day?

19. Getting to know my class How many of you… – Are freshman? – Have CptS 111 as your first class of the day? – Have prior programming experience?

20. Getting to know my class How many of you… – Are freshman? – Have CptS 111 as your first class of the day? – Have prior programming experience? – Are also taking CptS 121?

21. Getting to know my class How many of you… – Are freshman? – Have CptS 111 as your first class of the day? – Have prior programming experience? – Are also taking CptS 121? – Are taking Math 171?

22. Getting to know my class How many of you… – Are freshman? – Have CptS 111 as your first class of the day? – Have prior programming experience? – Are also taking CptS 121? – Are taking Math 171? – Took the CptS placement test?

23. What can YouTube tell us about learning to program? https://www.youtube.com/watch?v=WvDedo8r1Fk

24. Programming is a skill that takes practice In order to do well in this class, you will need to dedicate time outside of lecture practicing!

25. On to an introductory lecture…

26. Computer Languages ComputersHumans 00101010110010 011000101110101 010111001001 10 0011 How can humans “talk to” (instruct) computers? Answer: Computer languages (e.g., Java, C, Python, FORTRAN, Basic, C++, Lisp, Ruby, …)

27. Computer Languages Alice Alice & Betty Betty Consider: “Alice and Betty had on the same dress.” Natural languages are often ambiguous. YESNO

28. Computer Languages Consider: “Alice and Betty ran from the same building.” AliceBetty Alice YESNO

29. Computer Languages It deosn't mttaer in waht oredr the ltteers in a word are, the iprmoatnt tihng is taht the frist and lsat ltteer are in the rghit pcale. Natural languages contain a great deal of redundant information, making them quite “fault tolerant.” Easy for a human to make sense of this despite 13 of the 27 words being misspelled.

30. Computer programs are a combination of one or more algorithms. From Merriam-Webster: – a procedure for solving a mathematical problem (as of finding the greatest common divisor) in a finite number of steps that frequently involves repetition of an operation Addendum from Adam: – An algorithm should always produce an expected result. – An algorithm must be in sufficient detail as to avoid ambiguity during execution.

31. Homework for today 1.Algorithms are everywhere (e.g. shampoo bottle). Find an algorithm to bring to Wednesday's class. Be ready to share! 2.Get an iClicker 3.Register for the course textbook on Zyante