SRJC Course Outlines

4/19/2024 12:26:12 PMCS 10A Course Outline as of Fall 2018

Changed Course
CATALOG INFORMATION

Discipline and Nbr:  CS 10ATitle:  INTRO TO PROGRAMMING  
Full Title:  Introduction to Programming Concepts and Methodologies
Last Reviewed:2/8/2021

UnitsCourse Hours per Week Nbr of WeeksCourse Hours Total
Maximum4.00Lecture Scheduled3.0017.5 max.Lecture Scheduled52.50
Minimum4.00Lab Scheduled3.006 min.Lab Scheduled52.50
 Contact DHR0 Contact DHR0
 Contact Total6.00 Contact Total105.00
 
 Non-contact DHR0 Non-contact DHR Total0

 Total Out of Class Hours:  105.00Total Student Learning Hours: 210.00 

Title 5 Category:  AA Degree Applicable
Grading:  Grade or P/NP
Repeatability:  00 - Two Repeats if Grade was D, F, NC, or NP
Also Listed As: 
Formerly:  CS 10

Catalog Description:
Untitled document
Specification, design, implementation, testing, debugging, maintenance, and documentation of computer programs. Topics include algorithms, languages, software engineering, control structures, functions, and arrays. Numerous programs are written in C++. Intended for both computer science majors and for those seeking a general introduction to computer programming.

Prerequisites/Corequisites:


Recommended Preparation:
Eligibility for ENGL 1A or equivalent; AND completion of MATH 155 and some computer experience

Limits on Enrollment:

Schedule of Classes Information
Description: Untitled document
Specification, design, implementation, testing, debugging, maintenance, and documentation of computer programs. Topics include algorithms, languages, software engineering, control structures, functions, and arrays. Numerous programs are written in C++. Intended for both computer science majors and for those seeking a general introduction to computer programming.
(Grade or P/NP)

Prerequisites:
Recommended:Eligibility for ENGL 1A or equivalent; AND completion of MATH 155 and some computer experience
Limits on Enrollment:
Transfer Credit:CSU;UC.
Repeatability:00 - Two Repeats if Grade was D, F, NC, or NP

ARTICULATION, MAJOR, and CERTIFICATION INFORMATION

Associate Degree:Effective:Inactive:
 Area:
 
CSU GE:Transfer Area Effective:Inactive:
 
IGETC:Transfer Area Effective:Inactive:
 
CSU Transfer:TransferableEffective:Spring 1989Inactive:
 
UC Transfer:TransferableEffective:Spring 1989Inactive:
 
C-ID:
 CID Descriptor: COMP 122 Programming Concepts and Methodology I SRJC Equivalent Course(s): CS10A OR CS10B
 CID Descriptor: COMP 112 Introduction to Programming Concepts and Methodologies  SRJC Equivalent Course(s): CS10A

Certificate/Major Applicable: Both Certificate and Major Applicable

Approval and Dates
Version:011Course Created/Approved: 3/9/1989
Version Created:4/17/2017Course Last Modified:8/15/2021
Submitter:Dave HardenCourse Last Full Review:2/8/2021
Version Status:Approved Changed CoursePrereq Created/Approved:2/8/2021
Version Status Date:5/8/2017Semester Last Taught:Summer 2021
Version Term Effective:Fall 2018Term Inactive:Fall 2021


COURSE CONTENT

Student Learning Outcomes:
At the conclusion of this course, the student should be able to:
Untitled document
1.  Describe the principles of structured programming and be able to describe, design, implement,
    and test structured programs using currently accepted methodology.
2.  Explain what an algorithm is and its importance in computer programming.
 

Objectives: Untitled document
Upon completion of this course students will be able to:
1. Create correct and efficient algorithms.
2. Describe the software-development life cycle.
3. Employ the basic elements of the C++ language.
4. Implement algorithms using C++ flow-control constructs.
5. Write descriptive and helpful program documentation.
6. Implement algorithms using arrays.

