CS 201 Course Syllabus - Tuesday, Thursday

CS 201 Course Syllabus - Tuesday, Thursday

Instructor
Eun-Young Elaine Kang, Russ Abbott and Eric Liao
Lecture Hours
Section 3, 4 Section 5, 6
Tue, Thu 11:40 ~ 2:40 @ ET A-220 Tue, Thu 3:00 ~ 6:00 @ ET A-220
Office Hours
Russ Abbott (Sect 3, 4) Eun-Young Elaine Kang (Sect 5, 6) Eric Liao (TA)
Email any time. In person by appointment. Tue, Thu 9 - 11am @ E&T A316 Mon 1 - 6pm @ Computer Science Office(E&T A-322), Tue 10:30 - 1:30pm & 3 - 6pm @ Computer Science Office(E&T A-322)
Emails
Russ Abbott (Sect 3, 4) Eun-Young Elaine Kang (Sect 5, 6) Eric Liao (TA)
russ.abbott AT gmail DOT com eykang AT calstatela DOT edu rcliao01 AT gmail DOT com
Course Number
CS 201
Course Name
Introduction to Programming
Credits
5 Units
Contact Hours
7 Hours/Week
Text Book
Big Java: Early Objects by Cay S. Horstmann ISBN: 978-1-118-43111-5
Course Information
  1. Algorithm development for structured programming and computer programming; designing, coding, debugging, and documenting programs. Laboratory activities on problem analysis and software development
  2. Prerequisites: Math 104B: College Algebra and Trigonometry.
  3. This course is required in the BS program
Course Goals
The Student Learning Outcomes that are addressed by the course are:
  • SLO #2. Students will be able to demonstrate fluency in at least one programming language and acquaintance with at least three more.
  • SLO #3. Students will have a strong foundation in the design, analysis, and application of many types of algorithms.
  • SLO #5. Students will have the training to analyze problems and identify and define the computing requirements appropriate to their solutions.
  • SLO #6. Students will have the training to design, implement, and evaluate large software systems working both individually and collaboratively.
  • SLO #7. Students will be able to communicate effectively orally and in writing.
Other outcomes of instruction: At the end of the course students are able to:
  • Divide a problem into its logical set of components
  • Have a good understanding of the basic programming concepts
  • Create simple classes with a few methods
  • Have a good understanding of how a good program design reduces coding and debugging time
  • Design and code mid-level problems
Brief List of Topics
  • Chapter 1. Introduction
  • Chapter 2. Using Objects
  • Chapter 3. Implementing Classes
  • Chapter 4. Fundamental Data Types
  • Chapter 5. Decisions
  • Chapter 6. Iteration
  • Chapter 7. Arrays and Array Lists
Laboratory Projects
Each week students will complete a 3-hour lab projects on selected topics, except the exam weeks.
Grading Policy
Participation 5%, Lab 25%, Quiz 25%, Midterm 20%, Final 25% A 90 – 100 B 80 – 90 C 60 – 80 NC below 60
Academic Integrity
Cheating will not be tolerated. Cheating on any assignment or exam will be taken seriously. All parties involved will receive a grade of F for the course and are reported to the proper authorities.
ADA Statement
Reasonable accommodation will be provided to any student who is registered with the Office of Students with Disabilities and requests needed accommodation.