0% found this document useful (0 votes)
18 views11 pages

COURSE SYLLABUS CC 103

The document is a course syllabus for Computer Programming 2 (CC 103) at South Central Mindanao College of Science and Technology, outlining its vision, mission, objectives, and course content. It emphasizes the importance of data structures and algorithms in programming, with a focus on Java language and various programming concepts. The syllabus also includes course requirements, grading system, and policies regarding attendance and participation.

Uploaded by

Noriel Galoso
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
18 views11 pages

COURSE SYLLABUS CC 103

The document is a course syllabus for Computer Programming 2 (CC 103) at South Central Mindanao College of Science and Technology, outlining its vision, mission, objectives, and course content. It emphasizes the importance of data structures and algorithms in programming, with a focus on Java language and various programming concepts. The syllabus also includes course requirements, grading system, and policies regarding attendance and participation.

Uploaded by

Noriel Galoso
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 11

REPUBLIC OF THE PHILIPPINES

SOUTH CENTRAL MINDANAO COLLEGE OF SCIENCE AND TECHNOLOGY INC.


Purok Rosal, Barangay New Isabela
City of Tacurong, Sultan Kudarat

COURSE SYLLABUS

COURSE NO. CC 103 UNITS: 3


COURSE TITLE: COMPUTER PROGRAMMING 2 PRE-REQUISITE: CC 102

VISION OF THE INSTITUTION


The academe envisions of providing graduates who are God-fearing patriotic, academically competent and skillful individuals. It is committed to
offer a safety environment with innovative approaches in teaching and learning process and always be of service to its community.

MISSION OF THE INSTITUTION


The academe is fully committed to foster and sustain quality education, where students honed their potential in a safe and caring environment.
Teachers passionately foster learning which competence and provide an avenue that may bring out student’s skills in challenging and enjoyable
way.
Administrations endeavor to be of help always to support and impose programs that will promote quality teaching learning. Individuals in the
locality are highly enjoined to share responsibility and be part of implementing programs that will develop quality and skillful individuals.
OBJECTIVES
To introduced students the right choice of data structure and algorithm can lower the costs and increase the benefits by cutting down space and
time complexity. It allows the right access and modifications to data. Data structure defines the relationship between the elements and their
correct role in the problem-solution. Allow to assess how the choice of data structures and algorithm design methods impacts the performance of
programs.

PROGRAM OUTCOME
The purpose of this course is to teach students implement the different data structures and solutions for specific problems.

COURSE OUTCOME
This course provides in depths on how the choice of data structures and algorithm design methods impacts the performance of programs.

Course No.: CC 103 Pre-requisite: CC 102


Subject Description: Computer Programming 2 Credit: 3 Units
Semester: 2nd Semester No. of Hours: 18 WEEKS
COMPETENCIES
Allocate duties and responsibilities with regard to the skills, knowledge, and aptitude required to properly undertake the assigned task and
prepare tools and instruments used in computer.
Understanding of Algorithm Analysis by describing the role of algorithms in computing.
Demonstrate an understanding of and proficiency in the use of Stacks and Queues.

GENERAL OBJECTIVES
The students must be able to:
 Assess how the choice of data structures and algorithm design methods impacts the performance of programs.
 Choose the appropriate data structure and algorithm design method for a specified application.
 Write programs using object-oriented design principles.
 Solve problems using algorithm design methods such as the greedy method, divide and conquer, dynamic programming, backtracking,
and branch and bound and writing programs for these solutions.

SOUTH CENTRAL MINDANAO COLLEGE OF Bachelor of Science in Information System


SCIENCE AND TECHNOLOGY INC.
COURSE OUTLINE Page No.
Page 2

Chapter 1: Programming Concepts


Lesson 1: Defining the Problem
Lesson 2: Compiling, Debugging and Testing the Program
Lesson 3: Types of Programming Languages
Lesson 4: Interpreters and Compilers
Lesson 5: Programming Diagrams

Chapter 2: Introduction to Java Language


Lesson 1: Introduction
Lesson 2: Java Applications, Characteristics and Benefits
Lesson 3: Analyzing the Programs
Lesson 4: Importance of Comments on Programs
Lesson 5: Data Type
Chapter 3: Conditional Statement
Lesson 1: If Statements
Lesson 2: switch Statements

Chapter 4: Looping Statements


Lesson 1: for loop Statement
Lesson 2: while loop Statement
Lesson 3: do while loop Statement

Chapter 5: Arrays
Lesson 1: Syntax of One-Dimensional Array
Lesson 2: Syntax of Two-Dimensional Array

Desired Learnings Course Content/ Textbook/ Teaching Achievement/Achieve Resource Time


Outcome Subject Matter References Delivery Learning Outcome Materials Allotment
(DLO) (OBTL) (ALO)
The students must Class Orientation -Students Orientation Class Participation - Books Week 1
have: -School policies Handbook - Laptop/Computer Every TTh
a. Understand the -Teacher Policies -Course Syllabus - Online References 1:00-
total course. -Course Outcome 2:30PM
b. Review school -Course Outline
and teachers’ -Requirements
policies. -Textbooks
c. Define the reason -References
for studying
Computer
Programming

(Jake R. -Lecture/Discussion - Class Participation - Handouts Week 2,


1. The students must be Chapter 1: Pomperada, - Answering - Oral Recitation - Online References 3,4, 5 Every
able to: Programming Concepts MAED-IT, student’s questions - Quizzes - Laptop/Computer TTh 1:00-
Revised Edition) - Exercises - Hands-on - Books 2:30PM
1.1 Assess how the 1.1 Defining the Problem (Introduction to - Quizzes
choice of data structures 1.2 Compiling, Java - Hands-on
and algorithm design Debugging and Programming)
methods impacts the Testing the Program
performance of 1.3 Types of
programs. Programming
Languages
1.4 Interpreters and
Compilers
1.5 Programming
Diagrams