Topics and Scope
Untitled document
I. Software life-cycle including design, development, styles, documentation, testing and maintenance
II. Procedural versus objected oriented programming - Survey of Current Languages
III. Program Design Tools and Programming Environments
IV. Documentation
V. Coding Conventions
VI. Data Types, Variables, Expressions, Sequential Processing
VII. Arrays
       A. Declaring and allocating arrays
       B. Multiple-subscripted arrays
VIII. Control Structure
        A. Selective structures: if and switch
        B. Repetitive structures: loops
IX. Algorithms including Simple Sorting and Searching
X. File I/O
    A. Files and streams
    B. Sequential access files
XI. Error Handling
XII. Passing Parameters by Value and by Reference
XIII. Principles of Testing and Designing Test Data
 
All topics are covered in both the lecture and lab parts of the course.

Assignments:
Untitled document
Lecture Related Assignments:
1. Read approximately 30 pages per week
2. Complete 2-8 examinations including final exam
 
Lab Related Assignments:
1. Complete 10-15 programming assignments,with documentation, using the C++ programming
    language

Methods of Evaluation/Basis of Grade.
Writing: Assessment tools that demonstrate writing skill and/or require students to select, organize and explain ideas in writing.Writing
10 - 20%
Written program documentation
Problem solving: Assessment tools, other than exams, that demonstrate competence in computational or non-computational problem solving skills.Problem Solving
20 - 60%
Programming assignments
Skill Demonstrations: All skill-based and physical demonstrations used for assessment purposes including skill performance exams.Skill Demonstrations
0 - 0%
None
Exams: All forms of formal testing, other than skill performance exams.Exams
20 - 60%
Exams, Final Exam: (Multiple choice, true/false, matching items, completion, programming problems)
Other: Includes any assessment tools that do not logically fit into the above categories.Other Category
0 - 0%
None


Representative Textbooks and Materials:
Untitled document
Starting Out with C++ From Control Structures through Objects. 8th ed. Gaddis, Tony. Pearson. 2014

OTHER REQUIRED ELEMENTS

Student Preparation
 Matric Assessment Required:BRequires Both English & Math Assessment
 Prerequisites-generate description:NPNo Prerequisite
 Advisories-generate description:UUser-Generated Text
 Prereq-provisional:NNO
 Prereq/coreq-registration check:NNo Prerequisite Rules Exist
 Requires instructor signature:NInstructor's Signature Not Required
   
BASIC INFORMATION, HOURS/UNITS & REPEATABILITY
 Method of instruction:02Lecture
 04Laboratory
 72Internet-Based, Delayed Interaction
 71Internet-Based, Simultaneous Interaction
 Area department:CSComputer Studies
 Division:72Arts & Humanities
 Special topic course:NNot a Special Topic Course
 Program Status:1Both Certificate and Major Applicable
 Repeatability:00Two Repeats if Grade was D, F, NC, or NP
 Repeat group id:  
   
SCHEDULING
 Audit allowed:YAuditable
 Open entry/exit:NNot Open Entry/Open Exit
 Credit by Exam:NCredit by examination not allowed
 Budget code: Program:0000Unrestricted
 Budget code: Activity:0701Computer & Information Science
   
OTHER CODES
Disciplines:Computer Science
 Basic Skills:NNot a Basic Skills Course
 Level below transfer:YNot Applicable
 CVU/CVC status:YDistance Ed, Not CVU/CVC Developed
 Distance Ed Approved:YExclusively online or other technology based instruction
 Emergency Distance Ed Approved:N
 Credit for Prior Learning:NAgency Exam
NCBE
NIndustry Credentials
NPortfolio
 Non-credit category:YNot Applicable, Credit Course
 Classification:YLiberal Arts and Sciences Courses
 SAM classification:ENon-Occupational
 TOP code:0706.00Computer Science (Transfer)
 Work-based learning:NDoes Not Include Work-Based Learning
 DSPS course:NNO
 In-service:NNot an in-Service Course
 Lab Tier:23Credit Lab - Tier 3

Print PDF