Lecture 1
1/20/04
1/20/04
CS 100
Lecture 1
Introduction to Computers
and Computation
Course Information
&
Introduction to Computer Science
CS 100 - Lecture 1
1
• Instructor: Bruce MacLennan, Ph.D.
• Course website:
http://www.cs.utk.edu/~cs100
– there will not be a seat for you
– we take attendance
– contact information for instructor, TAs
– syllabus, schedules, handouts, etc.
• If you need to change sections, see us after
class
3
1/20/04
Important Notice
CS 100
CS 100 - Lecture 1
4
CS 100 is a “Q” Course
• CS100 has been substantially revised &
upgraded
• It will be much more technical than in the
past
• Do not assume that anything you have heard
about the course will still apply
• CS 100 has been designated as a “Q” course to
satisfy UT’s quantitative reasoning requirement
• Such a course must integrate quantitative
reasoning as a vital component, e.g.:
1/20/04
1/20/04
CS 100 - Lecture 1
2
• All the sections of CS 100 are full
• You must attend the laboratory section for
which you are registered
(maclennan@cs.utk.edu, 4-5067, Claxton 217)
CS 100 - Lecture 1
CS 100 - Lecture 1
Important Notice on Laboratory
Sections
Course Information
1/20/04
1/20/04
5
– explicit quantitative reasoning instruction
– regular opportunities for quantitative skill development
– regular opportunities for application/problem solving
requiring quantitative reasoning skills
CS 100 - Lecture 1
6
1
Lecture 1
1/20/04
What This Course Isn’t
Our Expectations
• It will not teach you to:
–
–
–
–
• In fact, we assume that you know:
browse the internet
use email or online forums or chat-rooms
use a word processor (e.g. Microsoft Word™)
use various proprietary applications (e.g.,
Excel™, PowerPoint™)
– how to send & read email
– how to surf the web
– how to type a paper in a word processor
• To acquire such skills, take short courses
from OIT (Office of Information
Technology): http://oit.utk.edu/training.html
1/20/04
CS 100 - Lecture 1
7
• If you lack one of these, or have limited
experience, that’s not a problem
• We don’t assume you know how to use the
specific applications we will be using
1/20/04
• A well-integrated, coherent body of
knowledge:
• Introduction to fundamental concepts of CS
(theory, hardware, software)
• Exploration of intellectual impact of CS on
other disciplines
• Exploration of practical impact of CS on
other disciplines
CS 100 - Lecture 1
– theoretical, experimental, technological,
engineering
• ~50 years as independent discipline, but
much deeper historical roots
• We will focus on fundamental ideas of
long-lasting value
9
1/20/04
Intellectual Impact
1/20/04
CS 100
10
• CS has changed how many people go about
their business
• Communication
• Information technology
• Data analysis & visualization
• Computational science (simulation)
• etc.
cognitive science
neuroscience
genetics
physics (“it from bit”)
etc.
CS 100 - Lecture 1
CS 100 - Lecture 1
Practical Impact
• Ideas from CS are used in many other
disciplines:
–
–
–
–
–
8
The Discipline of
Computer Science
What This Course Is
1/20/04
CS 100 - Lecture 1
11
1/20/04
CS 100 - Lecture 1
12
2
Lecture 1
1/20/04
Schedule & Required Reading
Required Textbooks
• Will cover ~1 chapter per week
• You are responsible for everything in S&G
unless I say otherwise
• You are responsible for reading the chapter
of S&G before it is discussed in class
• Lectures will focus on difficult &
supplementary topics
• Read ch. 1 of S&G for the next class
• Schneider & Gersting: An Invitation to
Computer Science: Java Version
(Brooks/Cole 2000)
• Lambert & Whaley: Lab Manual to
Accompany Schneider & Gersting: An Invitation
to Computer Science: Java Version
(Brooks/Cole 2000)
1/20/04
CS 100 - Lecture 1
13
1/20/04
• Total points: 500
• Essential to solid understanding of CS
• We take attendance at labs
• We do not penalize for non-attendance (so
long as you do the labs on time)
• However, regular lab attendance may help
your grade, if it is borderline
• Laboratories are held in the Crux Lab,
Claxton Complex 104
CS 100 - Lecture 1
14
Grading
Laboratories
1/20/04
CS 100 - Lecture 1
6 homeworks: 20 each, 100 maximum
6 quizzes: 20 each, 100 maximum
13 labs: 10 each, 120 maximum
comprehensive final: 180
• We will drop the lowest homework, quiz,
and lab grade
• Keep your graded papers
• Subject to change!
15
1/20/04
CS 100 - Lecture 1
16
Grading Scale
Introduction to Computer Science
F
D
C
B
A
(Ch. 1 of S&G)
• Grades will be curved
• As a result:
~38% C’s
~24% B’s and D’s
~7% A’s and F’s
1/20/04
CS 100
CS 100 - Lecture 1
17
1/20/04
CS 100 - Lecture 1
18
3
Lecture 1
1/20/04
Misconceptions About CS
Definition of CS
• Computer science is the study of computers
Computer Science is the study of algorithms,
including:
• Their formal and mathematical properties
• Their hardware realizations
• Their linguistic realizations
• Their applications
• Computer science is the study of how to
write computer programs
• Computer science is the study of the uses
and applications of computers and software
1/20/04
CS 100 - Lecture 1
19
1/20/04
• Named for al-Khowarizmi
(780–850 CE)
• Persian mathematician &
teacher at Mathematics Inst.
in Baghdad
• Described procedures for
doing arithmetic with
Hindu-Arabic numerals
• These procedures were
called “algorithms”
CS 100 - Lecture 1
1. Place AB, BC in straight line
2. Upon AC draw semicircle
ADC
3. From B draw BD
perpendicular to AC
4. DB is required mean
proportional between AB and
BC
— Euclid (3rd cent. BCE), Bk. VI, Prob. 13
21
Algorithms Make Use of Other
Algorithms
– How do you do this?
– How do you do this?
22
– to draw straight line from any point to any other
– to continue a terminated line to any required length
– to draw a circle with any required center and radius
• Algorithms for these operations are given
elsewhere in Euclid
• Where does this stop? What can we assume?
CS 100
CS 100 - Lecture 1
• Human algorithms are always in a context
• We assume the agent following the algorithm can
perform certain basic operations
• E.g., Euclidean postulates:
• It says, “From B draw BD perpendicular to AC”
CS 100 - Lecture 1
1/20/04
Context of Human Algorithms
• It says, “Upon AC draw semicircle ADC”
1/20/04
20
To find mean proportional
between AB and BC
“Algorithm”
1/20/04
CS 100 - Lecture 1
• It is an algorithm (precisely defined procedure)
only for agents with the relevant competence
23
1/20/04
CS 100 - Lecture 1
24
4
Lecture 1
1/20/04
Extraction of Square Root
1.
2.
3.
4.
5.
6.
7.
1/20/04
CS 100
Separate number into periods of two figures each, beginning at right
Find greatest square in first period on left, and write down its root to
right as first part of result.
Subtract square of root from first period, and to remainder bring
down second period.
Double this root and place to left as divisor.
See how many times divisor goes into dividend, exclusive of righthand figure, and place figure in root and at right end of divisor.
Multiply this augmented divisor by last figure of root, and subtract
product from dividend, and to the remainder bring down next period
as new dividend. But if any of products are greater than dividend,
diminish last figure of root.
Double whole root already found, for a new divisor, and continue
the operation as before, until all periods are brought down.
CS 100 - Lecture 1
25
5