COURSE
OUTLINE
CS 101 Exploring
Creative Computing Fall 2016 Paul
L. Schumacher
MWF 11:00 - 11:50
or 12:00 1:20 103 G Watkiins
209 A Watkins Ext 5656
pschumacher@winona.edu Website http://cs.winona.edu/schumacher/
Course Description:
CS101, is an introduction to computing based upon
University of California
Berkeleys Beauty and Joy of Computing course
(bjc.berkeley.edu. We will solve fun
problems and use SNAP!, an easy to use, visual
programming language.
CS Principles Big Ideas:
1.Creativity: Computing is a creative
activity.
2.Abstraction: Abstraction reduces information
and detail to facilitate focus on relevant concepts.
3.Data: Data and information facilitate
the creation of knowledge.
4.Algorithms: Algorithms are used to develop
and express solutions to computational problems.
5.Programming: Programming enables problem
solving, human expression and creation of knowledge.
6.Internet: The Internet pervades modern
computing.
7.Impact: Computing has global impacts
Text:Blown to Bits --Your Life, Liberty,
and Happiness After the Digital Explosion,
Hal Abelson, Ken Ledeen and Harry Lewis,Addison-Wesley, 2008. Available online at no
cost. (www.bitsbook.com)
Prerequisite: No
prerequisites, other than curiosity and a desire to learn.
You will need a
university approved
laptop and internet access on campus
Course Objectives and
Expectations:
Upon entering CS 101,
students should have
basic
skills in time management, and good study habits.
curiosity and desire to meet
challenges and solve problems
Upon completing CS
234, student should accomplish the following learning outcomes.
knowledge of the
seven big ideas.
basic
skills in using SNAP! to create solutions to problems
you have solved and designed.
COURSE OUTLINE
CS 101 Exploring Creative Computing Fall 2016 Paul L. Schumacher
MWF 11:00 - 11:50
or 12:00 1:20 103 G Watkiins
209 A Watkins Ext 5656
CLASS POLICIES
1. Attendance ‑‑ Attendance is not used for grading purposes, however it is
to your best interest to attend and actively participate in each session. The more actively you become involved in the
course, the more benefit you will gain from the course, because you learn most
by doing, experimenting, and trying things in computer science.
2. Grading ‑‑ Grading
is rather simple. Calculate your
percentage of the possible points by dividing points earned by total points
possible and
multiplying by 100. The
assignments are 60 percent of the grade.
However, you must earn at least 65% of the points possible for the
assignments to pass the course. Test
scores make up the other 40% of your grade.
There will be one mid term test and a final
exam. Pop quizes
are possible at any time and will be counted.
Grades are curved over the class. Tests may not be made up, except by
prior arrangement.
3. Assignments ‑‑ These will consist of homework
exercises and programming problems. They
are due at the beginning of the class period on the due date. Late assignments are not accepted, except in
very unusual circumstances, and then with prior approval only.
4. Plagiarism & Cheating‑‑
Passing off as your own, work done by someone else, or using notes etc during a test.
cheating results in
failing the course and other possible severe penalties.
In this course, I
encourage you to help each other On many things we will work together to do
exercises. There will be some things
that you will do by yourself, and if you need help you can see me or our lab assistanct. I will
make these assignments that you work on alone clear.
COURSE OUTLINE
CS 101-01
Exploring Creative Computing Fall 2016 Paul L. Schumacher
MWF 11:00 - 11:50
or 12:00 1:20 103 G Watkiins
209 A
Watkins Ext 5656
DATE TOPIC READING ASSIGN LAB
TEST
8-22,24 Intro to the
Course, None Get BtB
8-26 SNAP!
8-29,31 Abstraction Into to Abstraction
9-2 Animation \
9-9 SNAP!, BYOB BtB, preface Minor
1: Input, random,
9-11 Computer impact info List intro
9-12,14 Impact BtB, Chap 1 More
lists
9-16 Algorithms
9-19,21 Algorithms BtB,
Chap 2 Minor 2: growth
9-23 count
letters functions
9-26,28 Recursion BtB, Chap 3 Algorithm
9-30 Speed
10-3,5 Recursion BtB,
Chap 4 Minor 3: Recursion
10-7 guess numb
10-10,12 Programing None Plan Test 1
10-14 Paradigmns Project
10-17,19 Impact BtB, Chap 7 Minor 4: Recursive
10-21 Write
Essay Reporters
10-24,26 Big Data BtB,
Chap 6 Big
Data
10-28
10-31 Artificial AI Notes Major
1: Map Reduce
11-2,4 Intelligence Project
11-7 Robotics Robbie,
the Project
Work
11-9 Killer
Robot
11-14,16 Internet, BtB,appendix Project
Work
11-18 Simulations
11-21 Internet BtB, Chap 8 thanksgiving!
11-28,30 Arrays
12-2 Privacy
and Security BtB,
Chap 5 Project
Work
Depends on
Section Final Exam on all topics
covered ........................ Final
Exam