2. The students should: Chapter 2: (Jake R. -Lecture/Discussion - Class Participation - Handouts Week
Introduction to Java Pomperada, - Answering - Oral Recitation - Online References 6,7,8,9
2.1 Choose the Language MAED-IT, student’s questions - Quizzes - Laptop/Computer Every TTh
appropriate data Revised Edition) - Exercises - Hands-on - Books 1:00-
structure and 2.1 Introduction (Introduction to - Quizzes 2:30PM
algorithm design 2.2 Java Applications, Java - Hands-on
method for a Characteristics and Programming)
specified application. Benefits
2.3 Analyzing the
Programs
2.4 Importance of
Comments on
Programs
2.5 Data Type

(Jake R. -Lecture/Discussion - Class Participation - Handouts Week 10, 11


3. The students must be Chapter 3: Conditional Pomperada, - Answering - Oral Recitation - Online References Every TTh
able to: Statement MAED-IT, student’s questions - Quizzes - Laptop/Computer 1:00-
Revised Edition) - Exercises - Hands-on - Books 2:30PM
3.1 Write programs using 3.1 if Statements (Introduction to - Quizzes
object-oriented design 3.2 switch Statement Java - Hands-on
principles Programming)

(Jake R. -Lecture/Discussion - Class Participation - Handouts Week 12,


4. The students must be Chapter 4: Looping Pomperada, - Answering - Oral Recitation - Online References 13, 14, 15
able to: Statements MAED-IT, student’s questions - Quizzes - Laptop/Computer Every TTh
Revised Edition) - Exercises - Hands-on - Books 1:00-
4.1 Solve problems using 4.1 for loop Statement (Introduction to - Quizzes 2:30PM
algorithm design 4.2 while loop Statement Java - Hands-on
methods such as the 4.3 do while loop Programming)
greedy method, divide Statement
and conquer, dynamic
programming,
backtracking, and branch
and bound and writing
programs for these
solutions.

Chapter 5: Arrays (Jake R. -Lecture/Discussion - Class Participation - Handouts Week 16,


5. The students must be Pomperada, - Answering - Oral Recitation - Online References 17, 18
able to: 5.1 Syntax of One- MAED-IT, student’s questions - Quizzes - Laptop/Computer Every TTh
Dimensional Array Revised Edition) - Exercises - Hands-on Activity - Books 1:00-
5.1 Understand and use 5.2 Syntax of Two- (Introduction to - Quizzes 2:00PM
the proper return syntax Dimensional Array Java - Hands-on Activity
Programming)

COURSE POLICIES
Be responsible for your own actions.

Class Presence and Participation - Class presence and participation points are given to encourage your active class participation and
discussion. You will be rewarded with a perfect score as long as you frequently come to class and actively contribute to the class discussion
during recitations and lectures.
Use of Mobile Devices - allow you to take notes on your laptop, but you must turn the sound off so that you do not disrupt other students'
learning. If you are doing anything other than taking notes on your laptop, please sit in the back row so that other students are not distracted by
your screen.
Respect due dates – No late projects, papers or quizzes will be accepted unless you have made prior arrangements in writing with the instructor
and have a valid and document reason. All late projects are accepted will receive a 10% points penalty.
Quizzes – Make-up quizzes must be done on or before the next class session. A 10% points penalty will be taken off the total available points on
any make-up quizzes.
Cheating - Anyone caught cheating on a quiz or exam will receive a failing grade and will also be reported to the Office of Student Conduct. In
order to guarantee that you are not suspected of cheating, please keep your eyes on your own materials and do not converse with others during
the quizzes and exams.
Plagiarism - You must be original in composing the writing assignments in this class. To copy text or ideas from another source (including your
own previously, or concurrently, submitted course work) without appropriate reference is plagiarism and will result in a failing grade for your
assignment and usually further disciplinary action.

COURSE REQUIREMENTS:
 Attendance per school policy.
 Active participation in class discussions and laboratories.
 On-time submission of projects and assignments.
 Students are expected to read the text materials in order for them to intelligently participate in classroom discussion.
 Quizzes, periodical examination and board works.

Course Requirements:
 Attendance per school policy. GRADE EQUIVALENT
 Active participation in class discussions and workshops.
 On-time submission of projects and assignments.
PERCENTAGE NUMERICAL GRADE
 Students are expected to read the text materials in order for PERCENTAGE DESCRIPTION
them to Intelligently participate in classroom discussion.
 Quizzes, periodical examination, & board works. 99-100 1.00 Excellent
96-98 1.25
93-95 1.50
Grading System: 90-92 1.75
A. With Laboratory B. Without Laboratory 87-89 2.00 Very Good
Examinations 40% Examinations 40% 84-86 2.25
Assignments 10% Assignments 20% 81-83 2.50
Quizzes 20% Quizzes 20% 78-80 2.75
Class Recitation 10% Class Recitation 20%
75-77 3.00
Laboratory 20% 100%
100% 74 and below FAILED
DRP DROPPED

Consultation Period
1:00-2:30 PM / TTH / BSIS OFFICE
LIST OF TEXTBOOKS

Introduction to JAVA Programming, Revised Edition, Jake R. Pomperada, MAED-IT

Prepared by: Checked by: Reviewed by: Noted by: Approved by:

NORIEL A. GALOSO JOHN REY H. ALAZA OWEN LLOYD G. CHIVA, LIGAYA A. CATEDRILLA, FILIPINAS C.
Course Facilitator Department Head MBA Ed. D, BATCHAR
Academic Coordinator Office of the College Dean VP of Academic Affairs

You might also like